Close
Enter your search into one or more of the boxes below:
You can refine your search by selecting from any of the options below:
Search
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition
Foyalty 212

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

£69.99
Printed to order. Despatched in 2-3 weeks.
Email me when back in stock

Synopsis

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.

Computing & ITDatabases Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Publication Date: 29/11/2004 ISBN-13: 9783540240518  Details: Type: Paperback Format: Books
Availability: Printed to order. Despatched in 2-3 weeks.  

More books by Venkatesan Guruswami

Leave Review

Delivery

Delivery Options

All delivery times quoted are the average, and cannot be guaranteed. These should be added to the availability message time, to determine when the goods will arrive. During checkout we will give you a cumulative estimated date for delivery.

Location 1st Book Each additional book Average Delivery Time
UK Standard Delivery FREE FREE 3-5 Days
UK First Class £4.50 £1.00 1-2 Days
UK Courier £7.00 £1.00 1-2 Days
Western Europe** Courier £17.00 £3.00 2-3 Days
Western Europe** Airmail £5.00 £1.50 4-14 Days
USA / Canada Courier £20.00 £3.00 2-4 Days
USA / Canada Airmail £7.00 £3.00 4-14 Days
Rest of World Courier £22.50 £3.00 3-6 Days
Rest of World Airmail £8.00 £3.00 7-21 Days

** Includes Austria, Belgium, Denmark, France, Germany, Greece, Iceland, Irish Republic, Italy, Luxembourg, Netherlands, Portugal, Spain, Sweden and Switzerland.

Delivery Help & FAQs

Returns Information

If you are not completely satisfied with your purchase*, you may return it to us in its original condition with in 30 days of receiving your delivery or collection notification email for a refund. Except for damaged items or delivery issues the cost of return postage is borne by the buyer. Your statutory rights are not affected.

* For Exclusions and terms on damaged or delivery issues see Returns Help & FAQs

You might also like

Human Genome Informatics: Translating...
(Paperback)
Darrol Baker; Christophe Lambert;...
 
 
£94.95
 
Data Analytics with Spark Using Python
(Hardback)
Jeffrey Aven
 
£32.99
£35.99
 
Getting Started with Kudu
(Paperback)
Jean-Marc Spaggiari; Mladen ...
 
 
£39.99
 
Integrated Business Planning: How to...
(Hardback)
Robert Kepczynski; Raghav Jandhyala;...
 
 
£79.00
 
© W&G Foyle Ltd
Foyles uses cookies to help ensure your experience on our site is the best possible. Click here if you’d like to find out more about the types of cookies we use.
Accept and Close