Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes

Abualrub, 2003, On the generators of Z4 cyclic codes of length 2e, IEEE Trans. Inform. Theory, 49, 2126, 10.1109/TIT.2003.815763

Berlekamp, 1968

Bini, 2002, Finite Commutative Rings and Their Applications, vol. 680

Blackford, 2003, Negacyclic codes over Z4 of even length, IEEE Trans. Inform. Theory, 49, 1417, 10.1109/TIT.2003.811915

Blackford, 2000, A transform approach to permutation groups of cyclic codes over Galois rings, IEEE Trans. Inform. Theory, 46, 2350, 10.1109/18.887849

Calderbank, 1995, Modular and p-adic cyclic codes, Des. Codes Cryptogr., 6, 21, 10.1007/BF01390768

Castagnoli, 1991, On repeated-root cyclic codes, IEEE Trans. Inform. Theory, 37, 337, 10.1109/18.75249

Cazaran, 1999, On finite principal ideal rings, Acta Math. Univ. Comenian. (N.S.), 68, 77

Cazaran, 1997, Generators and weights of polynomial codes, Arch. Math. (Basel), 69, 479, 10.1007/s000130050149

Dinh, 2005, Negacyclic codes of length 2s over Galois rings, IEEE Trans. Inform. Theory, 51, 4252, 10.1109/TIT.2005.859284

Dinh, 2007, Complete distances of all negacyclic codes of length 2s over Z2a, IEEE Trans. Inform. Theory, 53, 147, 10.1109/TIT.2006.887487

Dinh, 2008, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Finite Fields Appl., 14, 22, 10.1016/j.ffa.2007.07.001

Dinh, 2009, Constacyclic codes of length 2s over Galois extension rings of F2+uF2, IEEE Trans. Inform. Theory, 55, 1730, 10.1109/TIT.2009.2013015

Dinh, 2010, Constacyclic codes of length ps over Fpm+uFpm, J. Algebra, 324, 940, 10.1016/j.jalgebra.2010.05.027

Dinh, 2009, On the structure of cyclic and negacyclic codes over finite chain rings, vol. 6, 22

Dinh, 2004, Cyclic and negacyclic codes over finite chain rings, IEEE Trans. Inform. Theory, 50, 1728, 10.1109/TIT.2004.831789

Dougherty, 2007, On modular cyclic codes, Finite Fields Appl., 13, 31, 10.1016/j.ffa.2005.06.004

Granville, 1997, Arithmetic properties of binomial coefficients. I. Binomial coefficients modulo prime powers, vol. 20, 253

Hammons, 1994, The Z4-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory, 40, 301, 10.1109/18.312154

Kai, 2010, On the distance of cyclic codes of length 2e over Z4, Discrete Math., 310, 12, 10.1016/j.disc.2009.07.018

Kanwar, 1997, Cyclic codes over the integers modulo pm, Finite Fields Appl., 3, 334, 10.1006/ffta.1997.0189

Kiah, 2008, Cyclic codes over GR(p2,m) of length pk, Finite Fields Appl., 14, 834, 10.1016/j.ffa.2008.02.003

Kumar, 1996, Large families of quaternary sequences with low correlation, IEEE Trans. Inform. Theory, 42, 579, 10.1109/18.485726

López-Permouth, 2009, On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings, Adv. Math. Commun., 3, 409, 10.3934/amc.2009.3.409

Massey, 1973, Polynomial weights and code constructions, IEEE Trans. Inform. Theory, IT-19, 101, 10.1109/TIT.1973.1054936

McDonald, 1974, Finite Rings with Identity, vol. 28

Nechaev, 1991, Linear recurrent sequences over commutative rings, Diskret. Mat., 3, 105

Nechaev, 2001, A canonical system of generators of a unitary polynomial ideal over a commutative Artinian chain ring, Diskret. Mat., 13, 3

Norton, 2003, Cyclic codes and minimal strong Gröbner bases over a principal ideal ring, Finite Fields Appl., 9, 237, 10.1016/S1071-5797(03)00003-0

Norton, 2000, On the Hamming distance of linear codes over a finite chain ring, IEEE Trans. Inform. Theory, 46, 1060, 10.1109/18.841186

Norton, 2000, On the structure of linear and cyclic codes over a finite chain ring, Appl. Algebra Engrg. Comm. Comput., 10, 489, 10.1007/PL00012382

Norton, 2001, Strong Gröbner bases for polynomials over a principal ideal ring, Bull. Aust. Math. Soc., 64, 505, 10.1017/S0004972700019973

Özadam, 2009, A note on negacyclic and cyclic codes of length ps over a finite field of characteristic p, Adv. Math. Commun., 3, 265, 10.3934/amc.2009.3.265

Pless, 1996, Cyclic codes and quadratic residue codes over Z4, IEEE Trans. Inform. Theory, 42, 1594, 10.1109/18.532906

Roth, 1986, On cyclic MDS codes of length q over GF(q), IEEE Trans. Inform. Theory, 32, 284, 10.1109/TIT.1986.1057151

Sălăgean, 2006, Repeated-root cyclic and negacyclic codes over a finite chain ring, Discrete Appl. Math., 154, 413, 10.1016/j.dam.2005.03.016

Tang, 1997, A note on the q-ary image of a qm-ary repeated-root cyclic code, IEEE Trans. Inform. Theory, 43, 732, 10.1109/18.556131

van Lint, 1991, Repeated-root cyclic codes, IEEE Trans. Inform. Theory, 37, 343, 10.1109/18.75250

Vega, 2004, Some families of Z4-cyclic codes, Finite Fields Appl., 10, 530, 10.1016/j.ffa.2003.11.003

Wolfmann, 1999, Negacyclic and cyclic codes over Z4, IEEE Trans. Inform. Theory, 45, 2527, 10.1109/18.796397

Wolfmann, 2001, Binary images of cyclic codes over Z4, IEEE Trans. Inform. Theory, 47, 1773, 10.1109/18.930917

Zimmermann, 1996, On generalizations of repeated-root cyclic codes, IEEE Trans. Inform. Theory, 42, 641, 10.1109/18.485736