English
Related papers

Related papers: Galois hulls of MDS codes and their quantum error …

200 papers

Maximum distance separable (MDS) codes and near MDS (NMDS) codes are of particular interest in coding theory due to their optimal error-correcting capabilities and wide applications in communication, cryptography, and storage systems. A…

Information Theory · Computer Science 2026-05-13 Yang Li , Zhenliang Lu , San Ling , Kwok-Yan Lam

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

Information Theory · Computer Science 2018-07-17 Weijun Fang , Fang-Wei Fu

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

Information Theory · Computer Science 2020-02-17 Hualu Liu , Xiusheng Liu

We construct two new families of linear codes by modifying the generator matrices of generalized Reed-Solomon (GRS) codes. For these codes, we explicitly derive parity-check matrices and establish necessary and sufficient conditions…

Information Theory · Computer Science 2026-04-07 Kanat Abdukhalikov , Gyanendra K. Verma

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

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

Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary…

Information Theory · Computer Science 2023-07-11 Ruhao Wan , Shixin Zhu

Generalized Reed-Solomon and extended generalized Reed-Solomon (abbreviation to GRS and EGRS) codes are the most well-known family of MDS codes with wide applications in coding theory and practice. Let $\mathbb{F}_q$ be the $q$ elements…

Information Theory · Computer Science 2022-04-27 Canze Zhu

This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the…

Information Theory · Computer Science 2022-06-22 Gaojun Luo , Martianus Frederic Ezerman , San Ling

Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes because of their algebraic properties and excellent…

Information Theory · Computer Science 2026-04-08 Meiying Zhang , Shudi Yang , Yanbin Zheng

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

The entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting…

Quantum Physics · Physics 2016-02-09 Jihao Fan , Hanwu Chen , Juan Xu

An important family of quantum codes is the quantum maximum-distance-separable (MDS) codes. In this paper, we construct some new classes of quantum MDS codes by generalized Reed-Solomon (GRS) codes and Hermitian construction. In addition,…

Information Theory · Computer Science 2023-10-03 Ruhao Wan

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Information Theory · Computer Science 2022-08-30 Ruhao Wan , Shixin Zhu , Jin Li

Entanglement-assisted quantum error correcting codes (EAQECCs) are a simple and fundamental class of codes. They allow for the construction of quantum codes from classical codes by relaxing the duality condition and using pre-shared…

Information Theory · Computer Science 2016-06-02 Kenza Guenda , Somphong Jitman , T. Aaron Gulliver

Recently, Galindo et al. introduced the concept of asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) from Calderbank-Shor-Steane (CSS) construction. In general, it's difficult to determine the required number of…

Information Theory · Computer Science 2021-07-12 Ziteng Huang , Weijun Fang , Fang-Wei Fu

Extended Han-Zhang codes are a class of linear codes where each code is either a non-generalized Reed-Solomon (non-GRS) maximum distance separable (MDS) code or a near MDS (NMDS) code. They have important applications in communication,…

Information Theory · Computer Science 2026-01-09 Yang Li , Zhenliang Lu , San Ling , Shixin Zhu , Kwok Yan Lam

The entanglement-assisted stabilizer formalism can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs). In this work, we construct some new entanglement-assisted quantum MDS…

Information Theory · Computer Science 2019-11-20 Shixin Zhu , Wan Jiang , Xiaojing Chen

Generalized Reed-Solomon (GRS) and Gabidulin codes have been proposed for various code-based cryptosystems, though most such schemes without elaborate disguising techniques have been successfully attacked. Both code classes are prominent…

Cryptography and Security · Computer Science 2026-04-15 Felicitas Hörmann , Anna-Lena Horlemann

In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of…

Information Theory · Computer Science 2016-11-15 Peter Beelen , David Glynn , Tom Høholdt , Krishna Kaipa