Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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 (1909.03174v1)

Published 7 Sep 2019 in cs.IT and math.IT

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~$\mathbb{F}{q}+u\mathbb{F}{q}+u2\mathbb{F}_{q}$ with $u3=0$ have been established. In this paper, Hermitian self-dual linear codes over $\mathbb{F}{q}+u\mathbb{F}{q}+u2\mathbb{F}_{q}$ are studied for all square prime powers~$q$. Complete characterization and enumeration of such codes are given. Subsequently, algebraic characterization of $H$-quasi-abelian codes in $\mathbb{F}q[G]$ is studied, where $H\leq G$ are finite abelian groups and $\mathbb{F}_q[H]$ is a principal ideal group algebra. General characterization and enumeration of $H$-quasi-abelian codes and self-dual $H$-quasi-abelian codes in $\mathbb{F}_q[G]$ are given. For the special case where the field characteristic is $3$, an explicit formula for the number of self-dual $A\times \mathbb{Z}_3$-quasi-abelian codes in $\mathbb{F}{3m}[A\times \mathbb{Z}3\times B]$ is determined for all finite abelian groups $A$ and $B$ such that $3\nmid |A|$ as well as their construction. Precisely, such codes can be represented in terms of linear codes and self-dual linear codes over $\mathbb{F}{3m}+u\mathbb{F}{3m}+u2\mathbb{F}{3m}$.

Summary

We haven't generated a summary for this paper yet.