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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Gratuit expédition vers Etats-Unis
Destinations, frais et délaisEUR 2,28 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Paperback. Etat : Very Good. No Jacket. Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G3540240519I4N10
Quantité disponible : 1 disponible(s)
Vendeur : Grey Matter Books, Hadley, MA, Etats-Unis
Paperback. Etat : Very Good. Text is unmarked; pages are bright. Binding is sturdy. Covers are lightly worn around the corners. N° de réf. du vendeur 071692
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 3337498-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020163842
Quantité disponible : Plus de 20 disponibles
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Paperback. Etat : new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783540240518
Quantité disponible : 1 disponible(s)
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9783540240518
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783540240518_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540240518
Quantité disponible : 10 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 3337498-n
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 376 pp. Englisch. N° de réf. du vendeur 9783540240518
Quantité disponible : 2 disponible(s)