Generalized Berlekamp—Massey Decoding of Algebraic-Geometric Codes up to Half the Feng—Rao Bound

IEEE Transactions on Information Theory

Volumn 41, Issue 6, 1995, Pages 1762-1768

  Sakata, Shojiro ^a   Jensen, Helge Elbrønd ^b   Høholdt, Tom ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

algebraic geometric codes; Decoding

Indexed keywords

EID: 0001072540     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.476248     Document Type: Article

References (14)

1. J. L. Massey, “Shift-register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
2. S. Sakata, “Extension of the Berlekamp-Massey algorithm to N dimensions,” Inform. Computat., vol. 84 no. 2, pp. 207–239, Feb. 1990.
3. J. Justesen, K. J. Larsen, H. E. Jensen, and T. Høholdt, “Fast decoding of codes from algebraic plane curves,” IEEE Trans. Inform. Theory, vol. 38, pp. 111–119, Jan. 1992.
4. G. L. Feng and T. R. N. Rao, “Decoding algebraic-geometric codes up to the designed minimum distance,” IEEE Trans. Inform. Theory, vol. 39, pp. 37–45, Jan. 1993.
5. S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. Høholdt, “Fast decoding of AG-codes up to the designed minimum distance,” this issue, pp. 1672–1677.
6. —, “A fast decoding method of AG codes from Miura-Kamiya curves Cab up to half the Feng-Rao bound,” Finite Fields Appl., vol. 1, pp. 83–101, Jan. 1995.
7. C. Dahl, “Fast decoding of codes from algebraic curves,” IEEE Trans. Inform. Theory, vol. 40, pp. 223–230, June 1994.
8. J. H. van Lint and G. van der Geer, Introduction to Coding Theory and Algebraic Geometry. Basel, Switzerland: Birkhäuser-Verlag, 1988.
9. H. Stichtenoth, Algebraic Function Fields and Codes. Berlin, Germany: Springer-Verlag, 1993.
10. M. E. O'Sullivan, “Decoding of codes defined by a single point on a curve,” this issue, pp. 1709–1719.
11. R. Pellikaan, “On the efficient decoding of algebraic-geometric codes,” in Proc. Eurocode 1993.
12. C. Kirfel and R. Pellikaan, “The minimum distance of codes in an array coming from telescopic semigroups,” this issue, pp. 1720–1732.
13. I. Duursma, “Decoding codes from curves and cyclic codes,” Ph.D. dissertation, Eindhoven University of Technology, Eindhoven, The Netherlands, Sept. 1993.
14. C. Voss and T. Høholdt, “A family of Kummer extensions of the Hermitian function field,” Commun. Algebra, vol. 23, no. 4, pp. 1551–1567.