a) Find the Hamming distance between the codewords that correspond to datawords 0111 and 1100. (b)  Suppose the Hamming distance you found in part (a) is the minimum Hamming distance between all pairs in the codebook. What does this tell us about the number of errors this code can detect?

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter3: Data Representation
Section: Chapter Questions
Problem 5PE
icon
Related questions
Question

(a) Find the Hamming distance between the codewords that correspond to datawords 0111 and 1100.

(b)  Suppose the Hamming distance you found in part (a) is the minimum Hamming distance between all pairs in the codebook. What does this tell us about the number of errors this code can detect?

For this question, use the CRC introduced by Hamming:
Dataword
Codeword
Dataword
Codeword
0000
0000 000
1000
1000 101
0001
0001 011
1001
1001 110
0010
0010 110
1010
1010 011
0011
0011 101
1011
1011 000
0100
0100 111
1100
1100 010
0101
0101 100
1101
1101 001
0110
0110 001
1110
1110 100
0111
0111 010
1111
1111 111
Transcribed Image Text:For this question, use the CRC introduced by Hamming: Dataword Codeword Dataword Codeword 0000 0000 000 1000 1000 101 0001 0001 011 1001 1001 110 0010 0010 110 1010 1010 011 0011 0011 101 1011 1011 000 0100 0100 111 1100 1100 010 0101 0101 100 1101 1101 001 0110 0110 001 1110 1110 100 0111 0111 010 1111 1111 111
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning