Repeated-root constacyclic codes of length ℓ t p s and their dual codes

Abstract

Constacyclic codes form an interesting family of error-correcting codes due to their rich algebraic structure, and are generalizations of cyclic and negacyclic codes. In this paper, we classify repeated-root constacyclic codes of length ℓ t p s over the finite field F p m $\mathbb {F}_{p^{m}}$ containing p m elements, where ℓ ≡ 1(mod 2), p are distinct… (More)
DOI: 10.1007/s12095-014-0106-5

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.