Algebraic algorithms and coding theory

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algebraic algorithms and coding theory

Full text

Pdf (96 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation table of contents

Linz/Hagenberg, Austria

TUTORIAL SESSION: Tutorials table of contents

Pages 337-337

Year of Publication: 2008

ISBN:978-1-59593-904-3

Author

Madhu Sudan

MIT, Cambridge, MA, USA

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract 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/1390768.1390816 What is a DOI?

ABSTRACT

The associated talk surveys some recent developments in algorithmic coding theory that answer some fundamental questions with algebraic techniques.

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	Elwyn Berlekamp. Factoring polynomials over large finite fields. Mathematics of Computations, 24:713--735, 1970.
	2	R. C. Bose and D. K. Ray-Chaudhuri. On a class of error correcting binary group codes. Information and Control, 3:68--79, 1960.
	3	V. D. Goppa. Codes associated with divisors. Problems of Information Transmission, 13(1):22--26, 1977.
	4	Venkatesan Guruswami and Madhu Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45:1757--1767, 1999.
	5	A. Hocquenghem. Codes correcteurs d'erreurs. Chiffres (Paris), 2:147--156, 1959.
	6	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]
	7	Irving S. Reed and Gustav Solomon. Polynomial codes over certain finite fields. J. SIAM, 8:300--304, 1960.
	8	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]
	9	Michael A. Tsfasman, Serge G. Vluadut, and Thomas Zink. Modular curves, Shimura curves, and codes better than the Varshamov-Gilbert bound. Math. Nachrichten, 109:21--28, 1982.
	10	Christopher Umans, Fast polynomial factorization and modular composition in small characteristic, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada [doi>10.1145/1374376.1374445]