On Euclidean and Hermitian Self-Dual Cyclic Codes over $\mathbb{F}_{2^r}$
Odessa D. Consorte, Lilibeth D. Valdez

TL;DR
This paper investigates the existence and enumeration of nontrivial Euclidean and Hermitian self-dual cyclic codes over finite fields of characteristic two, extending known results to more general lengths and providing explicit formulas.
Contribution
It proves the existence of nontrivial self-dual cyclic codes of certain lengths over ^r and derives formulas for counting these codes based on cyclotomic cosets.
Findings
Existence of nontrivial Euclidean self-dual cyclic codes for lengths with specific splitting properties.
Formulas for counting Euclidean self-dual cyclic codes based on cyclotomic cosets.
Existence and properties of Hermitian self-dual cyclic codes over ^{2} and related length conditions.
Abstract
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length over exist if and only if is even and , where is any positive integer. For and even, there always exists an self-dual cyclic code with generator polynomial called the \textit{trivial self-dual cyclic code}. In this paper we prove the existence of nontrivial self-dual cyclic codes of length , where is odd, over in terms of the existence of a nontrivial splitting of by , where are unions of -cyclotomic cosets mod We also express the formula for the number of cyclic self-dual 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 · Finite Group Theory Research · graph theory and CDMA systems
