English
Related papers

Related papers: Entanglement-Assisted and Subsystem Quantum Codes:…

200 papers

We study the Hermitian hull of a particular family of generalized Reed-Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas…

Information Theory · Computer Science 2025-07-25 Oisin Campion , Rodrigo San-José

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é

In this paper, we produce some new classes of entanglement-assisted quantum MDS codes(EAQMDS codes for short) via generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many EAQMDS codes…

Information Theory · Computer Science 2020-08-27 Renjie Jin , Yiran Cao , Jinquan Luo

By generalizing the stabilizer quantum error-correcting codes, entanglement-assisted quantum error-correcting (EAQEC) codes were introduced, which could be derived from any classical linear codes via the relaxation of self-orthogonality…

Information Theory · Computer Science 2024-03-19 Xiujing Zheng , Liqi Wang , Shixin Zhu

In this paper, we study the Hermitian hulls of generalized Reed-Solomon (GRS) codes over finite fields. For a given class of GRS codes, by extending the length, increasing the dimension, and extending the length and increasing the dimension…

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

We demonstrate propagation rules of subsystem code constructions by extending, shortening and combining given subsystem codes. Given an $[[n,k,r,d]]_q$ subsystem code, we drive new subsystem codes with parameters $[[n+1,k,r,\geq d]]_q$,…

Quantum Physics · Physics 2008-11-11 Salah A. Aly

Entanglement-assisted quantum error correcting codes (EAQECCs) constructed from Reed-Solomon codes and BCH codes are considered in this work. It is provided a complete and explicit formula for the parameters of EAQECCs coming from any…

Information Theory · Computer Science 2022-08-25 Carlos Galindo , Fernando Hernando , Diego Ruano

In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS…

Information Theory · Computer Science 2022-07-19 Lin Sok

It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…

Information Theory · Computer Science 2019-12-06 Weijun Fang , Fang-Wei Fu

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é

Quantum error correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a…

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct…

Information Theory · Computer Science 2024-04-09 Gaojun Luo , Lin Sok , Martianus Frederic Ezerman , San Ling

Entanglement-assisted quantum (QUENTA) codes are a subclass of quantum error-correcting codes which use entanglement as a resource. These codes can provide error correction capability higher than the codes derived from the traditional…

Information Theory · Computer Science 2019-11-18 Francisco Revson F. Pereira

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

Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise. Recently, constructing entanglement-assisted quantum maximum distance separable…

Information Theory · Computer Science 2020-09-17 Wan Jiang , Shixin Zhu , Xiaojing Chen

In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It…

Information Theory · Computer Science 2019-12-09 Weijun Fang , Fang-Wei Fu , Lanqiang Li , Shixin Zhu

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é

In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties.…

Quantum Physics · Physics 2024-02-02 Gaojun Luo , Martianus Frederic Ezerman , Markus Grassl , San Ling

Construction of good quantum codes via classical codes is an important task for quantum information and quantum computing. In this work, by virtue of a decomposition of the defining set of constacyclic codes we have constructed eight new…

Information Theory · Computer Science 2019-01-11 Mehmet E. Koroglu

Folded Reed-Solomon codes, introduced by Guruswami and Rudra in 2007, have been shown to achieve the information-theoretically best possible trade-off between the rate of a code and the error-correction radius. In 2024, Bergamaschi,…

Information Theory · Computer Science 2026-05-12 Gretchen L. Matthews , Julia Shapiro
‹ Prev 1 2 3 10 Next ›