Cyclic redundancy check and hamming code works on data of ................. and ............ respectively.
MH SET - 2020, SET Exam - 2020,
Answer: C
CRC and Hamming code work on data of any size and fixed size respectively.
A cyclic redundancy check divides the whole message, of any length, by a generator polynomial and appends the remainder, so it can protect frames of arbitrary size. A Hamming code is a block code: a fixed number of data bits (for example 4 in the (7,4) code) is combined with a fixed number of parity bits, so it works on fixed-size blocks.
The options with 8-bit, 2-bit or fixed size for CRC reverse or misstate this.
Please log in or register to report this question.