The Gateway to Computer Science Excellence
+2 votes
To provide more reliability than the Single Parity Bit technique, a new error-detecting scheme has been proposed. The scheme uses first parity bit for checking all the odd numbered bits and a second parity bit for all the even numbered bits. What is the (minimum) Hamming distance of this code ?
in Computer Networks by | 1.1k views

1 Answer

+4 votes
Best answer

Here we need to know : 

a) Minimum Hamming distance needed to detect 'd' errors  =  d + 1

b) Minimum Hamming distance needed to correct 'd' errors  =  2d + 1

c) A simple parity scheme has one bit error detecting capability

In the modified parity scheme , we can detect two errors as we are using two separate parity bits ; one for checking bits at odd-numbered positions and other at even numbered positions.

Hence number of errors that can be detected   =  2 (corresponding to each parity bit we have one error which can be detected)

Hence minimum hamming distance needed for error detection   =  d + 1   =  2 + 1  = 3

          minimum hamming distance needed for error correction  =  2d + 1   =  2(2) + 1   =   5

selected by
in question, it wasn't mentioned about error correction or detection, so what needs to be assumed ?
As parity bit is used for error detection , so Hamming distance w.r.t error detection makes more sense.
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
52,345 questions
60,501 answers
95,326 users