The Gateway to Computer Science Excellence
0 votes
84 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.
2008_66 
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
in Computer Networks by (417 points)
closed by | 84 views
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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,503 answers
195,553 comments
101,039 users