# GeeksforGeeks [closed]

157 views

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 r0 through r3, and columns d7 through d1) and is padded with a column d0 and row r4 of parity bits computed using the Even parity scheme. Each bit of column d0 (respectively, row r4) 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 mini­mum possible value of n?

1. 1
2. 2
3. 3
4. 4
closed with the note: Doubt cleared

closed
0
Can someone help me with this?
0

@Ashish Goyal

is it 3?

1

yes @muthu kumar, it is 3. Thanks for the help, I had posted this long back. i got the solution now. Was making a small mistake. Thanks:)

## Related questions

1
626 views
23: We need a dataword of at least 11 bits. Find the values of k and n in the Hamming code C(n, k) with dmin :3. Soln: We need to find k = 2m −1 − m ≥ 11. We use trial and error to find the right answer: a. Let m = 1 k = 2m −1 − m = 21 −1 − 1 = 0 (not acceptable) b ... = 4 k = 2m −1 − m = 24 −1 − 4 = 11 (acceptable) Comment: The code is C(15, 11) with dmin = 3. How this n=15 came?? please explain