Kniha List Decoding of Error-Correcting Codes Venkatesan Guruswami

List Decoding of Error-Correcting Codes

Winning Thesis of the 2002 ACM Doctoral Dissertation Competition

Jazyk: Angličtina
Vazba: Brožovaná
Vydavatel: Springer, Berlin
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
1 147
This monograph is a thoroughly revised and extended version of the author's PhD thesis, which was se...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2004
Stránek
352
EAN
9783540240518
ISBN
3540240519
Enbook ID
05273767
Vydavatel
Hmotnost
554
Rozměry
156 x 234 x 19

Kompletní popis

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.

Mohlo by vás zajímat

Fat-tastic

Nedra James-Peterson
230
223
6 705
2 247
831

Dial A For Aunties

JESSE SUTANTO
220

Divine Rivals

Rebecca Ross
200

Kindertransport

Andrea Hammel
404

India

India Museum
326
439
2 689
301
191
5 251

Snakes and Ladders

Brian C Bennett
433
780

Zákaznicí kteří koupili tuto knihu koupili také

L'enigma dei raggi cosmici

Alessandro De Angelis
1 009

Derecho público romano

ANTONIO FERNANDEZ DE BUJAN Y FERNANDEZ
1 399
981

Acceso a la vivienda

Andrés Santana Muñoz
1 065

Handbuch Literatur & Emotionen

Martin Von Koppenfels
666

Vom Nachtmal

Carl von Reifitz
696
661

CORAX

GAV THORPE
578