Repeated-root constacyclic codes over the finite chain ring $\mathbf{ \mathbb{F}_{p^m}[u]/\langle u^3 \rangle }$
Anuradha Sharma, Tania Sidana

TL;DR
This paper classifies all repeated-root constacyclic codes over a specific finite chain ring, detailing their sizes, duals, distances, and weight distributions, and provides examples of isodual codes.
Contribution
It fully characterizes repeated-root constacyclic codes over the ring _{p^m}[u]/rac{u^3}{} with explicit parameters and properties, including duals and weight distributions.
Findings
All such codes are classified and their sizes determined.
Explicit dual codes and isodual codes are listed.
Hamming and RT distances, along with weight distributions, are computed.
Abstract
Let be the finite commutative chain ring with unity, where is a prime, is a positive integer and is the finite field with elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over their sizes and their dual codes. As an application, we list some isodual constacyclic codes over We also determine Hamming distances, RT distances, and RT weight distributions of some repeated-root constacyclic codes over
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
