Efficient list decoding of explicit codes with optimal redundancy

  • Authors:

  • Atri Rudra

  • Affiliations:

  • Department of Computer Science and Engineering, University of Buffalo, State University of New York, Buffalo

  • Venue:
  • AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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 Guruswami-Sudan [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.