The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
140 views

To provide more reliability than a single parity bit can give,an error-detecting coding scheme uses one parity bit for checking all the odd-numbered bits and a second parity bit for all the even-numbered bits.

What is the hamming distance of this code?

closed with the note: Answered Correctly
asked in Computer Networks by (375 points)
closed by | 140 views

1 Answer

+1 vote
min hamming distance is 2

considering binary codes; and maintaining odd parity for both the 0's and 1's
answered by Active (2.2k points)

Related questions

+3 votes
0 answers
1
asked Jan 25 in Computer Networks by Pawan Kumar 2 Active (4.5k points) | 187 views
+2 votes
2 answers
2
0 votes
1 answer
3


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

38,101 questions
45,600 answers
132,202 comments
49,179 users