English
Related papers

Related papers: Good Codes From Dihedral Groups

200 papers

Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…

Information Theory · Computer Science 2024-11-08 Peng Wang , Ziling Heng

Based on the generic construction of linear codes, we construct linear codes over the ring $\Bbb Z_4$ via posets of the disjoint union of two chains. We determine the Lee weight distributions of the quaternary codes. Moreover, we obtain…

Information Theory · Computer Science 2019-10-29 Xiaomeng Zhu , Yansheng Wu , Qin Yue

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…

Information Theory · Computer Science 2025-01-22 Zhao Hu , Mingxiu Qiu , Nian Li , Xiaohu Tang , Liwei Wu

In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…

Information Theory · Computer Science 2025-10-13 Ankit Yadav , Ritumoni Sarma , Anuj Kumar Bhagat

Lenstra and Guruswami described number field analogues of the algebraic geometry codes of Goppa. Recently, the first author and Oggier generalised these constructions to other arithmetic groups: unit groups in number fields and orders in…

Number Theory · Mathematics 2020-09-01 Christian Maire , Aurel Page

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…

Information Theory · Computer Science 2018-11-26 Gaopeng Jian

In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…

Information Theory · Computer Science 2024-12-19 Xina Zhang

In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…

Information Theory · Computer Science 2018-07-03 Minjia Shi , Hongwei Zhu , Patrick Solé

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

Information Theory · Computer Science 2020-10-26 Simon Eisenbarth , Sihuang Hu

In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…

Information Theory · Computer Science 2021-07-27 Francisco Revson F. Pereira , Giuliano G. La Guardia , Francisco M. de Assis

In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…

Information Theory · Computer Science 2023-03-17 Hongwei Liu , Zihao Yu

In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…

Information Theory · Computer Science 2024-12-23 Cong Yu , Shixin Zhu , Hao Chen , Yang Li , Xiuyu Zhang

In this paper we extend the works \cite{gegeng2,XLZD} further in two directions and compute the weight distribution of these cyclic codes under more relaxed conditions. It is interesting to note that many cyclic codes in the family are…

Information Theory · Computer Science 2015-02-17 Maosheng Xiong , Nian Li

Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…

Information Theory · Computer Science 2020-03-18 Yansheng Wu , Yoonjin Lee

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…

Information Theory · Computer Science 2017-04-10 Shudi Yang , Xiangli Kong , Chunming Tang

In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^m$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.…

Information Theory · Computer Science 2023-05-15 Zhao Hu , Yunge Xu , Nian Li , Xiangyong Zeng , Lisha Wang , Xiaohu Tang

We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…

Number Theory · Mathematics 2025-02-28 Stefano Marseglia , Harry Smit

Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…

Information Theory · Computer Science 2007-11-27 Ted Hurley

In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…

Information Theory · Computer Science 2017-06-23 Long Yu , Xiusheng Liu

We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in \cite{Hurley1} by showing that one of the conditions given…

Information Theory · Computer Science 2016-04-28 Steven T. Dougherty , Joe Gildea , Rhian Taylor , Alexander Tylyshchak