Unformatted text preview: 0 and &lt; 1-p there is a binary code C of rate at least and a decoding algorithm A ( C ) such that max x C P x A ( C ) ( C ) &lt; . Hint: Choose an appropriate with &lt; &lt; 1-p . Then ( * ) guarantees codes D of rate at least with avg x D P x A ( D ) ( D ) &lt; / 2. A candidate for C would then be the code consisting of those | D | / 2 codewords from D with small values of P x A ( D ) ( D ). (That is, C D is chosen so that for all x C and all z D \ C we have P x A ( D ) ( D ) P z A ( D ) ( D ).)...
View Full Document
This note was uploaded on 06/13/2011 for the course CRYPTO 101 taught by Professor Na during the Spring '11 term at Harding.
- Spring '11