A vector version of the bms algorithm for implementing fast erasure-and-error decoding of one-point ag codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1255, Issue , 1997, Pages 291-310

  Sakata, Shojiro ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DECODING; ERRORS;

BERLEKAMP-MASSEY ALGORITHM; DECODING METHODS; ERASURE AND ERROR DECODING; MINIMAL POLYNOMIALS; ONE-POINT AG CODES;

ALGEBRA;

EID: 84957804442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63163-1_23     Document Type: Conference Paper

References (15)

1. S. Sakata, “Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array”, J. Symbolic Computation, vol.5, pp.321-337, 1988.
2. S. Sakata, “Extension of the Berlekamp-Massey algorithm to N dimensions”, Information and Computation, vol.84, pp.207-239, 1990.
3. ab up to half the Feng-Rao bound”, Finite Fields and Their Applications, vol.1, pp.83-101, 1995.
4. S. Sakata, J. Justesen, Y. Madelung, H. Elbrønd Jensen, and T. Høholdt, “Fast decoding of algebraic geometric codes up to the designed minimum distance”, IEEE Transactions on Information Theory, vol. 41, Part I, pp.1672-1677, 1995.
5. S. Sakata, “nD shift register synthesis on convex cones and cylinders and fast decoding of general one-point AG codes”, presented at the 1994 IEEE Workshop on Information Theory, Moscow, Russia, July 1994; Bulletin of the University of Electro-Communications, vol. 8, pp. 187-203, 1995.
6. S. Sakata, H. Elbrønd Jensen, and T. Høholdt, “Generalized Berlekamp-Massey decoding of algebraic geometric codes up to half the Feng-Rao bound”, IEEE Transactions on Information Theory, vol. 41, Part I, pp. 1762-1768, 1995.
7. G.L. Feng and T.R.N. Rao, “Decoding algebraic-geometric codes up to the designed minimum distance”, IEEE Transactions on Information Theory, vol. 39, pp. 37-45, 1993.
8. T. Høholdt and R. Pellikaan, On the decoding of Algebraic Geometry codes, IEEE Transactions on Information Theory, vol. 41, Part I, pp. 1589-1614, 1995.
9. G.D. Forney, “On decoding BCH codes”, IEEE Transactions on Information Theory, vol. 11, pp. 549-557, 1965.
10. G.L. Feng and T.R.N. Rao, “Erasure-and-error decoding of algebraic-geometric codes”, presented at the 1993 IEEE Information Theory Workshop, Shizuoka, Japan, June 1993.
11. S. Sakata, “Finding a minimal polynomial vector of a vector of nD arrays”, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Proceedings of AAECC-9, New Orleans, USA: Lecture Notes in Computer Science, 539, Springer Verlag, pp. 414-425, 1991.
12. R. Kötter, On Algebraic Decoding of Algebraic Geometric and Cyclic Codes, Dessertation, Department of Electrical Engineering, Linkoping, Sweden, 1996.
13. D.A. Leonard, “Error-locator ideals for algebraic-geometric codes”, IEEE Transactions on Information Theory, vol. 41, Part I, pp. 819-824, 1995.
14. A.N. Skorobogatov and S.G. Vlǎduţ, “On the decoding of algebraic-geometric codes”, IEEE Transactions on Information Theory, vol. 36, pp. 1051-1060, 1990.
15. S. Sakata and M. Kurihara, “A systolic array architecture for implementing a fast parallel decoding algorithm of one-point AG-codes”, submitted for presentation at the 1997 IEEE International Symposium on Information Theory, Ulm, Germany, July 1997.