List Decoding of Error-correcting Codes: Winning Thesis of the 2002 Acm Doctoral Dissertation Competition - Lecture Notes in Computer Science - Venkatesan Guruswami - Boeken - Springer-Verlag Berlin and Heidelberg Gm - 9783540240518 - 29 november 2004
Indien omslag en titel niet overeenkomen, is de titel correct

List Decoding of Error-correcting Codes: Winning Thesis of the 2002 Acm Doctoral Dissertation Competition - Lecture Notes in Computer Science 2005 edition

Venkatesan Guruswami

Prijs
SEK 579

Besteld in een afgelegen magazijn

Verwachte levering 31 jul. - 8 aug.
Voeg toe aan uw iMusic-verlanglijst
Eller

List Decoding of Error-correcting Codes: Winning Thesis of the 2002 Acm Doctoral Dissertation Competition - Lecture Notes in Computer Science 2005 edition

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 ?error-correcting codes?. This theory has traditionally gone hand in hand with the algorithmic theory of ?decoding? 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,itshowshowthenotionof?list-decoding? 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 ?encode?) 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.


352 pages, biography

Media Boeken     Paperback Book   (Boek met zachte kaft en gelijmde rug)
Vrijgegeven 29 november 2004
ISBN13 9783540240518
Uitgevers Springer-Verlag Berlin and Heidelberg Gm
Pagina's 352
Afmetingen 156 × 234 × 19 mm   ·   544 g
Taal en grammatica Engels   Duits  

Alles tonen

Meer door Venkatesan Guruswami