Repeated-Root Constacyclic Codes of Length ℓp^s and Their Duals
Discrete Applied Mathematics
finite field, constacyclic code, cyclic code, generator polynomial, dual code
Discrete Mathematics and Combinatorics | Mathematics
An equivalence relation is introduced on the nonzero elements of the finite field Fpm to classify constacyclic codes of arbitrary length over Fpm. According to the equivalence classes, all constacyclic codes of length ℓps over Fpm and their duals are characterized, where ℓ is a prime different from p and s is a positive integer. Self-dual cyclic codes of length ℓps over Fpm exist precisely when p is equal to two; in this case, all self-dual cyclic codes of length 2sℓ over F2m are presented.
Chen, Bocong; Dinh, Hai Q.; and Liu, Hongwei (2014). Repeated-Root Constacyclic Codes of Length ℓp^s and Their Duals. Discrete Applied Mathematics 177, 60-70. doi: 10.1016/J.DAM.2014.05.046 Retrieved from https://digitalcommons.kent.edu/mathpubs/18