CS 4873 Computer Networks, Fall 1999 Assignment 2
Due Thursday, October 7 at the start of class
Print out the postscript file:
/usr/local/courses/cs4873/fall1999/cover2.ps
and use it as the cover sheet for your assignment.
- Chapter 3, number 1, but answer a simpler question:
What is the probability that the message gets through on the first attempt?
Note that all of the pieces must be sent successfully.
- Chapter 3, number 2
- Chapter 3, number 3 (the string given is the input string)
- The following string of bit stuffed bits is received in the middle of
a transmission.
Explain how you can tell that an error has occurred.
011111100100010010101111111001010001001000000000000000001111110
- Chapter 3, number 6
- Consider a code in which each bit is repeated twice, so that the message
is three times as long as it originally was. What is the Hamming Distance
of this code? Can it always detect single bit errors?
Can it correct single bit errors?
- Consider a code in which each bit is repeated 10 times, so that the message
is eleven times as long as it originally was. What is the Hamming Distance
of this code?
What is the maximum number of bit errors than can always be detected?
What is the maximum number of bit errors than can always be corrected?
- Chapter 3, number 7, and explain your answer.
- Chapter 3, number 8, and explain your answer.
- Chapter 3, number 9, and show your work.