The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
156 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 (383 points)
closed by | 156 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.3k points)

Related questions

+3 votes
1 answer
3
asked Jan 25 in Computer Networks by Pawan Kumar 2 Active (4.7k points) | 233 views
+3 votes
2 answers
4
0 votes
1 answer
5
0 votes
1 answer
6
0 votes
2 answers
7


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

44,116 questions
49,618 answers
163,103 comments
65,801 users