A Note on The Enumeration of Euclidean Self-Dual Skew-Cyclic Codes over Finite Fields
Irwansyah, Intan Muchtadi-Alamsyah, Ahmad Muchlis, Aleams Barra, Djoko, Suprijanto

TL;DR
This paper derives enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields, focusing on cases where the code length and automorphism order are coprime or specific cases when they are not.
Contribution
It provides new enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields under various conditions.
Findings
Enumeration formulas for (n,|θ|)=1 cases
Partial enumeration results for (n,|θ|)>1 cases
Enhanced understanding of self-dual skew-cyclic codes structure
Abstract
In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when and for some cases when where is the length of the code and is the order of automorphism
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 · Cooperative Communication and Network Coding · Finite Group Theory Research
