Self-Dual Linear Codes over $\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}$ and Their Applications in the Study of Quasi-Abelian Codes
Parinyawat Choosuwan, Somphong Jitman

TL;DR
This paper characterizes and enumerates Hermitian self-dual codes over a specific finite ring and explores their applications in classifying and constructing quasi-abelian codes in group algebras, especially over fields of characteristic 3.
Contribution
It provides a complete characterization and enumeration of Hermitian self-dual codes over the ring and applies these results to study and explicitly construct self-dual quasi-abelian codes in group algebras.
Findings
Complete classification of Hermitian self-dual codes over the ring
Explicit enumeration formulas for self-dual quasi-abelian codes in characteristic 3
Construction methods for self-dual codes over the specified ring
Abstract
Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual linear codes over the ring~ with have been established. In this paper, Hermitian self-dual linear codes over are studied for all square prime powers~. Complete characterization and enumeration of such codes are given. Subsequently, algebraic characterization of -quasi-abelian codes in is studied, where are finite abelian groups and is a principal ideal group algebra. General characterization and enumeration of -quasi-abelian codes and self-dual -quasi-abelian codes in are…
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 · graph theory and CDMA systems
