Scribd
Upload
83 views1 page

Tutorial 4 PDF

1. The document discusses Hamming codes and their properties for error detection and correction. It provides examples to test whether a Hamming code can detect or correct a certain number of errors. 2. It asks the reader to calculate Hamming distances for various codewords and find the minimum Hamming distance needed to detect or correct a given number of errors. 3. An example is given to show that the (7,4) Hamming code can detect two-bit errors but not necessarily three-bit errors by testing various codewords with different bit error patterns. 4. Finally, it asks the reader to determine the values of k and n for a Hamming code C

Uploaded by

Ardha Raghavendra
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
83 views1 page

Tutorial 4 PDF

1. The document discusses Hamming codes and their properties for error detection and correction. It provides examples to test whether a Hamming code can detect or correct a certain number of errors. 2. It asks the reader to calculate Hamming distances for various codewords and find the minimum Hamming distance needed to detect or correct a given number of errors. 3. An example is given to show that the (7,4) Hamming code can detect two-bit errors but not necessarily three-bit errors by testing various codewords with different bit error patterns. 4. Finally, it asks the reader to determine the values of k and n for a Hamming code C

Uploaded by

Ardha Raghavendra
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

CSN: 341 Computer Network

Tutorial: 4

1. In Table 1, the sender sends dataword 00, A 3-bit burst error corrupts the codeword. Can
receiever detect the error? Give justification.
Datawords Codewords
00 000
01 011
10 101
11 110
Table: 1

2. What is the Hamming distance for each of the following cases:


1. d(10000, 00000)
2. d(10101, 10000)
3. d(11111, 11111)
4. d(000, 000)

3. Find the minimum Hamming distance for the following cases:


1. Detection of two errors
2. Correction of two errors
3. Detection of 3 errors or correction of 2 errors
4. Detection of 6 errors or correction of 2 errors

4. Show that the Hamming code C (7, 4) of Table 2 can detect two-bit errors but not
necessarily three-bit error by testing the code in the following cases. The character “N” in
the burst error means no error; the characher “E” means an error.
1. Dataword: 0100 Burst error: NEENNNN
2. Dataword: 0111 Burst error: ENNNNNE
3. Dataword: 1111 Burst error: ENENNNE
4. Dataword: 0000 Burst error: EENENNN
Datawords Codewords Datawords Codewords
0000 0000000 1000 1000110
0001 0001101 1001 1001011
0010 0010111 1010 1010001
0011 0011010 1011 1011100
0100 0100011 1100 1100101
0101 0101110 1101 1101000
0110 0110100 1110 1110010
0111 0111001 1111 1111111
Table: 2

5. For a dataword of at least 11 bits. Find the values of k and n in the Hamming code C (n, k)
with dmin = 3.

You might also like