List decoding error correcting codes par guruswami venkatesan (14 résultats)
- Couverture souple
Vendeur : Grey Matter Books, Hadley, MA, Etats-UnisGrey Matter Books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesMembre d’une association professionnelle : SNEAB
Etat: Occasion - Assez bon
EUR 26,80
EUR 4,77 expéditionExpédition nationale : Etats-UnisQuantité disponible : 1 disponible(s)
Paperback. Etat : Very Good. Text is unmarked; pages are bright. Binding is sturdy. Covers are lightly worn around the corners.
- Couverture souple
Vendeur : books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Allemagnebooks4less (Versandantiquariat Petra Gros GmbH & Co. KG)
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Assez bon
EUR 19,95
EUR 15,95 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Broschiert. Etat : Gut. 350 Seiten Das Buch befindet sich in einem gut erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 570.
- Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 58,36
EUR 2,29 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture souple
Vendeur : Basi6 International, Irving, TX, Etats-UnisBasi6 International
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 60,73
Frais de port gratuitsExpédition nationale : Etats-UnisQuantité disponible : 10 disponible(s)
Etat : Brand New. New. Delivery takes 25-30 days. Excellent Customer Service.
- Couverture souple
Vendeur : Chiron Media, Wallingford, Royaume-UniChiron Media
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 57,65
EUR 18,14 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 10 disponible(s)
PF. Etat : New.
- Couverture souple
Vendeur : Ria Christie Collections, Uxbridge, Royaume-UniRia Christie Collections
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 61,26
EUR 14,03 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New. In.
- Couverture souple
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 60,65
EUR 17,56 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : New.
- Couverture souple
Vendeur : AHA-BUCH GmbH, Einbeck, AllemagneAHA-BUCH GmbH
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 62,85 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 'erro…r-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.; 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.
- Couverture souple
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-UniGreatBookPricesUK
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 129,03
EUR 17,56 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : As New. Unread book in perfect condition.
- Couverture souple
Vendeur : Mispah books, Redhill, SURRE, Royaume-UniMispah books
Contacter le vendeurVendeur avec une évaluation de 4 étoilesEtat: Occasion - Comme neuf
EUR 119,39
EUR 29,27 expéditionExpédition depuis Royaume-Uni vers Etats-UnisQuantité disponible : 1 disponible(s)
Paperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-UnisGreatBookPrices
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Occasion - Comme neuf
EUR 150,66
EUR 2,29 expéditionExpédition nationale : Etats-UnisQuantité disponible : Plus de 20 disponibles
Etat : As New. Unread book in perfect condition.
- Couverture souple
- impression à la demande
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AllemagneBuchWeltWeit Ludwig Meier e.K.
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 23,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 2 disponible(s)
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 Ma…dhu 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.
- Couverture souple
- impression à la demande
Vendeur : moluna, Greven, Allemagnemoluna
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 48,37
EUR 48,99 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : Plus de 20 disponibles
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) an…d Hamming (1950), and has led to the rich theory of error-co.
- Couverture souple
- impression à la demande
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagnebuchversandmimpf2000
Contacter le vendeurVendeur avec une évaluation de 5 étoilesEtat: Neuf
EUR 53,49
EUR 60,00 expéditionExpédition depuis Allemagne vers Etats-UnisQuantité disponible : 1 disponible(s)
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. 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 the…ory 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 376 pp. Englisch.
