Alternant and BCH codes over certain rings

Computational and Applied Mathematics

Volumn 22, Issue 2, 2003, Pages 233-247

  Andrade, A A ^a   Interlando, J C ^a   Palazzo, R ^b  

^a SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Algebraic decoding; Alternant codes; BCH codes; Codes over rings; Errors and erasures decoding; Galois extensions of local commutative rings; Lee metric; Modified Berlekamp Massey algorithm

Indexed keywords

MATRIX ALGEBRA;

ALGEBRAIC DECODING; ALTERNANT CODES; BCH CODE; BERLEKAMP-MASSEY ALGORITHM; CODES OVER RINGS; COMMUTATIVE RING; ERROR-AND ERASURE DECODING; ERRORS-AND-ERASURES DECODING; GALOI EXTENSION OF LOCAL COMMUTATIVE RING; GALOIS EXTENSION; LEE METRIC; MODIFIED BERLEKAMP-MASSEY ALGORITHM;

DECODING;

EID: 49449118798     PISSN: 22383603     EISSN: 18070302     Source Type: Journal    
DOI: 10.1590/S0101-82052003000200005     Document Type: Article

References (16)

1. A.R. Hammons Jr., P.V. Kumar, A.R. Calderbank, N.J.A. Sloane and P. Solé, The Z4-linearity of Kerdock, Preparata, Goethals and related codes, IEEE Trans. Inform. Theory, IT-40 (1994), pp. 301–319.
2. A.R. Calderbank, G. McGuire, P.V. Kumar and T. Helleseth, Cyclic codes over Z4, locator polynomials, and Newton’ identities, IEEE Trans. on Inform. Theory, 42 (1996), pp. 217–226.
3. E. Biglieri and M. Elia, On the construction of group block codes, Annales des Telecommunications, Tome 50, No. 9-10 (1995), pp. 817–823.
4. A.A. Andrade and R. Palazzo Jr., Construction and decoding of BCH codes over finite commutative rings, Linear Algebra and Its Applications, 286 (1999) pp. 69–85.
5. M. Greferath and U. Vellbinger, Efficient decoding of Z pk-linear codes, IEEE Trans. Inform. Theory, 44 (1998), pp. 1288–1291.
6. C.Y. Lee, Some properties of nonbinary error-correcting codes, IRE Trans. Inform. Theory, vol. 4, no. 4 (1958), pp. 77–82.
7. W. Ulrich, Non-binary error correction codes, Bell Sys. Tech. J., vol. 36, no. 6 (1957), pp. 1341–1387.
8. R.M. Roth and P.H. Siegel, Lee-metric BCH codes and their application to constrained and partial-reponse channels, IEEE Trans. Inform. Theory, vol. 40, no. 4 (1994), pp. 1083–1096.
9. G.D. Forney Jr., Generalized minimum distance decoding, IEEE Trans. Inform. Theory, IT-12 (1966) pp. 125–131.
10. B.R. McDonald, Finite Rings with Identity, Marcel Dekker, Inc., NewYork (1974).
11. J.C. Interlando, R. Palazzo Jr. and M. Elia, On the decoding of Reed-Solomon and BCH codes over integer residue rings, IEEE Trans. Inform. Theory, IT-43 (1997), pp. 1013–1021.
12. E.R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, NewYork, (1968).
13. G.D. Forney Jr., On decoding BCH codes, IEEE Trans. Inform. Theory, IT-11 (1965), pp. 549–557.
14. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error Correcting Codes, North-Holland, Amsterdam (1977).
15. W.W. Peterson and E.J. Weldon Jr., Error Correcting Codes, MIT Press, Cambridge, Mass., (1972).
16. J.L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory, IT-15 (1969), pp. 122–127.