This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSCI 415 Computer Networks Homework 3 Due 02/27/08 Saad Mneimneh Computer Science Hunter College of CUNY Problem 1: Error correcting codes Suppose that a parity check code has a minimum distance d . Define the distance of a code word and a received string (of the same length) as the number of bit positions in which the two are different (that’s the Hamming distance). (a) Show that if the distance between a code word and a given string is less than d/ 2, the distance between any other code word and the given string must exceed d/ 2. (b) Show that if a decoder maps a given string into a code word at smallest distance from the string, all combinations of fewer than d/ 2 erros will be cor rected. Problem 2: CRC (a) For the generator polynomial g = 110011 and the data bits (message) m = 11100011 find the CRC and the transmitted string T (since g is 6 bits, i.e. a polynomial of degree 5, L = 5 and the CRC should be 5 bits)....
View
Full
Document
This note was uploaded on 03/27/2010 for the course CSCI 415 taught by Professor Saadmneimneh during the Spring '08 term at CUNY Hunter.
 Spring '08
 SaadMneimneh
 Computer Networks

Click to edit the document details