Repeated-root constacyclic codes of length $2\ell^mp^n$
Bocong Chen, Hai Q. Dinh, Hongwei Liu

TL;DR
This paper characterizes the structure of constacyclic codes of length $2 ext{l}^ ext{m} ext{p}^ ext{n}$ over finite fields, including duals, and identifies all self-dual and complementary dual codes for these lengths.
Contribution
It provides a comprehensive structural analysis of repeated-root constacyclic codes of specified length over finite fields, including dual and self-dual codes, which was previously unexplored.
Findings
All linear complementary dual constacyclic codes are identified.
All self-dual constacyclic codes of the specified length are characterized.
The structure of these codes is described in terms of generator polynomials.
Abstract
For any different odd primes and , structure of constacyclic codes of length over a finite field of characteritic and their duals is established in term of their generator polynomials. Among other results, all linear complimentary dual and self-dual constacyclic codes of length over are obtained.
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
