Constacyclic Codes over Finite Fields

Abstract

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length ${\ell }^t{p}^s$ are characterized, where $p$ is the characteristic of the finite field and $\ell$ is a prime different from $p$.

Cited by in corpus (2)

• A Construction of MDS Quantum Convolutional Codes
• On Repeated-Root Constacyclic Codes of Length $2^{a}m{p}^r$ over Finite Fields