List decoding error correcting codes de guruswami venkatesan (15 resultados)
- Tapa blanda
Librería: Grey Matter Books, Hadley, MA, Estados Unidos de AmericaGrey Matter Books
Contactar con el vendedorVendedor de 4 estrellasMiembro de asociación: SNEAB
Condición: Usado - Bueno
EUR 27,10
Envío por EUR 4,82Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Very Good. Text is unmarked; pages are bright. Binding is sturdy. Covers are lightly worn around the corners.
- Tapa blanda
Librería: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Alemaniabooks4less (Versandantiquariat Petra Gros GmbH & Co. KG)
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Bueno
EUR 19,95
Envío por EUR 15,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Broschiert. Condición: Gut. 350 Seiten Das Buch befindet sich in einem gut erhaltenen Zustand. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 570.
- Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 61,39
Envío por EUR 14,06Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa blanda
Librería: Chiron Media, Wallingford, Reino UnidoChiron Media
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 57,78
Envío por EUR 18,18Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 10 disponibles
PF. Condición: New.
- Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 75,62
Envío por EUR 2,32Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa blanda
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 60,78
Envío por EUR 17,60Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa blanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 62,85Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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 '…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.; 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.
- Tapa blanda
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 129,30
Envío por EUR 17,60Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa blanda
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 119,65
Envío por EUR 29,33Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 151,81
Envío por EUR 2,32Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa blanda
- Impresión bajo demanda
Librería: Basi6 International, Irving, TX, Estados Unidos de AmericaBasi6 International
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 61,75
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: 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 wit…h 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.
- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 48,37
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Kartoniert / Broschiert. Condición: 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.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 53,49
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 376 pp. Englisch.
Más imágenes- Tapa blanda
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 50,25
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: 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 Nature Customer Service Center Gm…bH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu Print on Demand.
