A class of repeated-root constacyclic codes over F<inf>p^m</inf>[u]/〈u^e〉 of Type 2

• Main Authors: Yuan Cao, Yonglin Cao, Hai Q. Dinh, Fang Wei Fu, Jian Gao, Songsak Sriboonchitta
• Format: Journal
• Published: 2018
• Subjects: Engineering; Mathematics
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85055880457&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/62927
• Institution: Chiang Mai University

© 2018 Elsevier Inc. 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)-constacyclic codes over Fpm[u]/〈ue〉 of length pk and their dual codes are presented precisely.