SearcharxivSearch

arXiv · 2609.14434

Hermitian Duality and Syndrome Structure of CSS-Type Codes over the ring $\mathbb{Z}_q[i]$

Abstract

We study the algebraic structure of principal ideal codes and CSS-type stabilizer constructions over the ring $ R_q=\mathbb Z_q[i],$ where every prime divisor of $q$ is congruent to $1$ modulo $4$. Although such ring-based constructions have recently been considered in the context of classical and quantum error correction, the precise relationship among principal ideal cardinalities, Hermitian duality, algebraic cosets, and stabilizer syndromes requires further structural analysis. We obtain cardinality formulas for principal ideals and their annihilators. For a length-one principal ideal code $C=\langleα\rangle$, we show that its Hermitian dual is $ C^{\perp_H}=\operatorname{Ann}(σ(α)). $ For nested codes satisfying $ C_2^{\perp_H}\subseteq C_1\subseteq C_2, $ we determine the corresponding CSS-type stabilizer and prove that the kernel of the physical $X$-error syndrome map is $ \ker(\operatorname{Syn}_X)=C_2. $ Consequently, $C_2/C_1$ parametrizes logical $X$-operator classes and $R_q^n/C_2$ parametrizes physical $X$-error syndrome classes. Using this syndrome quotient, we construct a transversal of $C_2$ in $R_q^n$ whose elements have pairwise distinct physical $X$-error syndromes. The corresponding $X$-type error family is correctable by stabilizer syndrome measurement, yielding a syndrome-based recovery procedure that is consistent with the stabilizer structure. Explicit examples illustrate the resulting duality, cardinality, and syndrome structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akanksha Tiwari, Ritumoni Sarma. 2026-09-13. Hermitian Duality and Syndrome Structure of CSS-Type Codes over the ring $\mathbb{Z}_q[i]$. https://arxiv.org/abs/2609.14434

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