Quasi-Cyclic Codes of Index 2

• Quasi-cyclic codes of index 2 are linear codes invariant under m-position cyclic shifts, offering a rich polynomial and module structure.
• They admit canonical generator matrices and CRT-based decompositions that enable explicit construction and effective minimum distance analysis.
• These codes achieve optimal performance in quantum error correction and cryptography by satisfying explicit duality, self-orthogonality, and LCD conditions.

A quasi-cyclic code of index 2 over a finite field $\mathbb{F}_q$ is a linear code of length $2m$ which is invariant under a cyclic shift by $m$ positions, or equivalently, under the action of the shift $T^2$. These codes generalize cyclic codes (index 1), possess a rich polynomial and module-theoretic structure, and serve as a central object in finite geometry and information theory. They admit canonical generator descriptions, strong algebraic invariants, optimality results for quantum and cryptographic applications, and robust methods for minimum distance analysis and explicit construction.

1. Algebraic and Module Structure

Quasi-cyclic codes of index 2 are defined as $\mathbb{F}_q$-linear subspaces $C \subseteq \mathbb{F}_q^{2m}$ invariant under the $m$-position cyclic shift. More precisely:

• The ambient space $\mathbb{F}_q^{2m}$ is identified with pairs of polynomials $(a(x), b(x))$, each of degree $< m$, via the map $c \mapsto (a(x), b(x))$ where $a(x) = \sum_{i=0}^{m-1} c_{i,0} x^i$ and $b(x) = \sum_{i=0}^{m-1} c_{i,1} x^i$ (Abdukhalikov et al., 1 Apr 2025, Abdukhalikov et al., 21 Apr 2025).
• The polynomial ring $R = \mathbb{F}_q[x]/(x^m-1)$ gives $R^2$ the structure of a module, and the code $C$ is realized as an $R$-submodule of $R^2$.
• There is a one-to-one correspondence between submodules $N \subseteq R^2$ and left ideals $I \subseteq M_2(R)$; every such left ideal is principal (Barbier et al., 2011).
• The canonical generator matrix form is $$G(x) = \begin{pmatrix} g_{11}(x) & g_{12}(x) \ 0 & g_{22}(x) \end{pmatrix}$$, with $g_{11}$ and $g_{22}$ monic divisors of $x^m-1$ and $\deg g_{12} < \deg g_{22}$ (Abdukhalikov et al., 1 Apr 2025). Every index-2 QC code is generated by at most two elements.

2. Generator Polynomials, Matrix Representations, and CRT Decomposition

The generator description and decomposition facilitate both structural analysis and computations:

• Description: $C = \langle (g_{11}, g_{12}), (0, g_{22}) \rangle$, with constraints $g_{11}(x), g_{22}(x) \mid x^m-1$, $g_{11}g_{22} \mid (x^m-1)g_{12}$ (Abdukhalikov et al., 1 Apr 2025, Abdukhalikov et al., 12 Apr 2025). In the one-generator case, $C = \langle (g_{11}, g_{12}) \rangle$ iff $g_{11}g_{22} \mid x^m-1$ (Abdukhalikov et al., 1 Apr 2025).
• Matrix form: The standard generator matrix consists of two block-circulant blocks corresponding to the polynomials $g_{11}(x)$ and $g_{22}(x)$, with cross-block $g_{12}(x)$.
• CRT decomposition: Given $x^m-1 = \prod f_i(x)$ (irreducible), $R \cong \bigoplus \mathbb{F}_{q^{e_i}}$, so $R^2 \cong \bigoplus_i (\mathbb{F}_{q^{e_i}}^2)$. The code splits into length-2 constituents, allowing analysis via constituent codes $C_i \subseteq \mathbb{F}_{q^{e_i}}^2$ (Güneri et al., 2020, Abdukhalikov et al., 21 Apr 2025).

3. Duality, Self-Orthogonality, and LCD Structure

Dual codes with respect to Euclidean, Hermitian, and symplectic forms have explicit generator descriptions:

• Euclidean dual: If $C = \langle (g_{11}, g_{12}), (0, g_{22}) \rangle$, then $C^{\perp_E}$ is generated by:

$$(\, x^m(x^m-1)g_{22}^\circ/(g_{11}g_{22}), \ 0 \,), \quad (\, -x^m(x^m-1)g_{12}^\circ/(g_{11}g_{22}),\ x^m(x^m-1)g_{11}^\circ/(g_{11}g_{22})\,)$$

where $f^\circ(x)$ is the reciprocal polynomial (Abdukhalikov et al., 1 Apr 2025).

• Hermitian dual and symplectic dual: Analogous explicit forms are available, using Frobenius-conjugate and sign adjustments (Abdukhalikov et al., 12 Apr 2025, Galindo et al., 2017).
• LCD conditions: Polynomial conditions for $C$ to be LCD (complementary dual) are fourfold—requiring self-reciprocity, relative primitivity, and coprimality constraints among generators—extending Yang–Massey’s cyclic LCD condition (Abdukhalikov et al., 12 Apr 2025).
• Self-orthogonality: Sufficient and necessary conditions for $C \subseteq C^{\perp}$ are based on divisibility relations among the generator polynomials and their adjoints (Abdukhalikov et al., 1 Apr 2025, Galindo et al., 2017).

4. Minimum Distance and Weight Bounds

Robust lower bounds on minimum distance and symplectic weights are available:

• For $C = \langle (g_{11}, g_{12}), (0, g_{22}) \rangle$,

