English
Related papers

Related papers: An Efficient Construction of Self-Dual Codes

200 papers

This paper contributes to construct double circulant self-dual codes by sextic cyclotomy. Generator matrixes of a family of pure double circulant codes and a family of double circulant codes with boundary are formed from sextic cyclotomic…

Information Theory · Computer Science 2020-06-16 Tongjiang Yan , Tao Wang , Wenpeng Gao , Xvbo Zhao

In this paper, we determine all self-dual codes over $F_p+vF_p$ ($v^2=v$) in terms of self-dual codes over the finite field $F_p$ and give an explicit construction for self-dual codes over $F_p+vF_p$, where $p$ is a prime.

Information Theory · Computer Science 2013-04-18 Guanghui Zhang , Bocong Chen

Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Mengjie Yang , Yang Ming

MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…

Information Theory · Computer Science 2022-10-04 Ruhao Wan , Yang Li , Shixin Zhu

Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Akihiro Munemasa

A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…

Information Theory · Computer Science 2025-06-25 E. J. García-Claro

We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…

Information Theory · Computer Science 2017-01-05 Yan Liu , Minjia Shi , Patrick Solé

We give a classification of four-circulant singly even self-dual $[60,30,d]$ codes for $d=10$ and $12$. These codes are used to construct extremal singly even self-dual $[60,30,12]$ codes with weight enumerator for which no extremal singly…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…

Information Theory · Computer Science 2024-11-12 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang

In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…

Information Theory · Computer Science 2025-06-03 Puyin Wang , Jinquan Luo

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

Combinatorics · Mathematics 2015-03-13 Stefka Bouyuklieva , Nikolay Yankov , Radka Russeva

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

Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…

Information Theory · Computer Science 2023-07-06 Hao Chen

In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…

Information Theory · Computer Science 2026-05-15 Ankit Yadav , Nilay Kumar Mondal , Ritumoni Sarma

One of the most important and challenging problems in coding theory is to construct codes with best possible parameters and properties. The class of quasi-cyclic (QC) codes is known to be fertile to produce such codes. Focusing on QC codes…

Information Theory · Computer Science 2021-08-17 Dev Akre , Nuh Aydin , Matthew J. Harrington , Saurav R. Pandey

In this article, first we present a method for constructing many Hermitian LCD codes from a given Hermitian LCD code, and then provide several methods which utilize either a given [n, k, d] linear code or a given [n, k, d] Galois LCD code…

Information Theory · Computer Science 2023-10-09 Gyanendra K. Verma , Astha Agrawal , R. K. Sharma

A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be represented as the Cartesian product of $L$ linear codes over…

Information Theory · Computer Science 2017-06-23 Yu-Chih Huang , Krishna R. Narayanan

In this paper, we introduce a new definitions of the Gray weight and the Gray map for linear codes over $\mathbb{Z}_9+u\mathbb{Z}_9$ with $u^2=u$. Some results on self-dual codes over this ring are investigated. Further, the structural…

Information Theory · Computer Science 2015-01-05 Jian Gao , XianFang Wang , Fang-Wei Fu

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

Information Theory · Computer Science 2009-11-03 Reza Omrani , Gagan Garg , P. Vijay Kumar , Petros Elia , Pankaj Bhambhani

Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes $\mathcal{C}_{(q,q+1,4,1)}$ and their dual codes with $q=2^m$ and established that the codewords of the minimum (or the second minimum) weight in these…

Information Theory · Computer Science 2021-07-02 Qianqian Yan , Junling Zhou