Sometimes, instead of errors, bits are erased during the transmission of a message or from a tape or other storage medium. The position, but not the value, of an erased bit is known. We say that a code C can correct r erasures if a message received with no errors and with no more than r erasures can be corrected to a unique codeword that agrees with the message received in all the positions that were not erased. a) Show that a binary code of minimum distance d can correct d − 1 erasures. b) Show that a binary code of minimum distance d can correct t errors and r erasures if d = 2t + r + 1.

step-by-step explanation:

i believe its "c" because all of the other options include a but it could be d because there is a way of financing with cash at certain places but its uncommon.

students group

step-by-step explanation:

a person who   joins a party or a seminar can explain his feelings about that particular occasion better more than anyone else.

as bella managed a show for the students in the school and invited students to watch that show

hence

students group will be the best group to survey to find this information

choose (5, 1.5) and (-1.5,-3.5)

step-by-step explanation:

5 - 1.5 =3.5

-1.5 - (-3.5) = 2

3.5 + 2 =5.5

hope this !