Constacyclic codes of length np^sover F<inf>p</inf>m + uF<inf>p</inf>m

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

© 2018 AIMS. Let Fpm be a finite field of cardinality pmand R = Fpm [u]/〈u2〉 = Fpm + uFpm (u2= 0), where p is a prime and m is a positive integer. For any λ ∈ F×pm, an explicit representation for all distinct λ-constacyclic codes over R of length npsis given by a canonical form decomposition for eac...