English
Related papers

Related papers: New Constructions of Binary Cyclic Codes with Both…

200 papers

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…

Information Theory · Computer Science 2013-10-08 Cunsheng Ding , Zhengchun Zhou

We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A.…

Information Theory · Computer Science 2017-02-10 Itzhak Tamo , Alexander Barg , Sreechakra Goparaju , Robert Calderbank

In the realm of modern digital communication, cryptography, and signal processing, binary sequences with a low correlation properties play a pivotal role. In the literature, considerable efforts have been dedicated to constructing good…

Number Theory · Mathematics 2024-07-29 Lingfei Jin , Liming Ma , Chaoping Xing , Runtian Zhu

In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of…

Information Theory · Computer Science 2024-02-08 José Joaquín Bernal , Diana H. Bueno-Carreño , Juan Jacobo Simón

Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance plays a vital role in determining the error-correcting capability and the constructions of symbol-pair codes with…

Information Theory · Computer Science 2022-06-22 Junru Ma , Jinquan Luo

In this paper we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes through the notion of $\mathbb{B}$-apparent distance. We use…

Information Theory · Computer Science 2017-04-13 J. J. Bernal , M. Guerreiro , J. J. Simón

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…

Information Theory · Computer Science 2012-09-03 Alexander Zeh , Sergey Bezzateev

Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero…

Information Theory · Computer Science 2025-07-30 François Arnault , Philippe Gaborit , Nicolas Saussay

We investigate the minimum distance of structured binary Low-Density Parity-Check (LDPC) codes whose parity-check matrices are of the form $[\mathbf{C} \vert \mathbf{M}]$ where $\mathbf{C}$ is circulant and of column weight $2$, and…

Information Theory · Computer Science 2025-02-03 François Arnault , Philippe Gaborit , Wouter Rozendaal , Nicolas Saussay , Gilles Zémor

Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite…

Information Theory · Computer Science 2016-09-29 Sreechakra Goparaju , Robert Calderbank

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$…

Information Theory · Computer Science 2015-10-20 Cuiling Fan , Nian Li , Zhengchun Zhou

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Information Theory · Computer Science 2020-01-07 Ziling Heng , Cunsheng Ding , Weiqiong Wang

All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…

Information Theory · Computer Science 2016-11-18 Iliya Bouyukliev , Erik Jakobsson

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

Combinatorics · Mathematics 2018-07-27 Daniel R. Hawtin , Cheryl E. Praeger

Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…

Information Theory · Computer Science 2023-05-24 Yun Li , Hongwei Liu , Sihem Mesnager

It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…

Information Theory · Computer Science 2023-01-09 Chaofeng Guan , Ruihu Li , Liangdong Lu , Yu Yao

Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes -- a family of cyclic codes -- in practice. In theory, BCH…

Information Theory · Computer Science 2016-03-24 Cunsheng Ding , Cuiling Fan , Zhengchun Zhou

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma

Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory…

Information Theory · Computer Science 2023-11-01 Zhonghua Sun , Ling Li , Shixin Zhu