| [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 |