s5 - Cmpen/EE 362 Asst 5 Solution Spring 2009 Problem 1...

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

View Full Document Right Arrow Icon
Cmpen/EE 362 Asst. 5 Solution Spring 2009 Problem 1 . Text Problem 3.5 A bit string 0111101111101111110 at data layer. What is the string after bit stuffing? Solution. Stuffed 0's shown in italics. 01111011111 0 011111 0 10 Problem 2. Text Problem 3.12 A block of n rows with k bits per row and adding one check bit to each row and column. Lower right bit checks both rows and columns. Will this scheme detect all single errors? All double errors? All triple errors? Solution. Yes to all single, double, triple errors.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background 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 09/23/2009 for the course CMPEN 362 taught by Professor Johnmetzner during the Spring '09 term at Penn State.

Page1 / 2

s5 - Cmpen/EE 362 Asst 5 Solution Spring 2009 Problem 1...

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