Fast generalized minimum-distance decoding of algebraic-geometry and reed-solomon codes

IEEE Transactions on Information Theory

Volumn 42, Issue 3, 1996, Pages 721-737

  Kotier, Ralf ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Algebraicgeometry codes; Efficient algorithms; GMD decoding; Reed solomon codes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; GEOMETRY; MATRIX ALGEBRA; VECTORS;

ALGEBRAIC GEOMETRY CODES; BERLEKAMP-MASSEY TYPE ALGORITHMS; GENERALIZED MINIMUM DISTANCE DECODING; PARITY CHECK MATRIX; REED-SOLOMON CODES;

DECODING;

EID: 0030151940     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.490540     Document Type: Article

References (27)

1. G.D. Forney Jr., "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, Apr. 1966.
2. U. Sorger, "A new Reed-Solomon decoding algorithm based on Newton's interpolation," IEEE Trans. Inform. Theory, vol. 39, pp. 358-365, Mar. 1993.
3. K.. Araki. M. Takada, and M. Mori, ''The generalized syndrome polynomial and its application to the efficient decoding of Reed-Solomon codes based on GMD criterion," in Proc. Int. Syrup, on Information Theory (San Antonio, TX, 1993), p. 34.
4. E. Berlekamp, "Bounded distance 1 soft-decision Reed-Solomon decoding," this issue, pp. 704-720.
5. D. .1. Taipale and M. J. Sea, "An efficient soft-decision Reed-Solomon decoding algorithm," IEEE Trans. Inform. Theory, vol. 40, pp. 1130-1140, July 1994.
6. R. Kotier, "A new efficient error-erasure location scheme in GMD decoding," in Proc. Int. Syrnp. on Information Theory (San Antonio, TX, 1993), p. 33.
7. _, "Efficient generalized minimum distance decoding of algebraic geometric codes," in Proc. Int. Symp. on Information Theory (Trondheim. Norway, 1994), p. 151.
8. R. Pcllikaan. "On decoding by error location and dependent sets of erroi positions," in Discrète Mathematics. Amsterdam, The Netherlands: North-Holland, 1992, no. 106/107, pp. 369-381.
9. I.M. Duursma and R. Kotier, "Error-locating pairs for cyclic codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1108-1121, July 1994.
10. R. Kotier, "An unified description of an error localing procedure for linear codes," in Proc. Int. Workshop on Algebraic and Combinatorial Coding Theory (Voneshta Voda, Bulgaria, June 1992).
11. R.E. Blahut, Theory and Practice of Error Control Codes. Reading. MA: Addison-Wesley, 1983.
12. G.D. Forney, Concatenated Codes. Cambridge, MA: MIT Press, 1966.
13. R. Lucas, "A comparison of differenl melrics for GMD decoding," Dept. Inform. Tectmol., Univ. of Ulm, Germany, ITUU Tech. Rep. ITUU-TR-1995/01, Feb. 1995.
14. G.L. Feng and K. K. Tzeng, "A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1274-1287, Sept. 1991.
15. V.D. Goppa, "Codes associated with divisors," Probl. Inform. Transm., vol. 13, pp. 22-26. 1977.
16. J.H. van Lint and G. van der Geer, Introduction to Coding Theory and Algebraic Geometry. Basel, Boston, Berlin: Birkhäuser-Verlag, 1988.
17. A.N. Skorobogatov and S. G. Vläduf, "On the decoding of algebraicgeometric codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1051-1060. Nov. 1990.
18. 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. 37-45, Jan. 1993.
19. I.M. Duursma, "Majority coset decoding," IEEE Trans. Inform. Theory, vol. 39, pp. 1067-1071, May 1993.
20. D. Ehrhard, "Achieving the designed error capacity in decoding algebraic-geometric codes." IEEE Trans. Inform. Theory, vol. 39, pp. 743-751. May 1993.
21. J. Jnstesen, K. J. Larsen, H. R. Jensen, and T. Hpholt, "Fast decoding of codes from algebraic plane curves," IEEE Trans. Inj'orm. Theory, vol. 38, pp. 111-119, Jan. 1992.
22. S. Sakata, "Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array," J. Svmb. Comput., vol. 5 pp. 321-137, 19S8
23. 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.
24. T. H0holt and R. Pellikaan, "On the decoding of algebraic-geometric codes." IEF.E Trans. Inform. Theory (Special Issue on Algebraic Geometry Codes), vol. 41, pt. I, pp. 1589-1614, Nov. 1995.
25. H.E. Jensen, T. H0holt, and J. Justesen, "On the number of correctable errors for some AC codes," IEEE Trans. Inform. Theory, vol. 39, pp. 6X1-684, Mar. 1993.
26. S. Sakata, "Extension of the Berlekamp-Massey algorithm to N dimensions," Inform. Comput., vol. 84, pp. 207-239," 1990.
27. H. Stichtennth, "A note on Hermitian curves over OF (i?2)," IF.F.E Trans. Inform. Theory, vol. 34, pp. 1345-1348, Nov. 1988.