On $(\alpha+u\beta)$-constacyclic codes of length $p^sn$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Yuan Cao, Qingguo Li

TL;DR
This paper characterizes all $(eta+ueta)$-constacyclic codes over a specific finite ring of length $p^sn$, including their duals, with detailed classifications for certain parameters over $ ext{F}_3+u ext{F}_3$.
Contribution
It provides a complete classification of $(eta+ueta)$-constacyclic codes over $ ext{F}_{p^m}+u ext{F}_{p^m}$ of length $p^sn$, including explicit descriptions of dual codes.
Findings
Explicit representations of all such codes and their duals.
Special enumeration of $(2+u)$-constacyclic codes of length $6 ext{·}5^t$ over $ ext{F}_3+u ext{F}_3$.
Complete classification for codes with parameters satisfying gcd conditions.
Abstract
Let be a finite field of cardinality and , where is an odd prime and is a positive integer. For any , the aim of this paper is to represent all distinct -constacyclic codes over of length and their dual codes, where is a nonnegative integer and is a positive integer satisfying . Especially, all distinct -constacyclic codes of length over and their dual codes are listed, where is a positive integer.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
