Search arXivSearch

arXiv · 2609.22503

Optimal Pure Quantum $(r,δ)$-LRCs from Euclidean and Hermitian Dual-Containing Cyclic Codes

Abstract

Locally recoverable codes (LRCs) combine global error correction with the ability to repair a small number of erased coordinates by accessing only a limited number of other coordinates. Motivated by their quantum counterparts, we construct several families of optimal cyclic $(r,δ)$-LRCs that are Euclidean or Hermitian dual-containing. In the Euclidean case, we obtain four families of optimal dual-containing cyclic $(r,δ)$-LRCs over $\mathbb{F}_q$ with a range of minimum distances extending beyond the local distance $δ$. In the Hermitian case, we derive analogous families over $\mathbb{F}_{q^2}$ that are Hermitian dual-containing, when $(r+δ-1)\mid(q^2-1)$. In addition, we develop a distinct construction for the case $(r+δ-1)\mid(q^2+1)$ using symmetric defining sets and odd $δ$, which yields optimal codes with minimum distances $\ell+2$, $δ+2$, $2δ-2$, and $2δ$. The Euclidean Calderbank-Shor-Steane (CSS) and Hermitian stabilizer constructions then give corresponding quantum cyclic $(r,δ)$-LRCs over~$\mathbb{F}_q$. Further, the resulting stabilizer codes are pure; they meet the relevant quantum Singleton-type bound, and are therefore \textit{optimal}. We also provide a comparison with previous works, highlighting the parameter regimes and minimum distance ranges covered by our results that are not attained by existing constructions. Explicit examples illustrate the constructions and verify the dual-containment and purity conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Astha Agrawal, Shayan Srinivasa Garani. 2026-09-18. Optimal Pure Quantum $(r,δ)$-LRCs from Euclidean and Hermitian Dual-Containing Cyclic Codes. https://arxiv.org/abs/2609.22503

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT