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

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

by Venkatesan Guruswami
     
 

ISBN-10: 3540240519

ISBN-13: 9783540240518

Pub. Date: 05/01/2005

Publisher: Springer Berlin Heidelberg

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

Overview

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.

Product Details

ISBN-13:
9783540240518
Publisher:
Springer Berlin Heidelberg
Publication date:
05/01/2005
Series:
Lecture Notes in Computer Science Series , #3282
Edition description:
2005
Pages:
352
Product dimensions:
9.21(w) x 6.14(h) x 0.78(d)

Table of Contents

1 Introduction.- 1 Introduction.- 2 Preliminaries and Monograph Structure.- I Combinatorial Bounds.- 3 Johnson-Type Bounds and Applications to List Decoding.- 4 Limits to List Decodability.- 5 List Decodability Vs. Rate.- II Code Constructions and Algorithms.- 6 Reed-Solomon and Algebraic-Geometric Codes.- 7 A Unified Framework for List Decoding of Algebraic Codes.- 8 List Decoding of Concatenated Codes.- 9 New, Expander-Based List Decodable Codes.- 10 List Decoding from Erasures.- III Applications.- Interlude.- III Applications.- 11 Linear-Time Codes for Unique Decoding.- 12 Sample Applications Outside Coding Theory.- 13 Concluding Remarks.- A GMD Decoding of Concatenated Codes.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >