duplicate of https://gateoverflow.in/85928/hamming-code

The Gateway to Computer Science Excellence

0 votes

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?

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?

0

Although the first parity bit can detect even-numbered bits and the second parity bit can detect odd-numbered bits, this coding scheme can only detect ALL single error for sure, that is, d=1.

Therefore, the Hamming distance is d+1=2.

Although it can sometimes detect 2 errors (one even-numbered, one odd-numbered),

it cannot detect all the 2 errors.(think about it ?? you will get answer)

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.4k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.7k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,666 questions

56,157 answers

193,767 comments

93,748 users