{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# HW4 - IT 420 Won-chul Song Homework 4 1 If data are...

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

Won-chul Song Homework 4 1. If data are transmitted at 10Kbps, how many bits could a 5ms noise burst corrupt? 10kbps = 10000 bps 5ms = 0.005 sec 10000 bps * 0.005 sec = 50 bits 2. Assume odd parity. What is the parity bit for 01011011? Parity bit = 0 3. Assume even parity. If a node receives 10010011 and a parity bit of 1, is there an error in the transmission? Yes, by adding 1 to 10010011, it would make number of 1s odd which doesn’t satisfy the condition of even parity. 4. Assume even row and column parity with 8 data bits per row. Show the parity bits for 11110000 01010000 10101010. 11110000 | 0 01010000 | 0 10101010 | 0 00001010 5. Compute the hamming distance for the pair (001100, 001010) d(001100,001010) = 2 6. Assume 8 bit units of data. Calculate the checksum for 11001100, 01100110, 10101010 11001100 01100110 + 10101010 ------------- 111011100 + 00000001 ------------- 11011101 inver to get checksum 00100010 7. Assume a bit sequence of 101001 and a divisor of 1001. Generate the CRC and check it. __________ 1 0 0 1 ) 1 0 1 0 0 1

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 3

HW4 - IT 420 Won-chul Song Homework 4 1 If data are...

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

View Full Document
Ask a homework question - tutors are online