Paperback. Zustand: Very Good. No Jacket. Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Paperback. Zustand: Very Good. Text is unmarked; pages are bright. Binding is sturdy. Covers are lightly worn around the corners.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 53,45
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: Lucky's Textbooks, Dallas, TX, USA
EUR 52,28
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Zustand: New.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 58,29
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 56,52
Anzahl: 10 verfügbar
In den WarenkorbPF. Zustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 58,27
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, 2004
ISBN 10: 3540240519 ISBN 13: 9783540240518
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 115,85
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 106,40
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 136,81
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg Nov 2004, 2004
ISBN 10: 3540240519 ISBN 13: 9783540240518
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: 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.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, 2004
ISBN 10: 3540240519 ISBN 13: 9783540240518
Anbieter: moluna, Greven, Deutschland
EUR 48,37
Anzahl: Mehr als 20 verfügbar
In den WarenkorbKartoniert / Broschiert. Zustand: 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.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2004, 2004
ISBN 10: 3540240519 ISBN 13: 9783540240518
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: 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 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.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. List Decoding of Error-Correcting Codes | Winning Thesis of the 2002 ACM Doctoral Dissertation Competition | Venkatesan Guruswami | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2004 | Springer | EAN 9783540240518 | Verantwortliche Person für die EU: Springer-Verlag KG, Sachsenplatz 4-6, 1201 WIEN, ÖSTERREICH, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand.