English
Related papers

Related papers: A Construction of MDS Quantum Convolutional Codes

200 papers

Near MDS (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using…

Information Theory · Computer Science 2024-06-17 Shanqi Pang , Chaomeng Zhang , Mengqian Chen , Miaomiao Zhang

We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs…

Information Theory · Computer Science 2025-06-16 Kanat Abdukhalikov , Cunsheng Ding , Gyanendra K. Verma

Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…

Information Theory · Computer Science 2025-01-28 Yang Li , Zhonghua Sun , Shixin Zhu

In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…

Information Theory · Computer Science 2016-10-26 Minjia Shi , Lin Sok , Patrick Solé

In this paper, we present an infinite family of MDS codes over $\mathbb{F}_{2^s}$ and two infinite families of almost MDS codes over $\mathbb{F}_{p^s}$ for any prime $p$, by investigating the parameters of the dual codes of two families of…

Information Theory · Computer Science 2024-11-12 Haojie Xu , Xia Wu , Wei Lu , Xiwang Cao

Let q be a power of 2. We show by representation theory that there exists a q x q unitary matrix of multiplicative order q+1 whose powers generate q+1 pairwise mutually unbiased base in C^q. When q is a power of an odd prime, there is a q x…

Representation Theory · Mathematics 2007-05-23 Rod Gow

Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum…

Information Theory · Computer Science 2015-03-19 Laura Luzzi , Frédérique Oggier

In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid…

Information Theory · Computer Science 2021-12-30 Djoko Suprijanto , Hopein Christofen Tang

The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…

Information Theory · Computer Science 2026-05-29 Haojie Chen , Chuangqiang Hu , Junjie Huang , Chang-An Zhao

I report two general methods to construct quantum convolutional codes for quantum registers with internal $N$ states. Using one of these methods, I construct a quantum convolutional code of rate 1/4 which is able to correct one general…

Quantum Physics · Physics 2007-05-23 H. F. Chau

We present a new propagation rule for CSS codes. Starting with a CSS code $[\![n,k,d]\!]_q$, we construct a CSS code with parameters $[\![n-2,k,d-1]\!]_q$. In general, one would only obtain a code with parameters $[\![n-2,k,d-2]\!]_q$. The…

Quantum Physics · Physics 2023-10-06 Markus Grassl

A family of $\omega$-circulant balanced weighing matrices with classical parameters is used for the construction of optimal constant weight codes over an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd prime power,…

Combinatorics · Mathematics 2023-07-26 Hadi Kharaghani , Thomas Pender , Vladimir D. Tonchev

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

We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer code uses CSS-type quantum Reed-Solomon code and the inner code uses a set of special quantum codes. In the field of…

Quantum Physics · Physics 2009-01-06 Zhuo Li , Li-Juan Xing , Xin-Mei Wang

In this paper, necessary and sufficient conditions for the self-orthogonality of t-generator quasi-cyclic (QC) codes are presented under the Euclidean, Hermitian, and symplectic inner products, respectively. Particularly, by studying the…

Information Theory · Computer Science 2025-08-13 Mengying Gao , Yuhua Sun , Tongjiang Yan , Chun'e Zhao

In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over $\mathbb{F}_q$ with length $q+1$ and designed distance 3 to be 3 and 4 are provided. Let $d$ be the minimum distance of the BCH code…

Information Theory · Computer Science 2023-12-20 Haojie Xu , Xia Wu , Wei Lu , Xiwang Cao

We study Algebraic Geometry codes producing quantum error-correcting codes by the CSS construction. We pay particular attention to the family of Castle codes. We show that many of the examples known in the literature in fact belong to this…

Information Theory · Computer Science 2016-06-30 Carlos Munuera , Wanderson Tenório , Fernando Torres

Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial…

Information Theory · Computer Science 2022-07-26 Jiaxin Wang , Zexia Shi , Yadi Wei , Fang-Wei Fu

A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…

Information Theory · Computer Science 2009-01-12 Eric Z. Chen

Maximum-distance separable (MDS) convolutional codes are characterized by the property that their free distance reaches the generalized Singleton bound. In this paper, new criteria to construct MDS convolutional codes are presented.…

Information Theory · Computer Science 2023-05-26 Zita Abreu , Julia Lieb , Raquel Pinto , Joachim Rosenthal