closed by
1,031 views
0 votes
0 votes
closed with the note: Answered Correctly

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 by

1 Answer

1 votes
1 votes
min hamming distance is 2

considering binary codes; and maintaining odd parity for both the 0's and 1's

Related questions

0 votes
0 votes
0 answers
1
Ray Tomlinson asked Aug 17, 2023
382 views
in reciever side to detect err which one representation we should follow to know that in which bit error is present in hamming code?p1p2d1p4d2d3d4p8d5d6 d6d5p8d4d3d2p4d1p...
0 votes
0 votes
0 answers
2
Rahul_Rathod_ asked Jan 19, 2019
584 views
what is approach to solve this type of question?
1 votes
1 votes
0 answers
3
saurav raghaw asked Dec 27, 2018
984 views
Find the check bit in the message 111101 using HAMMING CODE?(1) 1101(2) 0101(3) 1001(4) 0001
2 votes
2 votes
2 answers
4
iarnav asked Nov 19, 2018
3,031 views
If the Hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error.A) 5 B) 4 C) 3 D) none of the above