Data transmitted on a link uses the following 2D parity scheme for error detection:
Each sequence of 28 bits is arranged in a 4×7 matrix (rows r
0 through r
3, and columns d
7 through d
1) and is padded with a column d
0 and row r
4 of parity bits computed using the Even parity scheme. Each bit of column d
0 (respectively, row r
4) gives the parity of the corresponding row (respectively, column). These 40 bits are transmitted over the data link.
The table shows data received by a receiver and has n corrupted bits. What is the minimum possible value of n?