Skip to main navigation Skip to search Skip to main content

Efficient list decoding of explicit codes with optimal redundancy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Under the notion of list decoding, the decoder is allowed to output a small list of codeword such that the transmitted codeword is present in the list. Even though combinatorial limitations on list decoding had been known since the 1970's, there was essentially no algorithmic progress till the breakthrough works of Sudan [14] and GuruswamiSudan [11] in the mid to late 1990's. There was again a lull in algorithmic progress till a couple of recent papers [12,8] closed the gap in our knowledge about combinatorial and algorithmic limitations of list decoding (for codes over large alphabets). This article surveys these latter algorithmic progress.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings
PublisherSpringer Verlag
Pages38-46
Number of pages9
ISBN (Print)9783540772231
DOIs
StatePublished - 2007
Event17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17 - Bangalore, India
Duration: Dec 16 2007Dec 20 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4851 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17
Country/TerritoryIndia
CityBangalore
Period12/16/0712/20/07

Fingerprint

Dive into the research topics of 'Efficient list decoding of explicit codes with optimal redundancy'. Together they form a unique fingerprint.

Cite this