L6_2

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: e, D0–D14 are data bits, P0–P2 are row parity bits and P3–P7 are column parity bits. What are n, k , and d for this linear code? 3. *PSet* Consider a rectangular parity code as described in Section 6.4.1. Ben Bitdiddle would like use this code at a variety of different code rates and experiment with them on some channel. (a) Is it possible to obtain a rate lower than 1/3 with this code? Explain your answer. (b) Suppose he is interested in code rates like 1/2, 2/3, 3/4, etc.; i.e., in general a rate of n−1 , for integer n > 1. Is it always possible to pick the parameters of n the code (i.e, the block size and the number of rows and columns over which to construct the parity bits) so that any such code rate is achievable? Explain your answer. 4. Two-Bit Communications (TBC), a slightly suspect network provider, uses the following linear block code over its channels. All arithmetic is in F2 . P0 = D0 , P1 = (D0 + D1 ), P2 = D1 . (a) What are n and k for this code? (b) Suppose we want to perform syndrome decoding over the received bits. Write out the three syn...
View Full Document

## This document was uploaded on 02/26/2014 for the course CS 6.02 at MIT.

Ask a homework question - tutors are online