hw-2-2009 - zero and 2 m-1 only. 4) If a code has an...

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

View Full Document Right Arrow Icon
ECE 556: Coding Theory, 2009 Issued: September 15th, 2009 September 17, 2009 1) Prove the following bound on the size of the code: For a code with n < 2 d , it holds that M 2 b d 2 d - n c . 2) Show that the only two families of binary codes that meet the Singleton bound are the single parity-check and the repetition codes. 3) Show that the simplex [2 m - 1 ,m, 2 m - 1 ] codes have codewords of weight
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: zero and 2 m-1 only. 4) If a code has an invertible generator matrix, what type of codes are there? 5) Show that the Hamming distance obeys the triangle inequality. 6) Show that in a linear binary code, either all the codewords begin with zero, or exactly half begin with one and half begin with zero. 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