English
Related papers

Related papers: Two new classes of quantum MDS codes from generali…

200 papers

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

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

In this paper, we present three new classes of $q$-ary quantum MDS codes utilizing generalized Reed-Solomon codes satisfying Hermitian self-orthogonal property. Among our constructions, the minimum distance of some $q$-ary quantum MDS codes…

Information Theory · Computer Science 2019-09-18 Xiaolei Fang , Jinquan Luo

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

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

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

It has been a great challenge to construct new quantum MDS codes. In particular, it is very hard to construct quantum MDS codes with relatively large minimum distance. So far, except for some sparse lengths, all known $q$-ary quantum MDS…

Information Theory · Computer Science 2020-07-14 Lingfei Jin , Chaoping Xing

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

We construct quantum MDS codes with parameters $ [\![ q^2+1,q^2+3-2d,d ]\!] _q$ for all $d \leqslant q+1$, $d \neq q$. These codes are shown to exist by proving that there are classical generalised Reed-Solomon codes which contain their…

Quantum Physics · Physics 2021-01-15 Simeon Ball

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

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we…

Information Theory · Computer Science 2014-05-22 Liqi Wang , Shixin Zhu

Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2015-11-06 Baokun Ding , Tao Zhang , Gennian Ge

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

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

Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new quantum MDS codes of the form $q=2am+t$,…

Information Theory · Computer Science 2018-03-22 Liangdong Lu , Wenping Ma , Ruihu Li , Yuena Ma , Luobin Guo

Maximum Distance Separable (MDS) self-dual codes are of significant theoretical and practical importance. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Correspondingly there have been many research on constructions…

Information Theory · Computer Science 2026-02-09 Chun'e Zhao , Wenping Ma

Recently, the construction of new MDS Euclidean self-dual codes has been widely investigated. In this paper, for square q, we utilize generalized Reed-Solomon (GRS) codes and their extended codes to provide four generic families of q-ary…

Information Theory · Computer Science 2021-10-28 Ziteng Huang , Weijun Fang , Fang-Wei Fu

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

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

Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as communication systems, data storage, quantum codes, and so on. So…

Information Theory · Computer Science 2021-05-19 Yansheng Wu , Jong Yoon Hyun , Yoonjin Lee
‹ Prev 1 2 3 10 Next ›