English
Related papers

Related papers: On Classical and Quantum MDS-Convolutional BCH Cod…

200 papers

Quantum data-syndrome (QDS) codes are a class of quantum error-correcting codes that protect against errors both on the data qubits and on the syndrome itself via redundant measurement of stabilizer group elements. One way to define a QDS…

Quantum Physics · Physics 2025-08-08 Eren Guttentag , Andrew Nemec , Kenneth R. Brown

MDS convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper we introduce a class of MDS convolutional codes whose column distances reach the generalized…

Rings and Algebras · Mathematics 2007-07-16 Heide Gluesing-Luerssen , Joachim Rosenthal , Roxana Smarandache

We consider classical-quantum (cq-)channels with memory, and establish that Ar{\i}kan-constructed polar codes achieve the classical capacity for two key noise models, namely for (i) qubit erasures and (ii) unital qubit noise with channel…

Quantum Physics · Physics 2025-12-03 Jaswanthi Mandalapu , Vikesh Siddhu , Krishna Jagannathan

We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…

Information Theory · Computer Science 2007-11-14 Kenza Guenda

BCH codes are important error correction codes, widely utilized due to their robust algebraic structure, multi-error correcting capability, and efficient decoding algorithms. Despite their practical importance and extensive study, their…

Information Theory · Computer Science 2026-03-11 Run Zheng , Nung-Sing Sze , Zejun Huang

In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and…

Information Theory · Computer Science 2013-01-01 Morgan Barbier , Clément Pernet , Guillaume Quintin

We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…

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

In this paper, we present two new ways of quantum synchronization coding based on the $(\bm{u}+\bm{v}|\bm{u}-\bm{v})$ construction and the product construction respectively, and greatly enrich the varieties of available quantum…

Quantum Physics · Physics 2019-07-22 Lan Luo , Zhi Ma , Dongdai Lin

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

BCH and LCD cyclic codes of length $n=\lambda(q^m+1)$ with $\lambda\mid q-1$ are studied. A complete characterization of $q$-cyclotomic cosets modulo $n$ is given: Theorem \ref{th4} provides a necessary and sufficient condition for any…

Information Theory · Computer Science 2026-03-11 Jinle Liu , Hongfeng Wu , Li Zhu

We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…

Quantum Physics · Physics 2023-11-27 Markus Grassl , Thomas Beth , Martin Roetteler

Quantum error correction is rapidly seeing first experimental implementations, but there is a significant gap between asymptotically optimal error-correcting codes and codes that are experimentally feasible. Quantum LDPC codes range from…

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

Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…

Quantum Physics · Physics 2024-09-09 Jing-Lei Xia

Given any two classical codes with parameters $[n_1,k,d_1]$ and $[n_2,k,d_2]$, we show how to construct a quantum subsystem code in 2-dimensions with parameters $[[N,K,D]]$ satisfying $N\le 2n_1n_2$, $K=k$, and $D=\min(d_1,d_2)$. These…

Quantum Physics · Physics 2019-05-29 Theodore J. Yoder

BCH codes have been studied for over fifty years and widely employed in consumer devices, communication systems, and data storage systems. However, the dimension of BCH codes is settled only for a very small number of cases. In this paper,…

Information Theory · Computer Science 2016-08-11 Hao Liu , Cunsheng Ding , Chengju Li

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

Information Theory · Computer Science 2008-06-02 Eric Z. Chen

BCH codes form an important subclass of cyclic codes, and are widely used in compact discs, digital audio tapes and other data storage systems to improve data reliability. As far as we know, there are few results on $q$-ary BCH codes of…

Information Theory · Computer Science 2024-01-29 Yuqing Fu , Hongwei Liu

We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We…

Information Theory · Computer Science 2013-12-18 Alain Couvreur , Nicolas Delfosse , Gilles Zémor

Several quantum and classical Monte Carlo algorithms for Betti Number Estimation (BNE) on clique complexes have recently been proposed, though it is unclear how their performances compare. We review these algorithms, emphasising their…

‹ Prev 1 3 4 5 6 7 10 Next ›