A fast parallel implementation of a berlekamp-massey algorithm for algebraic-geometric codes

IEEE Transactions on Information Theory

Volumn 44, Issue 4, 1998, Pages 1353-1368

  Kotier, Ralf ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Algebraic geometric codes; Berlekamp Massey algorithm; Decoding

Indexed keywords

ALGEBRA; CODES (SYMBOLS); DECODING; ERROR ANALYSIS; PARALLEL ALGORITHMS; SIGNAL ENCODING;

ALGEBRAIC GEOMETRIC CODES; BERLEKAMP MASSEY ALGORITHMS; REED SOLOMON CODES;

INFORMATION THEORY;

EID: 0032122036     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.681314     Document Type: Article

References (28)

1. J. Justesen, K. J. Larsen, H. E. Jensen, and T. Høholt, "Fast decoding of codes from algebraic plane curves," IEEE Trans. Inform. Theory, vol. 38, pp. 111-119, Jan. 1992.
2. S. Sakata, "Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array," J. Symb. Comput., vol. 5 pp. 321-337, 1988.
3. S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. Høholt, "Fast decoding of AG-codes up to the designed minimum distance," IEEE Trans. Inform. Theory, vol. 41, pp. 1672-1677, Nov. 1992.
4. ab, up to half the Feng-Rao bound up to the designed minimum distance," Finite Fields Their Applic., vol. 1, no. 1, Jan. 1995.
5. _, "Fast decoding of algebraic geometric codes up to the designed minimum distance," in Proc. 6th Joint Swedish-Russian Workshop Information Theory (Molle, Sweden, Aug. 1993), pp. 114-117.
6. C. D. Jensen, "Fast decoding of codes from algebraic geometry," IEEE Trans. Inform. Theory, vol. 40, pp. 223-230, Jan. 1994.
7. D. Leonard, "Error-locator ideals for algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 41, pp. 819-825, May 1995.
8. G.-L. Feng, V. Wei, T. R. N. Rao, and K. K. Tzeng, "Simplified understanding and efficient decoding of a class of algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 40, pp. 981-1002, July 1994.
9. M. E. O'Sullivan, "Decoding of codes defined by a single point on a curve," IEEE Trans. Inform. Theory, vol. 41, pp. 1709-1719, Nov. 1992.
10. S. Sakata, H. E. Jensen, and T. Høholt, " Generalized Berlekamp-Massey decoding of algebraic geometric codes up to half the Feng-Rao bound," IEEE Trans. Inform. Theory, vol. 41, pp. 1762-1768, Nov. 1995.
11. R. Kotier, "A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes," Linköping Univ., Linköping, Sweden, Tech. Rep. LiTH-ISY-R-1716, Jan. 1995.
12. _, "A fast parallel Berlekamp-Massey type algorithm for Hermitian codes," in Proc. Algebraic and Combinatorial Coding Theory, ACCT'94 (Novgorod, Russia, Sept. 1994), pp. 125-128.
13. S. Sakata, "Fast erasure-and-error decoding of any one point AG code up to the Feng-Rao bound," Mar. 1995, preprint.
14. R. Kotier, "Fast generalized minimum dislance decoding of algebraic geometric and Reed-Solomon Codes," IEEE Trans. Inform. Theory, vol. 42, pp. 721-737, May 1996.
15. R. E. Blahul, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
16. E. D. Maslrovilo, "VLSI archileclures for compulalions in Galois fields," Ph.D. disserlalion, Linköping Univ., Linköping, Sweden, 1991.
17. J. H. van Linl and G. van der Geer, Introduction to Coding Theory and Algebraic Geometry. Basel/Boslon./Berlin: Birkhäuser-Verlag, 1988.
18. J. Juslesen, K. J. Larsen, H. E. Jensen, A. Havemose, and T. Høholdl, "Conslruclion and decoding of a class of algebraic geomelric codes," IEEE Trans. Inform. Theory, vol. 35, pp. 811-821, July 1989.
19. G.-L. Feng and T. R. N. Rao, "Decoding algebraic-geometric codes up lo the designed minimum distance," IEEE Trans. Inform. Theory, vol. 39, pp. 375, Jan. 1993.
20. I. M. Duursma, "Majority coset decoding," IEEE Trans. Inform. Theory, vol. 39, pp. 1067-1070, May 1993.
21. C. Kirfel and R. Pellikaan, "The minimum distance of codes in an array coming from telescopic semigroups," IEEE Trans. Inform. Theory, vol. 41, pp. 1720-1732, Nov. 1992.
22. S. Sakata, "Extension of the Berlekamp-Massey algorithm to N dimensions," Inform. Comput., vol. 84, pp. 207-239, 1990.
23. Y. Madelung, "Implementation of a decoding algorithm for AG-codes from the Hermitian curve," Inst. Circuit Theory and Telecommun., Tech. Univ. Denmark, Lyngby, Denmark, Tech. Rep., 1993.
24. _, "A fast computer program for correcting all errors up to half the minimum distance of codes from Hermitian curves," in Proc. 6th Joint Swedish-Russian Workshop Information Theory (Molle, Sweden, Aug. 1993), pp. 118-122.
25. M. A. Tsfasman and S. G. Vlädu;, Algebraic-Geometric Codes. Dordrecht/Boston/London: Kluwer, 1991.
26. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, 1969.
27. 2)" IEEE Trans. Inform. Theory, vol. 34, pp. 1345-1348, Nov. 1988.
28. G. D. Forney, Concatenated Codes. Cambridge, MA: MIT Press, 1966.