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: EE132A, Spring 2007 Prof. John Villasenor Communication Systems TA: Choo Chin (Jeffrey) Tan Handout# 21 Homework 7 Assigned: Monday, May 21, 2007 Due: Wednesday, May 30, 2007 Reading Assignments: Chapter 12 (12.4 12.6), Chapter 13 (13.1, 13.2) 1. A single parity bit is appended to a block of 3 message bits [ ] 3 2 1 , , m m m . The single parity bit b is chosen so that the codeword satisfies the following rule 1 3 2 1 = b m m m where the symbol denotes modulo-2 addition. List all possible code words in the code defined by this rule. 2. How many different generator matrices ( G ) generate a specific binary linear code C(n,k) of length n and dimension k ? 3. Consider the following parity check matrix H = 1 1 1 1 1 1 1 1 1 1 1 1 H (a) What is the rank of H ? (b) Find a generator matrix G and verify that t GH = 0. (c) Using the generator matrix in (b), find the codeword that correspond to ....
View Full Document
- Spring '08