hw9_09 - Department of Electrical and Computer Engineering...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Department of Electrical and Computer Engineering The Johns Hopkins University 520.137 Introduction to Electrical and Computer Engineering – Fall 2009 Homework Assignment IX Reading Assignment: Kuc Chapter 7 1. Consider the following (5 , 2) ECC code which contains a mixture of parity and repetitive bits: M 1 M 2 P 1 P 2 P 3 where the two repetitive bits are P 1 = M 1 and P 2 = M 2 whereas the parity bit is P 3 = M 1 M 2 . (a) Construct a table of all valid code-words. (b) What is the minimum Hamming distance between the valid code-words? What is the maximum Hamming distance between the valid code-words? How many bit-error(s) can we detect? How many bit-error(s) can we correct? (c) Another (5 , 2) ECC code is constructed as follows: M 1 M 2 P 1 P 2 P 3 where P 1 = M 1 M 2 , P 2 = M 1 M 2 ,and P 3 = M 1 + M 2 . Again, construct a table of all valid code-words. (d) What is the minimum Hamming distance for this ECC code? What is the maximum Hamming distance between the valid code-words? How many bit-error(s) can we detect?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/02/2010 for the course ENGINEERIN 520.101 taught by Professor Tracdtran during the Winter '06 term at Johns Hopkins.

Page1 / 2

hw9_09 - Department of Electrical and Computer Engineering...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online