Information Theory and Coding Basics

Four rows of 4-bit data were sent with an even parity bit for each row at its right end and a final row of even parity bits for each column (vertical and horizontal parity). The received bits were row 1: 1011 1, row 2: 0100 0, row 3: 1100 0, row 4: 0101 0 and parity row: 0100 (the rightmost bit of each row is its row parity). If exactly one bit is wrong, which of the following is its position?

  1. ARow 1 and column 3
  2. BRow 2 and column 3
  3. CRow 3 and column 2
Show answer and explanation

Answer: B. Row 2 and column 3

Counting the 1s in each row, including the parity bit, gives 4 for row 1, 1 for row 2, 2 for row 3 and 2 for row 4, so only row 2 is odd. Counting the 1s in each column, including the parity row, gives 2 for column 1, 4 for column 2, 1 for column 3 and 2 for column 4, so only column 3 is odd. Therefore the bit where row 2 and column 3 cross is wrong, and flipping it corrects the error.

  • A. Row 1 has four 1s, an even number, so row 1 contains no error.
  • B. Correct. Exactly one row and one column are odd, and the bit at their intersection is the wrong one.
  • C. This mixes up rows and columns. Row 3 has two 1s, an even number, so it contains no error.
Practice this topic Back to topic

Books on Information Theory and Coding Basics Ad

As an Amazon Associate I earn from qualifying purchases.

More Information Theory and Coding Basics questions

  1. Data are added up one byte at a time, and the low 8 bits of the sum are sent along as a check value (checksum). Which of the following errors cannot be detected by this check?
  2. Three CRC check bits for the generator polynomial x³ + x + 1 (bit string 1011) are to be appended to the data 1101. The check bits are the remainder of dividing 1101000, the data followed by three 0s, by 1011, using exclusive OR instead of subtraction in the division. Which of the following are the check bits?
  3. Which of the following correctly describes a CRC whose generator polynomial has degree r (r check bits) and a constant term of 1?
  4. Which of the following is the Hamming distance between the two 7-bit codewords 1011010 and 0110011?
  5. The minimum Hamming distance of a code (the smallest Hamming distance between any two codewords) is 5. Consider using it only for error detection, or only for error correction. Which of the following correctly pairs the number of bit errors that can always be detected with the number that can always be corrected?