Több mint 4 millió cím angol és más nyelveken! Fedezd fel új történetedet még ma!

List Decoding of Error-Correcting Codes

Name: List Decoding of Error-Correcting Codes
Brand: Springer, Berlin
SKU: 9783540240518
Price: 19305 HUF
Availability: InStock

Winning Thesis of the 2002 ACM Doctoral Dissertation Competition

Szerző: Venkatesan Guruswami

Nyelv:

Kötés: Puha kötésű

Kiadó: Springer, Berlin

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

19 305 Ft

This monograph is a thoroughly revised and extended version of the author's PhD thesis, which was se...

Információk a könyvről

Szerző

Venkatesan Guruswami

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2004

oldal

352

EAN

9783540240518

ISBN

3540240519

Enbook ID

05273767

Kiadó

Springer, Berlin

Súly

554

Méretek

156 x 234 x 19

Teljes leírás

This monograph is a thoroughly revised and extended version of the author's PhD thesis, which was selected as the winning thesis of the 2002 ACM Doctoral Dissertation Competition. Venkatesan Guruswami did his PhD work at the MIT with Madhu Sudan as thesis adviser.§Starting with the seminal work of Shannon and Hamming, coding theory has generated a 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 transmission errors efficiently. This book presents some spectacular new results in the area of decoding algorithms for error-correcting codes. Specificially, it shows how the notion of list-decoding can be applied to recover from far more errors, for a wide variety of error-correcting codes, than achievable before.§The style of the exposition is crisp and the enormous amount of information on combinatorial results, polynomial time list decoding algorithms, and applications is presented in well structured form. 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.