English
Related papers

Related papers: MDS codes with arbitrary dimensional hull and thei…

200 papers

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

Information Theory · Computer Science 2024-12-16 Yujie Zhi , Shixin Zhu

By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed-Muller codes over the projective plane. The dimension of the hull determines the minimum number of…

Information Theory · Computer Science 2025-03-03 Diego Ruano , Rodrigo San-José

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

In this paper, we provide conditions that hulls of generalized Reed-Solomon (GRS) codes are also GRS codes from algebraic geometry codes. If the conditions are not satisfied, we provide a method of linear algebra to find the bases of hulls…

Information Theory · Computer Science 2024-01-25 Xue Jia , Qin Yue , Huan Sun , Junzhen Sui

In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have…

Information Theory · Computer Science 2019-09-04 Xiaolei Fang , Khawla Lebed , Hongwei Liu , Jinquan Luo

Quantum error correction is fundamentally important for quantum information processing and computation. Quantum error correction codes have been studied and constructed since the pioneering papers of Shor and Steane. Optimal (called MDS)…

Quantum Physics · Physics 2022-08-01 Hao Chen

It is always interesting and important to construct non-Reed-Solomon type MDS codes in coding theory and finite geometries. In this paper, we prove that there are non-Reed-Solomon type MDS codes from arbitrary genus algebraic curves. It is…

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

Self-dual MDS and NMDS codes over finite fields are linear codes with significant combinatorial and cryptographic applications. In this paper, firstly, we investigate the duality properties of generalized twisted Reed-Solomon (abbreviated…

Information Theory · Computer Science 2022-02-24 Guanmin Guo , Ruihu Li , Yang Liu , Hao Song

In recent years, the construction of non-GRS type linear codes has attracted considerable attention due to that they can effectively resist both the Sidelnikov-Shestakov attack and the Wieschebrink attack. Constructing linear complementary…

Information Theory · Computer Science 2026-03-18 Zhonghao Liang , Dongmei Huang , Qunying Liao , Cuiling Fan , Zhengchun Zhou

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…

Information Theory · Computer Science 2024-10-24 Puyin Wang , Jinquan Luo

We study the subfield subcodes of projective Reed-Solomon codes and their duals: we provide bases for these codes and estimate their parameters. With this knowledge, we can construct symmetric and asymmetric entanglement-assisted quantum…

Information Theory · Computer Science 2023-11-28 Philippe Gimenez , Diego Ruano , Rodrigo San-José

A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…

Information Theory · Computer Science 2020-06-02 José Gómez-Torrecillas , Gabriel Navarro , José Patricio Sánchez-Hernández

In this paper, we mainly use classical Hermitian self-orthogonal generalized Reed-Solomon codes to construct two new classes of quantum MDS codes. Most of our quantum MDS codes have minimum distance larger than q/2+1. Compared with…

Information Theory · Computer Science 2020-03-24 Weiwei Wang , Jiantao Li

We present a new general construction of MDS codes over a finite field $\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that most of the…

Information Theory · Computer Science 2017-04-12 Peter Beelen , Sven Puchinger , Johan Rosenkilde né Nielsen

Long quantum codes using projective Reed-Muller codes are constructed. Projective Reed-Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum…

Information Theory · Computer Science 2025-03-03 Diego Ruano , Rodrigo San-José

The intersection ${\bf C}\bigcap {\bf C}^{\perp}$ (${\bf C}\bigcap {\bf C}^{\perp_h}$) of a linear code ${\bf C}$ and its Euclidean dual ${\bf C}^{\perp}$ (Hermitian dual ${\bf C}^{\perp_h}$) is called the Euclidean (Hermitian) hull of this…

Information Theory · Computer Science 2022-11-29 Hao Chen

The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows that the generator matrices of Reed-Solomon codes can attain every possible configuration of zeros for an MDS code. The recently emerging…

Information Theory · Computer Science 2025-06-05 Joshua Brakensiek , Manik Dhar , Sivakanth Gopi

New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…

Information Theory · Computer Science 2025-10-28 Puyin Wang , Wei Liu , Jinquan Luo , Dengxin Zhai

Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of $q$-ary MDS self-dual codes for…

Information Theory · Computer Science 2016-12-26 Lingfei Jin , Chaoping Xing

Given two $q$-ary codes $C_1$ and $C_2$, the relative hull of $C_1$ with respect to $C_2$ is the intersection $C_1\cap C_2^\perp$. We prove that when $q>2$, the relative hull dimension can be repeatedly reduced by one, down to a certain…

Information Theory · Computer Science 2023-12-27 Sarah E. Anderson , Eduardo Camps-Moreno , Hiram H. López , Gretchen L. Matthews , Diego Ruano , Ivan Soprunov