Repeated-Root Constacyclic Codes of Length 2p^s
Finite Fields and Their Applications
94B15, 12Y05, cyclic codes, negacyclic codes, constacyclic codes, dual codes, repeated-root codes
Algebra | Applied Mathematics | Mathematics
The algebraic structures in term of polynomial generators of all constacyclic codes of length 2ps over the finite field Fpm are established. Among other results, all self-dual negacyclic codes of length 2ps, where p ≡ 1 (mod 4) (any m), or p ≡ 3 (mod 4) and m is even, are provided. It is also shown the non-existence of self-dual negacyclic codes of length 2ps, where p ≡ 3 (mod 4), m is odd, and self-dual cyclic codes of length 2ps, for any odd prime p.
Dinh, Hai Q. (2012). Repeated-Root Constacyclic Codes of Length 2p^s. Finite Fields and Their Applications 18(1), 133-143. doi: 10.1016/J.FFA.2011.07.003 Retrieved from https://digitalcommons.kent.edu/mathpubs/19