Search arXivSearch

arXiv · 2412.13616

Quantum Codes from Group Codes

Abstract

We study linear codes and quantum error-correcting codes (QECCs) constructed from group rings over finite fields. Using the algebraic structure of group rings, we give a single framework for codes over several group structures, including cyclic, dihedral, direct-product, and semidirect-product groups. We establish necessary and sufficient conditions for these group codes to be self-orthogonal under the Euclidean, Hermitian, and symplectic inner products. We show that non-isomorphic groups of the same order can generate inequivalent codes with distinct parameters, and we support this with explicit computational comparisons. Using these structural results, we give explicit constructions of quantum codes and provide new examples that match or improve upon the best known parameters. In particular, we describe explicit block-matrix forms of the generating matrices for dihedral and direct-product groups, and we use a Kronecker-product construction to obtain an infinite family of self-orthogonal group codes together with the corresponding QECCs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tushar Bag, Daniel Panario. 2026-07-11. Quantum Codes from Group Codes. https://arxiv.org/abs/2412.13616

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