A fast decoding method of ag codes from miura-kamiya curves cab up to half the feng-rao bound

Finite Fields and Their Applications

Volumn 1, Issue 1, 1995, Pages 83-101

  Sakata, S ^a   Justesen, J ^b   Madelung, Y ^b   Jensen, H E ^b   Hoholdt T ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038031934     PISSN: 10715797     EISSN: 10902465     Source Type: Journal    
DOI: 10.1006/ffta.1995.1006     Document Type: Article

References (25)

1. J. Justesen, K. J. Larsen, A. Havemose, H. K. Jensen, and T. Hoholdt. Construction and decoding of a class of algebraic geometry codes, IEEE Trans. Inform. Theory 35 (July 1989), 811-821.
2. R. Pellikaan, On a decoding algorithm for codes on maximal curves, IEEE Trims. Inform. Theory (Nov. 1989), 1228-1232.
3. A. N. Skorobogatov and S. G. Vladuj, On decoding of algebraic geometric codes, IEEE Trans. Inform. Theory 36 (Sept. 1990), 1051-1060.
4. J. Justesen, K. J. Larsen, H. E. Jensen, and T. Hoholdt, Fast decoding of codes from algebraic plane curves, IEEE Trans. Inform. Theory 38 (Jan. 1992), 111-119.
5. S. C. Porter, B.-Z. Shen, and R. Pellikaan, Decoding geometric Goppa codes using an extra place, IEEE Trans. Inform. Theory 38 (Nov. 1992), 1663-1676.
6. B.-Z. Shen, Solving a congruence on a graded algebra by a subresultant sequence and its application, J. Symbolic Comput., to appear.
7. G. L. Feng and T. R. N. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Trans. Inform. Theory 39 (Jan. 1993), 37-45.
8. M. Duursma, Majority coset decoding, IEEE Trans. Inform. Theory 39 (May 1993), 1067-1070.
9. D. Ehrhard, Achieving the designed error capacity in decoding algebraic-geometric codes, IEEE Trans. Inform. Theory- 39 (May 1993), 743-751.
10. B.-Z. Shen, Codes from Hermitian curves and an iterative decoding algorithm, preprint, Eindhoven University of Technology, June 1991.
11. N. Kamiya and S. Miura, On a fast decoding algorithm for geometric Goppa codes defined on certain algebraic curves with at most one higher cusp, presented at the 1993 IEEE International Symposium on Information Theory, San Antonio, TX, Jan. 1993.
12. M. Kurihara and K. Kobayashi, A fast decoding algorithm of algebraic-geometric codes from some plane curves, submitted for publication.
13. C. Kirfel and R. Pellikaan, The minimum distance of codes in an array coming from telescopic semigroups, presented at The Fourth Workshop on Arithmetic Geometry and Coding Theory, Luminy, France, June 1993.
14. S. Miura and N. Kamiya, Geometric-Goppa codes on some maximal curves and their minimum distance, presented at The IEEE Workshop on Information Theory, Susono-shi, Japan, June 1993.
15. S. Miura and N. Kamiya, "On the Minimum Distance of Codes from Some Maximal Curves," Technical Report of IE1CE, IT92-147, Mar. 1993. [In Japanese]
16. S. Sakata, Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, J. Symbolic Comput. 5 (May 1988), 321-337.
17. S. Sakata, Extension of the Berlekamp-Massey algorithm to N dimensions, Inform, and Comput. 84 (Feb. 1990), 207-239.
18. S. Sakata, On the minimal partial realization of 2D discrete linear shift-invariant systems, IEEE Trans. Automat. Control 36 (Aug. 1991), 984-988.
19. H. Stichtenoth, A note on Hermitian codes over GF(q2), IEEE Trans. Inform. Theory' 34 (Sept. 1988), 1345-1348.
20. H. Stichtenoth, Uber die Automorphismengruppe eines algebraischen Funktionenkor-pers von Primzahlcharacterisitik, Teil II: Eine spezieller Typ Funktionenkorpern, Arch. Math. 24 (1973), 615-631.
21. H. Stichtenoth, "Algebraic Function Fields and Codes," Springer-Verlag, Berlin, 1993.
22. Y. Madelung, "Implementation of a Decoding Algorithm for AG-Codes from the Hermitian Curve," Technical Report of the Institute of Circuit Theory and Telecommunication, ISSN 0105-8541, IT-93-137, Technical University of Denmark, 1993.
23. S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. Hoholdt, Fast decoding of AG-codes up to the designed minimum distance, submitted for publication.
24. G. L. Feng, V. K. Wei, T. R. N. Rao, and K. K. Tzeng, The designed distance decoding of a class of algebraic-geometric codes. Part I: A new theory without Riemann-Roch theorem, presented at the IEEE Workshop on Information Theory, Brazil, 1992.
25. G. L. Feng, V. K. Wei, T. R. N. Rao, and K. K. Tzeng, The designed distance decoding of a class of algebraic-geometric codes. Part II: Fast algorithm and block-Hankel matrices, presented at the IEEE Workshop on Information Theory, Brazil. 1992.