English
Related papers

Related papers: Generalized Roth--Lempel Codes: NMDS Characterizat…

200 papers

The error-correcting pair is a general algebraic decoding method for linear codes. The near maximal distance separable (NMDS) linear code is a subclass of linear codes and has applications in secret sharing scheme and communication systems…

Information Theory · Computer Science 2025-06-10 Dong He , Zhaohui Zhang , Qunying Liao

Twisted generalized Reed-Solomon (TGRS) codes constitute an interesting family of evaluation codes, containing a large class of maximum distance separable codes non-equivalent to generalized Reed-Solomon (GRS) ones. Moreover, the Schur…

Information Theory · Computer Science 2025-01-24 Alain Couvreur , Rakhi Pratihar , Nihan Tanısalı , Ilaria Zappatore

In the modern era of large-scale computing systems, a crucial use of error correcting codes is to judiciously introduce redundancy to ensure recoverability from failure. To get the most out of every byte, practitioners and theorists have…

Information Theory · Computer Science 2026-02-26 Joshua Brakensiek , Venkatesan Guruswami

Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there are only few $q$-ary quantum MDS $[[n,n-2d+2,d]]_q$ codes with minimum distances…

Information Theory · Computer Science 2015-10-08 Xianmang He , Liqing Xu , Hao Chen

Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and…

Information Theory · Computer Science 2019-09-17 Mehmet E. Koroglu , Mustafa Sarı

A linear code with parameters $[n,k,n-k]$ is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum distance separable (NMDS for short) code. NMDS codes have…

Information Theory · Computer Science 2022-04-26 Xiaoru Li , Ziling Heng

We construct a new family of quantum MDS codes from classical generalized Reed-Solomon codes and derive the necessary and sufficient condition under which these quantum codes exist. We also give code bounds and show how to construct them…

Quantum Physics · Physics 2009-11-13 Zhuo Li , Li-Juan Xing , Xin-Mei Wang

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

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…

Information Theory · Computer Science 2026-05-25 Gustavo Terra Bastos , Angelynn Álvarez , Cameron Williams

Locally repairable codes (LRCs) have recently been widely used in distributed storage systems and the LRCs with $(r,\delta)$-locality ($(r,\delta)$-LRCs) attracted a lot of interest for tolerating multiple erasures. Ge et al. constructed…

Information Theory · Computer Science 2023-04-28 Yaxin Wang , Siman Yang

We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized…

Information Theory · Computer Science 2024-10-25 Beatriz Barbero-Lucas , Fernando Hernando , Helena Martín-Cruz , Gary McGuire

Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes. There is a close…

Information Theory · Computer Science 2016-05-24 Antti Pöllänen , Thomas Westerbäck , Ragnar Freij-Hollanti , Camilla Hollanti

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the…

Information Theory · Computer Science 2023-01-12 Yang Li , Shixin Zhu

Let $q=p^m$ be a prime power and $e$ be an integer with $0\leq e\leq m-1$. $e$-Galois self-dual codes are generalizations of Euclidean $(e=0)$ and Hermitian ($e=\frac{m}{2}$ with even $m$) self-dual codes. In this paper, for a linear code…

Information Theory · Computer Science 2025-02-27 Shixin Zhu , Ruhao Wan

One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized…

Information Theory · Computer Science 2015-08-06 Tao Zhang , Gennian Ge

Twisted generalized Reed-Solomon (TGRS) codes were introduced to extend the algebraic capabilities of classical generalized Reed-Solomon (GRS) codes. This extension holds the potential for constructing new non-GRS maximum distance separable…

Information Theory · Computer Science 2025-08-06 Guanghui Zhang , Liren Lin , Bocong Chen

The intersection ${\bf C}\bigcap {\bf C}^{\perp_H}$ of a linear code ${\bf C} \subset {\bf F}_{q^2}$ and its Hermitian dual ${\bf C}^{\perp_H}$ is called the Hermitian hull of this code. A linear code ${\bf C} \subset {\bf F}_{q^2}$…

Information Theory · Computer Science 2022-09-27 Hao Chen

Near maximum distance separable (NMDS) codes are important in finite geometry and coding theory. Self-dual codes are closely related to combinatorics, lattice theory, and have important application in cryptography. In this paper, we…

Combinatorics · Mathematics 2023-08-04 Dongchun Han , Hanbin Zhang

Locally repairable codes (LRCs) play a crucial role in mitigating data loss in large-scale distributed and cloud storage systems. This paper establishes a unified decomposition theorem for general optimal $(r,\delta)$-LRCs. Based on this,…

Quantum Physics · Physics 2025-07-25 Kun Zhou , Meng Cao

In this paper, two classes of twisted generalized Reed-Solomon (TGRS) codes with multi-twists are studied. Firstly, some sufficient and necessary conditions for these codes to be self-orthogonal and self-dual are established. Then several…

Information Theory · Computer Science 2026-05-25 Yanxin Chen , Yanli Wang , Tongjiang Yan