Articles

ON THE CHARACTERIZATION OF CYCLIC CODES OVER TWO CLASSES OF RINGS

  • LIU Xiu-Sheng
Expand
  • School of Mathematics and Physics, Hubei Polytechnic University, Huangshi 435003, China

Received date: 2011-04-08

  Revised date: 2012-07-08

  Online published: 2013-03-20

Supported by

The author is supported by the Natural Science Foundation of Hubei Province (B20114410) and the Natural Science Foundation of Hubei Polytechnic University (12xjz14A).

Abstract

Let R be a finite chain ring with maximal ideal (γ) and residue field F, and let γ be of nilpotency index t. To every code C of length n over R, a tower of codes C = (Cγ0) ⊆ (Cγ) ⊆ … ⊆ (Cγi) ⊆ … ⊆ (C : γt−1) can be associated with C, where for any rR, (C : r) = {eRn | reC}. Using generator elements of the projection of such a tower of codes to the residue field F, we characterize cyclic codes over R. This
characterization turns the condition for codes over R to be cyclic into one for codes over the residue field F. Furthermore, we obtain a characterization of cyclic codes over the formal power series ring of a finite chain ring.

Cite this article

LIU Xiu-Sheng . ON THE CHARACTERIZATION OF CYCLIC CODES OVER TWO CLASSES OF RINGS[J]. Acta mathematica scientia, Series B, 2013 , 33(2) : 413 -422 . DOI: 10.1016/S0252-9602(13)60008-9

References

[1] Huffman W C, Pless V. Fundamentals of Error-Correcting Codes. Cambridge: Cambridge Univ Press, 2003

[2] Calderbank A R, Sloane N J A. Modular and p-adic cyclic codes. Designs, Codes and Cryptography, 1995, 6: 21–35

[3] Wan Z. Cyclic codes over Galois rings. Alg Colloq, 1999, 6: 291–304

[4] Norton G H, S?al?agean A S. On the structure of linear and cyclic codes over a finite chain ring. Applicable algebra in engineering, communication and computing, 2000, 10: 489–506

[5] Dinh H Q, Lopez-Permouth S R. Cyclic and negacyclic codes over finite chain Rings. IEEE Trans Inform Theory, 2004, 50: 1728–1744

[6] McDonald B R. Finite Rings with Identity. New York: Marcel Dekker, 1974

[7] Norton G H, S?al?agean A. On the Hamming distance of linear codes over a finite chain ring. IEEE Trans Inform Theory, 2000, 46:  1060–1067

[8] Kanwar P, Lopez-Permouth S R. Cyclic codes over the integers modulo pm. Finite Fields Appl, 1997, 3: 334–352

[9] Dougherty S T, Liu H, Park Y H. Lifted codes over finite chain rings. Mathematical Jounal of Okayama Universty, 2011, 53: 39–53

[10] Dougherty S T, Liu H. Cyclic codes over formal power series rings. Acta Mathematical Scientia, 2011, 31: 331–343

Outlines

/