$\sigma$-self-orthogonal constacyclic codes of length $p^s$ over $\mathbb F_{p^m}+u\mathbb F_{p^m}$
Hongwei Liu, Jingge Liu

TL;DR
This paper investigates the structure and conditions for $\sigma$-self-orthogonality of constacyclic codes over a specific finite chain ring, providing classifications and extending results to codes of length $2 p^s$.
Contribution
It characterizes $\sigma$-self-orthogonal and $\sigma$-self-dual constacyclic codes over $_{p^m}+u_{p^m}$ of length $p^s$, including necessary and sufficient conditions.
Findings
Derived the structure of $\sigma$-dual codes.
Established criteria for $\sigma$-self-orthogonality.
Identified all $\sigma$-self-dual codes of length $p^s$.
Abstract
In this paper, we study the -self-orthogonality of constacyclic codes of length over the finite commutative chain ring , where and is a ring automorphism of . First, we obtain the structure of -dual code of a -constacyclic code of length over . Then, the necessary and sufficient conditions for a -constacyclic code to be -self-orthogonal are provided. In particular, we determine the -self-dual constacyclic codes of length over . Finally, we extend the results to constacyclic codes of length .
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 · graph theory and CDMA systems · Cellular Automata and Applications
