English
Related papers

Related papers: Nonbinary Quantum Reed-Muller Codes

200 papers

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$. We obtain their weight…

Quantum Physics · Physics 2020-07-01 Felix Huber , Markus Grassl

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

Entanglement-assisted quantum error-correcting codes (EAQECCs) to desired rate, error-correcting capability and maximum shared entanglement are constructed. Thus for a required rate $R$, required error-correcting capability to correct $t$…

Information Theory · Computer Science 2019-03-05 Ted Hurley , Donny Hurley , Barry Hurley

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

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

We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…

Information Theory · Computer Science 2012-05-28 Gladys Chalom , Raul Antônio Ferraz , Marinês Guerreiro , César Polcino Milies

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

Information Theory · Computer Science 2024-12-19 Tushar Bag , Hai Q Dinh , Daniel Panario

A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…

Quantum Physics · Physics 2011-01-11 Hiroaki Terashima , Masahito Ueda

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

The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality…

Information Theory · Computer Science 2023-05-16 Xiaojing Chen , Xingbo Lu , Shixin Zhu , Wan Jiang , Xindi Wang

One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…

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

In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…

Information Theory · Computer Science 2024-01-31 Grégory Berhuy

In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…

Information Theory · Computer Science 2009-04-30 Yanling Chen , Han Vinck

There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper,…

Information Theory · Computer Science 2021-12-14 Lin Sok

We extend the stabilizer formalism to a class of non-additive quantum codes which are constructed from non-linear classical codes. As an example, we present infinite families of non-additive codes which are derived from Goethals and…

Quantum Physics · Physics 2009-05-24 Markus Grassl , Martin Roetteler

This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…

Quantum Physics · Physics 2015-07-07 Avaz Naghipour , Mohammad Ali Jafarizadeh , Sedaghat Shahmorad

A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed…

Quantum Physics · Physics 2014-10-10 A. Naghipour , M. A. Jafarizadeh , S. Shahmorad

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

In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which…

Quantum Physics · Physics 2009-11-13 Dan Hu , Weidong Tang , Meisheng Zhao , Qing Chen , Sixia Yu , C. H. Oh

After a brief introduction to both quantum computation and quantum error correction, we show how to construct quantum error-correcting codes based on classical BCH codes. With these codes, decoding can exploit additional information about…

Quantum Physics · Physics 2011-10-20 Markus Grassl , Willi Geiselmann , Thomas Beth