hw-3-2009 - in a k 1 k 2 array, and that codewords...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 556: Coding Theory, 2009 HW 3 Issued: September 24th, 2009 Due: September 29th, 2009 September 23, 2009 1) Problem 4.6 of text (Roth). 2) Problem 4.9 of text (Roth) 3) Find the length, dimension, and minimum distance of the product of a [ n 1 ,k 1 ,d 1 ] code C 1 and a [ n 2 ,k 2 ,d 2 ] code C 2 . The product of two linear codes is obtained by assuming that the information symbols are arranged
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: in a k 1 k 2 array, and that codewords represent extensions of these arrays obtained by making every row of length n 1 and every column of length n 2 . Each row represents a codeword of C 1 , and each column represents a codeword of C 2 . 1...
View Full Document

This note was uploaded on 02/08/2012 for the course ECE 556 taught by Professor Milenkovic,o during the Fall '08 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online