Advertisement

Efficient List Decoding of Explicit Codes with Optimal Redundancy

  • Atri Rudra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4851)

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.

Keywords

Block Length Alphabet Size Weighted Degree Bivariate Polynomial Interpolation Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Elias, P.: List Decoding for Noisy Channels. Technical Report 335, Research Laboratory of Electronics, MIT (1957)Google Scholar
  2. 2.
    Elias, P.: Error-Correcting Codes for List Decoding. IEEE Trans. Inform. Theory 37(5), 5–12 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Forney, G.D.: Concatenated Codes. MIT Press, Cambridge, MA (1966)Google Scholar
  4. 4.
    Guruswami, V.: List Decoding of Error-Correcting Codes. LNCS, vol. 3282. Springer, Heidelberg (2004)zbMATHGoogle Scholar
  5. 5.
    Guruswami, V.: List Decoding and Pseudorandom Constructions. In: Boztaş, S., Lu, H.F. (eds.) AAECC 2007. LNCS, vol. 4851, Springer, Heidelberg (2007)Google Scholar
  6. 6.
    Guruswami, V., Indyk, P.: Linear-Time Encodable/Decodable Codes with Near-Optimal Rate. IEEE Trans. Inform. Theory 51(10), 3393–3400 (2005)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Guruswami, V., Patthak, A.: Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets. In: FOCS 2006, pp. 227–236 (2006)Google Scholar
  8. 8.
    Guruswami, V., Rudra, A.: Explicit Capacity-Achieving List-Decodable Codes. In: 38th Annual ACM Symposium on Theory of Computing, pp. 1–10 (2006)Google Scholar
  9. 9.
    Guruswami, V., Rudra, A.: Better Binary List-Decodable Codes Via Multilevel Concatenation. In: 11th International Workshop on Randomization and Computation. pp. 554–568 (2007)Google Scholar
  10. 10.
    Guruswami, V., Rudra, A.: Concatenated Codes Can Achieve List Decoding Capacity. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (to appear, 2008)Google Scholar
  11. 11.
    Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. IEEE Trans. Inform. Theory 45, 1757–1767 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Parvaresh, F., Vardy, A.: Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time. In: 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 285–294 (2005)Google Scholar
  13. 13.
    Rudra, A.: List Decoding and Property Testing of Error Correcting Codes. PhD thesis, University of Washington (2007)Google Scholar
  14. 14.
    Sudan, M.: Decoding of Reed-Solomon Codes Beyond the Error-Correction Bound. J. Complexity 13(1), 180–193 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Sudan, M.: List Decoding: Algorithms and Applications. SIGACT News 31, 16–27 (2000)CrossRefGoogle Scholar
  16. 16.
    Wozencraft, J.M.: List Decoding. Quarterly Progress Report, Research Laboratory of Electronics. MIT 48, 90–95 (1958)Google Scholar
  17. 17.
    Zyablov, V.V., Pinsker, M.S.: List Cascade Decoding. Problems of Information Transmission 17(4), 29–34 (1981)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Atri Rudra
    • 1
  1. 1.Department of Computer Science and Engineering, University of Buffalo, State University of New York, Buffalo, 14260USA

Personalised recommendations