problem1

problem1 - University of California San Diego ECE 259A...

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

University of California San Diego ECE 259A: Problem Set #1 0 . Send an e-mail to [email protected] , stating your name, your general research interests, your research advisor (if you have one), and what brings you to the course on algebraic coding theory. 1 . An erasure is an error whose location is known. Prove that a code over q with minimum dis- tance d can correct τ errors and σ erasures, provided d 2 1 . 2 . Find all the binary linear MDS codes. Prove your answer. 3 . Consider the binary linear code de±ned by the generator matrix G 1 0 1 1 1 0 0 1 1 1 1 1 0 1 0 1 1 0 1 1 1 (a) Find a generator matrix for this code in systematic form. (b) Find a parity check matrix for this code. (c) What is the minimum distance of this code? 4 . Let be an n , k , 2 t 1 binary linear code with parity check matrix H . Let be a code of length n 1 obtained by appending to all the codewords x x 1 , x 2 , . . . x n an overall par- ity-check bit equal to x 1 x 2 x n . (a) Find the parameters of

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.

This note was uploaded on 10/12/2009 for the course COMM ECE 259A taught by Professor Prof.alexandervardy during the Fall '08 term at San Diego.

Page1 / 2

problem1 - University of California San Diego ECE 259A...

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

View Full Document
Ask a homework question - tutors are online