English
Related papers

Related papers: Quasi-Cyclic Constructions of Quantum Codes

200 papers

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

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

We consider codes over the two semi-local non-unital rings of order six, \[ H_{23} = \langle a,b \mid 2a=0, 3b = 0, a^2=a, b^2 = 0, ab = 0 = ba \rangle,\] and \[H_{32} = \langle a,b \mid 2a=0, 3b = 0, a^2=0, b^2 = b, ab = 0 = ba \rangle. \]…

Rings and Algebras · Mathematics 2025-08-25 Altaf Alshuhail

We introduce quasi-cyclic codes of index 1.5, construct such codes in terms of polynomials and matrices; and prove that the quasi-cyclic codes of index 1.5 are asymptotically good.

Information Theory · Computer Science 2015-05-12 Yun Fan , Hualu Liu

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

Construction of quantum codes and entanglement-assisted quantum codes with good parameters via classical codes is an important task for quantum computing and quantum information. In this paper, by a family of one-generator quasi-cyclic…

Information Theory · Computer Science 2020-09-08 Jingjie Lv , Ruihu Li , Yu Yao

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite…

Information Theory · Computer Science 2025-04-17 Xiaoqiang Wang , Liuyi Li , Yansheng Wu , Dabin Zheng , Shuxian Lu

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

This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…

Information Theory · Computer Science 2025-04-22 Kanat Abdukhalikov , Tushar Bag , Daniel Panario

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

Bicyclic codes are a generalization of the one dimensional (1D) cyclic codes to two dimensions (2D). Similar to the 1D case, in some cases, 2D cyclic codes can also be constructed to guarantee a specified minimum distance. Many aspects of…

Quantum Physics · Physics 2024-04-08 Sankara Sai Chaithanya Rayudu , Pradeep Kiran Sarvepalli

A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal…

Information Theory · Computer Science 2013-12-10 Vladimir D. Tonchev

We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…

Information Theory · Computer Science 2020-04-28 Martianus Frederic Ezerman , San Ling , Buket Özkaya , Patrick Solé

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…

Information Theory · Computer Science 2022-11-01 Meng Cao

In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…

Information Theory · Computer Science 2025-06-03 Puyin Wang , Jinquan Luo

This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of…

Information Theory · Computer Science 2019-03-13 Fatma-Zahra Benahmed , Kenza Guenda , Aicha Batoul , T. Aaron Gulliver

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 introduce quaternary modified four $\mu$-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $\mu$-circulant Hermitian self-dual codes. We also construct quaternary modified…

Information Theory · Computer Science 2024-01-30 Masaaki Harada

We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form $p=4n\pm1$. The proposed Type-I stabilizer codes are of cyclic structure and code length $N=p$. They…

Information Theory · Computer Science 2014-08-01 Yixuan Xie , Jinhong Yuan , Qifu , Sun

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian…

Information Theory · Computer Science 2014-03-12 Bocong Chen , San Ling , Guanghui Zhang

Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.

Quantum Physics · Physics 2009-11-06 A. Ashikhmin , S. Litsyn , M. A. Tsfasman