English
Related papers

Related papers: Self-Dual Codes

200 papers

Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not…

Information Theory · Computer Science 2026-05-12 Patrick King , Mikhail Kotchetov

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…

Combinatorics · Mathematics 2021-01-08 Sudipta Mallik , Bahattin Yildiz

In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To do this, we classify the optimal double circulant…

Combinatorics · Mathematics 2016-08-26 T. Aaron Gulliver , Masaaki Harada

We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…

Number Theory · Mathematics 2007-05-23 Gary McGuire , Jose Felipe Voloch

In this paper, we study a relative two-weight $\mathbb{Z}_2 \mathbb{Z}_4$-additive codes. It is shown that the Gray image of a two-distance $\mathbb{Z}_2 \mathbb{Z}_4$-additive code is a binary two-distance code and that the Gray image of a…

Information Theory · Computer Science 2016-10-03 N. Annamalai , C. Durairajan

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada , Ken Saito

In $2006$, Danielsen and Parker \cite{DP} proved that every self-dual additive code over $GF(4)$ is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method…

Combinatorics · Mathematics 2014-04-01 Ruihu Li , Xueliang Li , Yaping Mao , Meiqin Wei

In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…

Information Theory · Computer Science 2018-07-16 Sanjit Bhowmick , Satya Bagchi , Ramakrishna Bandi

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

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Buket Özkaya , Hatoon Shoaib , Patrick Solé

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

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…

Information Theory · Computer Science 2016-10-05 Yun Fan , Liang Zhang

Binary self-dual sequences have been considered and analyzed throughout the years, and they have been used for various applications. Motivated by a construction for single-track Gray codes, we examine the structure and recursive…

Information Theory · Computer Science 2025-12-17 Tuvi Etzion

In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring…

Information Theory · Computer Science 2023-03-24 Joe Gildea , Adrian Korban , Adam Michael Roberts , Alexander Tylyshchak

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Information Theory · Computer Science 2017-10-16 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights…

Information Theory · Computer Science 2020-07-23 Guangkui Xu , Xiwang Cao

Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier…

Information Theory · Computer Science 2011-08-22 Cunsheng Ding , Jing Yang

The choice of an isomorphism, a duality, between a finite abelian group $A$ and its character group allows one to define dual codes of additive codes over $A$. Properties of dualities and dual codes are studied, continuing work of Delsarte…

Information Theory · Computer Science 2026-01-07 Jay A. Wood