English
Related papers

Related papers: New Quantum MDS Codes with Flexible Parameters fro…

200 papers

MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…

Information Theory · Computer Science 2022-10-04 Ruhao Wan , Yang Li , Shixin Zhu

We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…

Quantum Physics · Physics 2009-10-30 Richard Cleve

Let $C$ be a $(n,q^{2k},n-k+1)_{q^2}$ additive MDS code which is linear over ${\mathbb F}_q$. We prove that if $n \geqslant q+k$ and $k+1$ of the projections of $C$ are linear over ${\mathbb F}_{q^2}$ then $C$ is linear over ${\mathbb…

Information Theory · Computer Science 2020-12-14 Simeon Ball , Guillermo Gamboa , Michel Lavrauw

Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…

Information Theory · Computer Science 2024-11-12 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang

In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…

Information Theory · Computer Science 2020-01-07 Jingjie Lv , Ruihu Li , Junli Wang

We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed…

Information Theory · Computer Science 2014-01-17 Son Hoang Dau , Wentu Song , Chau Yuen

For a linear code $C$ over a finite field, if its dual code $C^{\perp}$ is equivalent to itself, then the code $C$ is said to be {\it isometry-dual}. In this paper, we first confirm a conjecture about the isometry-dual MDS elliptic codes…

Information Theory · Computer Science 2025-02-05 Yunlong Zhu , Chang-An Zhao

We consider Majorana fermion stabilizer codes with small number of modes and distance. We give an upper bound on the number of logical qubits for distance $4$ codes, and we construct Majorana fermion codes similar to the classical Hamming…

Quantum Physics · Physics 2017-03-03 M. B. Hastings

In this article, the effective lengths of all $q^r$-divisible linear codes over $\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that…

Combinatorics · Mathematics 2020-01-31 Michael Kiermaier , Sascha Kurz

In this paper, we give a constructive proof to show that if there exist a classical linear code C is a subset of F_q^n of dimension k and a classical linear code D is a subset of F_q^k^m of dimension s, where q is a power of a prime number…

Quantum Physics · Physics 2024-07-19 Bulent Sarac , Damla Acar

We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…

Information Theory · Computer Science 2020-07-30 Tristram Bogart , Anna-Lena Horlemann-Trautmann , David Karpuk , Alessandro Neri , Mauricio Velasco

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2016-06-24 Hongxi Tong , Xiaoqing Wang

Recently Haah introduced a new quantum error correcting code embedded on a cubic lattice. One of the defining properties of this code is the absence of string logical operator. We present new codes with similar properties by relaxing the…

Quantum Physics · Physics 2012-02-02 Isaac H. Kim

We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…

Quantum Physics · Physics 2017-03-28 Dave Bacon , Steven T. Flammia , Aram W. Harrow , Jonathan Shi

Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for GF(q)-linear subsystem codes. It follows that no subsystem code over a prime field…

Quantum Physics · Physics 2009-11-13 Andreas Klappenecker , Pradeep Kiran Sarvepalli

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 study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in…

Quantum Physics · Physics 2008-02-19 Jim Harrington , John Preskill

Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes…

Information Theory · Computer Science 2020-11-12 Tingting Chen , Xiande Zhang

In this paper, we completely determine the number of solutions to $ \operatorname{Tr}^{q^2}_q(bx+b)+c=0, x\in \mu_{q+1}\backslash \{-1\}$ for all $b\in \mathbb{F}_{q^2}, c\in\mathbb{F}_{q}$. As an application, we can give the weight…

Information Theory · Computer Science 2023-04-11 Wei Lu , Xia Wu

Let $\mathbb{F}_{q}$ denote the finite field of order $q,$ let $m_1,m_2,\cdots,m_{\ell}$ be positive integers satisfying $\gcd(m_i,q)=1$ for $1 \leq i \leq \ell,$ and let $n=m_1+m_2+\cdots+m_{\ell}.$ Let…

Commutative Algebra · Mathematics 2017-07-18 Anuradha Sharma , Varsha Chauhan , Harshdeep Singh