Technical perspectiveThe beauty of error-correcting codes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Technical perspective
The beauty of error-correcting codes

Full text

Digital Edition , Html

Html (9 KB), Pdf

Pdf (565 KB)

Source

Communications of the ACM archive
Volume 52 , Issue 3 (March 2009) table of contents
Being Human in the Digital Age

SECTION: Research highlights table of contents

Pages 86-86

Year of Publication: 2009

ISSN:0001-0782

Author

Daniel A. Spielman

Yale University, New Haven, CT

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 24, Downloads (12 Months): 509, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1467247.1467268 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Guruswami, V. and Sudan, M. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Trans. on Info. Theory, 45 (1999), 1757--1767.
	2	Koetter, R. and Vardy, A. Algebraic soft-decision decoding of Reed-Solomon codes. IEEE Trans. on Info. Theory 49, 112 (2003), 2809--2825.
	3	Farzad Parvaresh , Alexander Vardy, Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, p.285-294, October 23-25, 2005 [doi>10.1109/SFCS.2005.29]
	4	Madhu Sudan, Decoding of Reed Solomon codes beyond the error-correction bound, Journal of Complexity, v.13 n.1, p.180-193, March 1997 [doi>10.1006/jcom.1997.0439]