English
Related papers

Related papers: Some MDS codes over dihedral groups

200 papers

For each odd prime power $q$, let $4 \leq n\leq q^{2}+1$. Hermitian self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS codes for $4…

Information Theory · Computer Science 2015-05-13 Ruihu Li , Zongben Xu

In this paper, we introduce a method computing the primitive decomposition of idempotents of any semisimple finite group algebra based on its matrix representations and Wedderburn decomposition. Particularly, we use this method to calculate…

Rings and Algebras · Mathematics 2022-06-07 Lilan Dai , Yunnan Li

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Information Theory · Computer Science 2022-08-30 Ruhao Wan , Shixin Zhu , Jin Li

Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…

Information Theory · Computer Science 2026-02-05 Miguel Sales-Cabrera , Xaro Soler-Escrivà , Víctor Sotomayor

Codes in the generalized quaternion group algebra $\mathbb{F}_q[Q_{4n}]$ are considered. Restricting to char$\mathbb{F}_q \nmid 4n$ the structure of an arbitrary code $C \subseteq \mathbb{F}_q[Q_{4n}]$ is described via the Wedderburn…

Information Theory · Computer Science 2025-01-06 Nadja Willenborg

Let $\mathbb{F}_{q}$ be the finite field of $q$ elements and let $D_{2n}=\langle x,y\mid x^n=1, y^2=1, yxy=x^{n-1}\rangle$ be the dihedral group of order $n$. Left ideals of the group algebra $\mathbb{F}_{q}[D_{2n}]$ are known as left…

Information Theory · Computer Science 2021-05-18 Yuan Cao , Yonglin Cao , Fanghui Ma

The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…

Information Theory · Computer Science 2019-03-14 Ted Hurley

In this work we show that every minimal code in a semisimple group algebra $\mathbb{F}_qG$ is essential if $G$ is a simple group. Since the alternating group $A_n$ is simple if $n=3$ or $n\geq 5$, we present some examples of minimal codes…

Rings and Algebras · Mathematics 2023-10-27 Robson Ricardo de Araujo , Francisco Cesar Polcino Milies , Raul Antonio Ferraz

In this article, we show explicitly the Wedderburn decomposition of the metacyclic group algebra $\mathbb F_qG$, where $G$ has a cyclic subgroup of index 2 and $\gcd(|G|,q)=1$. We also construct the complete set of central and left…

Number Theory · Mathematics 2022-10-14 F. E. Brochero Martínez , L. Batista de Oliveira , C. R. Giraldo Vergara

In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have…

Information Theory · Computer Science 2019-09-04 Xiaolei Fang , Khawla Lebed , Hongwei Liu , Jinquan Luo

A subset $S$ of $\{0,1,...,2t-1\}^n$ is called a $t$-fold MDS code if every line in each of $n$ base directions contains exactly $t$ elements of $S$. The adjacency graph of a $t$-fold MDS code is not connected if and only if the…

Combinatorics · Mathematics 2008-05-14 Denis Krotov

In this article, we show the relation between the irreducible idempotents of the cyclic group algebra $\mathbb F_qC_n$ and the central irreducible idempotents of the group algebras $\mathbb F_qD_{2n}$, where $\mathbb F_q$ is a finite field…

Rings and Algebras · Mathematics 2015-09-28 F. E. Brochero Martínez

In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…

Rings and Algebras · Mathematics 2021-03-02 Kirill V. Vedenev , Vladimir M. Deundyak

Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class…

Representation Theory · Mathematics 2014-01-10 Gabriela Olteanu , Inneke Van Gelder

We construct quantum MDS codes with parameters $ [\![ q^2+1,q^2+3-2d,d ]\!] _q$ for all $d \leqslant q+1$, $d \neq q$. These codes are shown to exist by proving that there are classical generalised Reed-Solomon codes which contain their…

Quantum Physics · Physics 2021-01-15 Simeon Ball

In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $N\leq q+1$ (for $q$ odd) or $N\leq q+2$ (for $q$ even), using a set of non--degenerate Hermitian forms in $PG(2,q^2)$.

Information Theory · Computer Science 2009-07-19 A. Aguglia , L. Giuzzi

Based on results in finite geometry we prove the existence of MRD codes in (F_q)_(n,n) with minimum distance n which are essentially different from Gabidulin codes. The construction results from algebraic structures which are closely…

Information Theory · Computer Science 2025-10-06 Javier de la Cruz , Michael Kiermaier , Alfred Wassermann , Wolfgang Willems

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed $q$, our results can produce more classes of MDS…

Information Theory · Computer Science 2018-07-30 Khawla Labad , Honwei Liu , Jinquan Luo

In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…

Information Theory · Computer Science 2019-10-01 Xiaolei Fang , Meiqing Liu , Jinquan Luo

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

Information Theory · Computer Science 2021-05-18 H. Aghili , R. Sobhani
‹ Prev 1 2 3 10 Next ›