List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition - Couverture souple

Guruswami, Venkatesan

9783540240518: List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition

Couverture souple

ISBN 10 : 3540240519 ISBN 13 : 9783540240518

Editeur : Springer Berlin Heidelberg, 2008

Afficher les exemplaires de cette �dition comportant l?ISBN

3 D'occasion

De EUR 111,29

13 Neuf

De EUR 48,37

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.

�diteurSpringer Berlin Heidelberg
Date d'�dition2008
ISBN 10 3540240519
ISBN 13 9783540240518
ReliureBroch�
Langueanglais
Nombre de pages356
Coordonn�es du fabricantnon disponible

Acheter D'occasion

�tat : Comme neuf

Unread book in perfect condition...

Afficher cet article

EUR 111,29

Autre devise

EUR 17,81 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 48,37

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783540805915: List Decoding of Error-Correcting Codes

Edition pr�sent�e

ISBN 10 : 3540805915 ISBN 13 : 9783540805915
Editeur : Springer, 2008
Couverture souple

R�sultats de recherche pour List Decoding of Error-Correcting Codes: Winning Thesis...

Image fournie par le vendeur

List Decoding of Error-Correcting Codes

Venkatesan Guruswami

Edit� par Springer Berlin Heidelberg, 2004

ISBN 10 : 3540240519 ISBN 13 : 9783540240518

Neuf Kartoniert / Broschiert

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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-co. N� de r�f. du vendeur 4886129

Contacter le vendeur

Acheter neuf

EUR 48,37

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

List Decoding of Error-Correcting Codes : Winning Thesis of the 2002 ACM Doctoral Dissertation Competition

Venkatesan Guruswami

Edit� par Springer Berlin Heidelberg, 2004

ISBN 10 : 3540240519 ISBN 13 : 9783540240518

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N� de r�f. du vendeur 9783540240518

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

List Decoding of Error-Correcting Codes

Venkatesan Guruswami

Edit� par Springer Berlin Heidelberg Nov 2004, 2004

ISBN 10 : 3540240519 ISBN 13 : 9783540240518

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

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

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science, 3282)

Guruswami, Venkatesan

Edit� par Springer, 2004

ISBN 10 : 3540240519 ISBN 13 : 9783540240518

Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783540240518_new

Contacter le vendeur

Acheter neuf

EUR 62,15

Autre devise

Frais de port : EUR 4,74

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

List Decoding of Error-Correcting Codes

Venkatesan Guruswami

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2004, 2004

ISBN 10 : 3540240519 ISBN 13 : 9783540240518

Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Neuware -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. 376 pp. Englisch. N� de r�f. du vendeur 9783540240518

Contacter le vendeur