Constacyclic codes of length np^s over F_p^m+uF_p^m

From MaRDI portal
Publication:1783723



Abstract: Let mathbbFpm be a finite field of cardinality pm and R=mathbbFpm[u]/langleu2angle=mathbbFpm+umathbbFpm (u2=0), where p is a prime and m is a positive integer. For any lambdainmathbbFpmimes, an explicit representation for all distinct lambda-constacyclic codes over R of length psn is given by a canonical form decomposition for each code, where s and n are positive integers satisfying mgcd(p,n)=1. For any such code, using its canonical form decomposition the representation for the dual code of the code is provided. Moreover, representations for all distinct negacyclic codes and their dual codes of length psn over R are obtained, and self-duality for these codes are determined. Finally, all distinct self-dual negacyclic codes over mathbbF5+umathbbF5 of length 2cdot5scdot3t are listed for any positive integer t.




Cites work


Cited in
(36)








This page was built for publication: Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783723)