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?
in Computer Networks by Boss (10.5k points)
edited by | 45 views

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)

Please log in or register to answer this question.

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,666 questions
56,157 answers
93,748 users