Scribd
Upload
29 views1 page

Number Systems and Codes Assignments: N n-1 n-2 0 N n-1 n-2 0 I N n-1 n-2 I N N

The document discusses four codes - Code A, B, C, and D - and their ability to detect or correct single, double, and triple errors. It also provides two assignments: 1) to design single error correcting Hamming codes for 5 and 6 message bits, and 2) to prove a relationship between the digits of a Gray code word and its corresponding binary number.

Uploaded by

anusha12344321
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views1 page

Number Systems and Codes Assignments: N n-1 n-2 0 N n-1 n-2 0 I N n-1 n-2 I N N

The document discusses four codes - Code A, B, C, and D - and their ability to detect or correct single, double, and triple errors. It also provides two assignments: 1) to design single error correcting Hamming codes for 5 and 6 message bits, and 2) to prove a relationship between the digits of a Gray code word and its corresponding binary number.

Uploaded by

anusha12344321
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Number Systems and Codes 

Assignments 

1. Consider the following four codes:


Code A: 0001, 0010, 0100, 1000
Code B: 000, 001, 011, 010, 110, 111, 101, 100
Code C: 01011, 01100, 10010, 10101
Code D: 000000, 001111, 110011
Which of the following properties is satisfied by each of the following codes?
(a) Detect single errors
(b) Detects double errors
(c) Detects triple errors
(d) Corrects single errors
(e) Corrects single and detects double errors
2. Design a single error correcting Hamming code for:
(a) 5 message bits
(b) 6 message bits
considering all possible combinations of the messages in designing the codewords.
3. Given a Gray code word G = gn  gn-1  gn-2  …  g0, prove that the i-th digit of the
corresponding binary number B = bn  bn-1  bn-2  …  b0 is given by
bi = gn  gn-1  gn-2  …  gi , for 0 ≤ i ≤ n
bn = gn

You might also like