English
Related papers

Related papers: Quantum Constacyclic BCH Codes over Qudits: A Spec…

200 papers

For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…

Information Theory · Computer Science 2012-12-18 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

We consider two-dimensional $(\lambda_1, \lambda_2)$-constacyclic codes over $\mathbb{F}_{q}$ of area $M N$, where $q$ is some power of prime $p$ with $\gcd(M,p)=1$ and $\gcd(N,p)=1$. With the help of common zero (CZ) set, we characterize…

Information Theory · Computer Science 2025-12-24 Vidya Sagar , Shikha Patel , Ashutosh Singh , Shayan Srinivasa Garani

We propose an architecture of quantum-error-correction-based quantum repeaters that combines techniques used in discrete- and continuous-variable quantum information. Specifically, we propose to encode the transmitted qubits in a…

Quantum Physics · Physics 2021-06-24 Filip Rozpędek , Kyungjoo Noh , Qian Xu , Saikat Guha , Liang Jiang

The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root…

Information Theory · Computer Science 2015-06-10 Alexander Zeh , Markus Ulmschneider

In this paper we investigate the structure of repeated root constacyclic codes of length $2^amp^r$ over $\mathbb{F}_{p^s}$ with $a\geq1$ and $(m,p)=1$. We characterize the codes in terms of their generator polynomials. This provides simple…

Information Theory · Computer Science 2015-05-05 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal…

Information Theory · Computer Science 2016-02-12 Giuliano G. La Guardia

Quantum computing holds transformative potential for various fields, yet its practical application is hindered by the susceptibility to errors. This study makes a pioneering contribution by applying quantum error correction codes (QECCs)…

Quantum Physics · Physics 2024-04-23 Avimita Chatterjee , Debarshi Kundu , Swaroop Ghosh

There are various approaches to long-range quantum communication based on conceptually different forms of quantum repeaters. Here we explore a quantum repeater scheme that employs quantum error correction (QEC) both on the flying (light)…

Quantum Physics · Physics 2025-08-04 Stefan Häussler , Peter van Loock

In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to…

Information Theory · Computer Science 2020-10-15 Ram Krishna Verma , Om Prakash , Ashutosh Singh

A code is called a locally repairable code (LRC) if any code symbol is a function of a small fraction of other code symbols. When a locally repairable code is employed in a distributed storage systems, an erased symbol can be recovered by…

Information Theory · Computer Science 2021-11-25 Wei Zhao , Kenneth W. Shum , Shenghao Yang

Rotation symmetric bosonic codes are an attractive encoding for qubits into oscillator degrees of freedom, particularly in superconducting qubit experiments. While these codes can tolerate considerable loss and dephasing, they will need to…

Quantum Physics · Physics 2024-05-30 Juliette Soule , Andrew C. Doherty , Arne L. Grimsmo

In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…

Information Theory · Computer Science 2018-11-09 Abdullah Dertli , Yasein Cengellenmis , Senol Eren

Encoding quantum information in a quantum error correction (QEC) code offers protection against decoherence and enhances the fidelity of qubits and gate operations. One of the fundamental challenges of QEC is to construct codes with…

Quantum Physics · Physics 2026-05-01 Jasper Johannes Postema , Servaas J. J. M. F. Kokkelmans

CSS codes are a subfamily of stabilizer codes especially appropriate for fault-tolerant quantum computations. A very simple method is proposed to encode a general qudit when a Calderbank-Shor-Steane quantum code, defined over a q-ary…

Quantum Physics · Physics 2007-12-20 Pedro J. Salas

In this paper, new results on convolution of spectral components in binary fields have been presented for combiatorial sequences. A novel method of convolution of DFT points through Chinese Remainder Theorem (CRT) is presented which has…

Information Theory · Computer Science 2019-11-27 Muhammad Asad Khan , Sajid Saleem , Amir A Khan

A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special…

Information Theory · Computer Science 2012-03-13 Alexander Zeh , Antonia Wachter , Sergey Bezzateev

Quantum error correction codes (QECCs) are critical for realizing reliable quantum computing by protecting fragile quantum states against noise and errors. However, limited research has analyzed the noise resilience of QECCs to help select…

Quantum Physics · Physics 2025-04-22 Avimita Chatterjee , Subrata Das , Swaroop Ghosh

Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems. A natural application of such codes occurs within quantum repeater systems which are used to combat…

Quantum Physics · Physics 2024-08-21 Pei-Zhe Li , Josephine Dias , William J. Munro , Peter van Loock , Kae Nemoto , Nicoló Lo Piparo

A locally recoverable code of locality $r$ over $\mathbb{F}_{q}$ is a code where every coordinate of a codeword can be recovered using the values of at most $r$ other coordinates of that codeword. Locally recoverable codes are efficient at…

Information Theory · Computer Science 2024-06-19 Gustavo Terra Bastos , Angelynn Alvarez , Zachary Flores , Adriana Salerno

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

Information Theory · Computer Science 2022-06-06 Ying Zhao