On the Complexity of Decoding Goppa Codes

IEEE Transactions on Information Theory

Volumn 23, Issue 4, 1977, Pages 515-516

  Sarwate, Dilip V ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0017512185     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1977.1055732     Document Type: Letter

References (17)

1. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa “A method for solving key equation for decoding Goppa codes,” Inform. Contr., vol. 27, pp. 87–99, Jan. 1975.
2. — “An erasures-and-errors decoding algorithm for Goppa codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 238–241, Mar. 1976.
3. — “Corrections to ‘An erasures-and-errors decoding algorithm for Goppa Codes’,” IEEE Trans. Information Theory, vol. IT-22, pp. 765, Nov. 1976.
4. V. D. Goppa, “A new class of linear error-correcting codes,” Probl. Peredach. Inform., vol. 6, pp. 24–30, Jul.–Sept. 1970.
5. —, “A rational representation of codes and (L,g) codes,” Probl. Peredach. Inform., vol. 7, pp. 41–49, Jul.–Sept. 1971.
6. E. R. Berlekamp “Goppa codes,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 590–592, Sept. 1973.
7. —, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
8. C. T. Retter, “Decoding Goppa codes with a BCH decoder,” IEEE Trans. Inform. Theory, vol. IT-21, p. 112, Jan. 1975.
9. N. J. Patterson “The algebraic decoding of Goppa codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 203–208, Mar. 1975.
10. J. Justesen “On the complexity of decoding Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 237–238, Mar. 1976.
11. D. V. Sarwate, “On the complexity of decoders for Goppa codes,” Coordinated Science Laboratory Technical Report R-719, University of Illinois, Urbana, IL, 1976.
12. R. Moenck, “Fast computation of GCD's,” in Proceedings of the Fifth Annual ACM Symposium on the Theory of Computing, pp. 142–151, 1973.
13. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
14. n,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 415–426, May 1972.
15. J. Justesen “A class of constructive asymptotically good algebraic codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 652–656, Sept. 1972.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, (to be published).
17. H. J. Helgert, “Alternant Codes,” presented at the Information Theory Workshop, Lenox, MA, June 1975.