Unformatted text preview: -3 . Bit errors occur at random and independent of each other. Suppose that the following code is used. To transmit a 1, the codeword 111 is sent; to transmit a 0, the codeword 000 is sent. The receiver takes the three received bits and decides which bit was sent by taking the majority vote of the three bits. Find the probability that the receiver makes a decoding error. 5. Suppose that a parity check code has minimum Hamming distance d min . a) Show that if the distance between one codeword and a given bit string (of the same length) is less than d min / 2, the distance between any other codeword and the given bit string must exceed d min / 2. b) Show that if a decoder maps a given received string into a codeword at smallest distance from the string, all combinations of fewer than d min / 2 errors will be corrected....
View Full Document
This note was uploaded on 05/01/2011 for the course ELECTRICAL EE3015 taught by Professor Albertsun during the Spring '11 term at City University of Hong Kong.
- Spring '11