Acta mathematica scientia, Series B >
CYCLIC CODES OVER FORMAL POWER SERIES RINGS
Received date: 2008-05-15
Revised date: 2009-06-03
Online published: 2011-01-20
Supported by
The second author was supported by SRF for ROCS, SEM, the Key Project of Chinese Ministry of Education (108099), and CCNU Project (CCNU09Y01003)
In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.
Key words: Finite chain rings; cyclic codes; negacyclic codes; γ-adic codes
Dougherty Steven T. , LIU Hong-Wei . CYCLIC CODES OVER FORMAL POWER SERIES RINGS[J]. Acta mathematica scientia, Series B, 2011 , 31(1) : 331 -343 . DOI: 10.1016/S0252-9602(11)60233-6
[1] Calderbank A R, Sloane N J A. Modular and p-adic cyclic codes. Designs, Codes, Cryptogr, 1995, 6: 21–35
[2] Kanwar P, L´opez-Permouth S R. Cyclic codes over the integers modulo pm. Finite Fields Appl, 1997, 3: 334–352
[3] Wan Z. Cyclic codes over Galois rings. Alg Colloq, 1999, 6: 291–304
[4] Norton G H, S?al?agean A. On the structure of linear and cyclic codes over a finite chain ring. Appl Algebra Engrg Comm Comput, 2000, 10: 489–506
[5] Dinh H, L´opez-Permouth S R. Cyclic and negacyclic codes over finite chain rings. IEEE Trans Inform Theory, 2004, 50: 1728–1744
[6] Dougherty S T, Park Y H. On modular cyclic codes. Finite Fields Appl, 2007, 13: 31–57
[7] Forney G D, Sloane N J A, Trott M. The Nordstrom-Robinson code is the binary image of the octa-code//Calderbank et al. Coding and Quantization: DIMACS/IEEE workshop 1992, Amer Math Soc, 1993
[8] Hammons A R Jr, Kumar P V, Calderbank A R, Sloane N J A, Sol´e P. The Z4 linearity of Kerdock, Preparata, Goethals and related codes. IEEE Trans Inform Theory, 1994, 40: 301–319
[9] Solé P. Open problem 2: cyclic codes over rings and p-adic fields//Coding theory and applications (Toulon, 1988), 329, Lecture Notes in Comput Sci, 388. New York: Springer, 1989
[10] Dougherty S T, Kim S Y, Park Y H. Lifted codes and their weight enumerators. Discrete Math, 2005, 305: 123–135
[11] Dougherty S T, Liu H, Park Y H. Lifted codes over finite chain rings. Mathematical Journal of Okayama University, 2011, 53: 39–53
[12] Wood J. Duality for modules over finite rings and applications to coding theory. Amer J Math, 1999, 121: 555–575
[13] McDonald B R. Finite Rings with Identity. New York: Marcel Dekker, Inc, 1974
[14] Zariski O, Samuel P. Commutative Algebra. New York: Van Nostrand, 1958
[15] Dougherty S T, Park Y H. Codes over the p-adic integers. Designs, Codes, Cryptogr, 2006, 39: 65–80
[16] Dougherty S T, Shiromoto K. MDR Codes over Zk. IEEE Trans Inform Theory, 2000, 46: 265–269
[17] Greferath M, Schmidt S E. Finite-ring combinatorics and MacWilliams’equivalence theorem. J Combin Theory, Ser A, 2000, 92: 17–28
[18] Hungerford T W. Algebra. New York: Springer-Verlag, 1974
[19] MacWilliams F J, Sloane N J A. The Theory of Error-Correcting Codes. Amstterdam: North-Holland, 1977
[20] Pless V S, Huffman W C. Handbook of Coding Theory. Amsterdam: Elsevier, 1998
[21] Rains E, Sloane N J A. Self-dual codes//Pless V S, Huffman W C. Handbook of Coding Theory. Amster-dam: Elsevier, 1998: 177–294
[22] Van Lint J H. Repeated-root cyclic codes. IEEE Trans Inform Theory, 1991, 37: 343–345
/
| 〈 |
|
〉 |