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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Elias, P.: List Decoding for Noisy Channels. Technical Report 335, Research Laboratory of Electronics, MIT (1957)
Elias, P.: Error-Correcting Codes for List Decoding. IEEE Trans. Inform. Theory 37(5), 5–12 (1991)
Forney, G.D.: Concatenated Codes. MIT Press, Cambridge, MA (1966)
Guruswami, V.: List Decoding of Error-Correcting Codes. LNCS, vol. 3282. Springer, Heidelberg (2004)
Guruswami, V.: List Decoding and Pseudorandom Constructions. In: Boztaş, S., Lu, H.F. (eds.) AAECC 2007. LNCS, vol. 4851, Springer, Heidelberg (2007)
Guruswami, V., Indyk, P.: Linear-Time Encodable/Decodable Codes with Near-Optimal Rate. IEEE Trans. Inform. Theory 51(10), 3393–3400 (2005)
Guruswami, V., Patthak, A.: Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets. In: FOCS 2006, pp. 227–236 (2006)
Guruswami, V., Rudra, A.: Explicit Capacity-Achieving List-Decodable Codes. In: 38th Annual ACM Symposium on Theory of Computing, pp. 1–10 (2006)
Guruswami, V., Rudra, A.: Better Binary List-Decodable Codes Via Multilevel Concatenation. In: 11th International Workshop on Randomization and Computation. pp. 554–568 (2007)
Guruswami, V., Rudra, A.: Concatenated Codes Can Achieve List Decoding Capacity. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (to appear, 2008)
Guruswami, V., Sudan, M.: Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. IEEE Trans. Inform. Theory 45, 1757–1767 (1999)
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)
Rudra, A.: List Decoding and Property Testing of Error Correcting Codes. PhD thesis, University of Washington (2007)
Sudan, M.: Decoding of Reed-Solomon Codes Beyond the Error-Correction Bound. J. Complexity 13(1), 180–193 (1997)
Sudan, M.: List Decoding: Algorithms and Applications. SIGACT News 31, 16–27 (2000)
Wozencraft, J.M.: List Decoding. Quarterly Progress Report, Research Laboratory of Electronics. MIT 48, 90–95 (1958)
Zyablov, V.V., Pinsker, M.S.: List Cascade Decoding. Problems of Information Transmission 17(4), 29–34 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rudra, A. (2007). Efficient List Decoding of Explicit Codes with Optimal Redundancy. In: Boztaş, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-77224-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77223-1
Online ISBN: 978-3-540-77224-8
eBook Packages: Computer ScienceComputer Science (R0)