How can one exchange information e?ectively when the medium of com- nication introduces errors? This question has been investigated extensively starting with the seminal works of Shannon (1948) and Hamming (1950), and has led to the rich theory of aerror-correcting codesa. This theory has traditionally gone hand in hand with the algorithmic theory of adecodinga that tackles the problem of recovering from the errors e?ciently. This thesis presents some spectacular new results in the area of decoding algorithms for error-correctingcodes. Speci?cally, itshowshowthenotionofalist-decodinga can be applied to recover from far more errors, for a wide variety of err- correcting codes, than achievable before. A brief bit of background: error-correcting codes are combinatorial str- tures that show how to represent (or aencodea) information so that it is - silient to a moderate number of errors. Speci?cally, an error-correcting code takes a short binary string, called the message, and shows how to transform it into a longer binary string, called the codeword, so that if a small number of bits of the codewordare ?ipped, the resulting string does not look like any other codeword. The maximum number of errorsthat the code is guaranteed to detect, denoted d, is a central parameter in its design. A basic property of such a code is that if the number of errors that occur is known to be smaller than d/2, the message is determined uniquely. This poses a computational problem, calledthedecodingproblem:computethemessagefromacorrupted codeword, when the number of errors is less than d/2.Thus h is a root of Q. [T] Our main theorem on list decoding AG-codes now follows from Lemmas 6.36a 6.39 and the polynomial runtime claimed in the previous section. Theorem 6.40. Let C = CE (G, o, Ph) be an A G-code of blocklength n andanbsp;...
|Title||:||List Decoding of Error-Correcting Codes|
|Publisher||:||Springer - 2004-11-29|