$$d(C) \ge \min \left\{ d(C_2),\ d(C_4),\ d(C_1) + d(C_3) \right\}$$

with $C_1 = \langle g_{11} \rangle$, $C_2 = \langle g_{22} \rangle$, $C_3 = \langle \gcd(g_{12}, g_{22}) \rangle$, $C_4 = \langle (x^m-1)/\gcd(g_{12}, g_{22}) \rangle$ (Abdukhalikov et al., 1 Apr 2025, Galindo et al., 2017).

• Symplectic distance admits analogous bounds, enabling quantum code constructions (Galindo et al., 2017).
• BCH-like, spectral, and Jensen concatenated bounds are available via the constituent decomposition (Güneri et al., 2020).

5. Asymptotic Goodness and Explicit Construction Methods

Quasi-cyclic codes of index 2 are asymptotically good and attain Gilbert–Varshamov bounds:

• Fan–Lin’s theorem: For suitable choices of $m$, for any $0 < \delta < 1-1/q$, there exist infinite families of QC index-2 codes with rate $R=1/2$ and relative minimum distance $\delta$ passing the GV threshold $g_q(\delta) = 1-H_q(\delta)$ (Fan et al., 2022). This matches random linear codes.
• Construction: One-generator codes $C_{a,b} = \{ (f a, f b) : f \in R \}$ deliver explicit rate and minimum-distance control (Fan et al., 2022).
• Enumeration: The number of index-2 QC subcodes in a cyclic code is combinatorially determined by field-invariance and subspace counting over maximal subfields, with closed-form formulas available in special cases (Belfiore et al., 2016).
• Polynomial construction methods for LCP (linear complementary pairs) and LCD codes: Polynomial matrices and CRT block-by-block independence checks provide systematic criteria (Abdukhalikov et al., 21 Apr 2025, Abdukhalikov et al., 12 Apr 2025).

6. Quantum Codes and Cryptographic Applications

Index-2 QC codes have substantial impact in quantum coding theory and cryptography:

• Quantum stabilizer codes: Symplectic self-orthogonal QC codes yield stabilizer quantum codes via CSS construction, often surpassing the best-known quantum GV bounds (examples: binary codes [[151,106,8]]$_2$, [[73,52,7]]$_2$, ternary [[160,140,5]]$_3$) (Galindo et al., 2017).
• LCD codes for side-channel resistance: LCD index-2 QC codes constructed via the explicit polynomial criteria provide efficient cryptographic countermeasures and side-channel masking, with optimal or near-optimal security parameters $d_{LCP} = \min\{d(C), d(D^\perp)\}$ relative to the best-known classical codes (Abdukhalikov et al., 21 Apr 2025, Abdukhalikov et al., 12 Apr 2025).
• Construction methods: Explicit generator and parity-check matrices, Smith normal form decomposition (classical and skew case), and polynomial toolkit enable scalable realization over diverse fields and lengths (Bossaller et al., 11 Feb 2025).

7. Special Constructions, BCH and Evaluation Codes, Decoding Algorithms

Special classes and practical algorithms within QC index-2 theory:

• Quasi-BCH codes: 2-quasi-cyclic analogues of BCH codes are constructed using matrix roots of unity in $M_2(F_{q^s})$, with minimum block distance at least $\delta$, and syndrome-based decoding up to $\lfloor(\delta-1)/2\rfloor$ block errors (key-equation method) (Barbier et al., 2011).
• Quasi-evaluation codes: For $m = q^2-1$, using $A \in M_2(F_q)$ as a matrix root of unity and folding Reed–Solomon evaluations into index 2 delivers codes of parameters $[2m,2k, \geq m-k+1]$ (Barbier et al., 2011).
• Skew QC codes: Noncommutative generalizations (with automorphism $\sigma$) preserve module structure and admit a Smith normal form classification, paralleling the commutative case (Bossaller et al., 11 Feb 2025).

Table: Algebraic Invariants of QC Codes of Index 2

Invariant	Description	Reference
Generator matrix	$$G(x) = \begin{pmatrix} g_{11} & g_{12} \ 0 & g_{22} \end{pmatrix}$$	(Abdukhalikov et al., 1 Apr 2025)
Code dimension	$2m - \deg g_{11} - \deg g_{22}$	(Abdukhalikov et al., 1 Apr 2025)
One-generator criterion	$g_{11}g_{22} \mid x^m-1$ or $g_{11}g_{22}\equiv 0 \pmod{x^m-1}$	(Abdukhalikov et al., 1 Apr 2025)
Minimum distance bound	$d(C) \ge \min\{d(C_2), d(C_4), d(C_1)+d(C_3)\}$	(Abdukhalikov et al., 1 Apr 2025)
Dual code generators	Explicit polynomials derived via reciprocal/transposed forms	(Abdukhalikov et al., 1 Apr 2025)
Asymptotic rate	$1/2$ (GV-bound attainable with $\delta<1-1/q$)	(Fan et al., 2022)
LCP criterion	Polynomial coprimality and coverage/block-by-block independence checks	(Abdukhalikov et al., 21 Apr 2025)

Quasi-cyclic codes of index 2 offer deep algebraic structure, canonical module-theoretic representations, and optimal code parameters for both classical and quantum error correction, as well as cryptographic resistance techniques. Their classification, construction, and performance bounds are determined by polynomial generator matrices, constituent-wise decomposition, and explicit duality criteria, with ongoing research expanding their applications in quantum information and secure communication systems.