A class of repeated-root constacyclic codes over Fpm[u]/ ue of Type 2
Abstract
Let Fpm be a finite field of cardinality pm where p is an odd prime, n be a positive integer satisfying gcd(n,p)=1, and denote R=Fpm[u]/ ue where e≥ 4 be an even integer. Let δ,α∈ Fpm×. Then the class of (δ+α u2)-constacyclic codes over R is a significant subclass of constacyclic codes over R of Type 2. For any integer k≥ 1, an explicit representation and a complete description for all distinct (δ+α u2)-constacyclic codes over R of length npk and their dual codes are given. Moreover, formulas for the number of codewords in each code and the number of all such codes are provided respectively. In particular, all distinct (δ+α u2)-contacyclic codes over Fpm[u]/ ue of length pk and their dual codes are presented precisely.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.