Additive Conjucyclic Codes over $\F_{q^2}$: Trace Correspondence and Applications to Quantum Codes

1. Problem Statement

Additive codes over $\mathbb{F}_{q^2}$ are crucial for constructing quantum error-correcting codes (QECCs). While additive cyclic codes (invariant under standard cyclic shifts) have been extensively studied, their conjugate counterparts, additive conjucyclic codes (invariant under conjugated cyclic shifts), remain under-explored, particularly over general finite fields $\mathbb{F}_{q^2}$.

The primary challenges identified in the literature are:

• Lack of Unified Theory: Existing studies on conjucyclic codes are mostly confined to the quaternary case ($\mathbb{F}_4$) or specific rings. There is no systematic algebraic framework for general $q$.
• Structural Complexity: Unlike linear cyclic codes, additive conjucyclic codes do not admit a canonical polynomial representation, making their structural analysis, enumeration, and generator matrix construction difficult.
• Dual Structure: Standard inner products (Euclidean or symplectic) are ill-suited for additive codes because they are not compatible with the $F_q$-linearity required for the dual structure of these codes.

2. Methodology

The authors develop a unified framework by establishing a bridge between the complex structure of additive conjucyclic codes and the well-understood theory of linear cyclic codes.

A. Trace-Based Isomorphism

The core methodology involves defining an $\mathbb{F}_q$-linear isomorphism $\Psi_\beta$ between the vector space $\mathbb{F}_{q^2}^n$ and $\mathbb{F}_q^{2n}$.

• Mapping: For a fixed primitive element $\beta \in \mathbb{F}_{q^2}$, the map $\phi_\beta: \mathbb{F}_{q^2} \to \mathbb{F}_q^2$ is defined as $\phi_\beta(\alpha) = (\text{Tr}(\beta\alpha), \text{Tr}(\bar{\beta}\alpha))$, where $\text{Tr}$ is the trace map and $\bar{\alpha} = \alpha^q$ is the conjugation.
• Extension: This is extended component-wise to $\Psi_\beta: \mathbb{F}_{q^2}^n \to \mathbb{F}_q^{2n}$.
• Key Property: The authors prove that $\Psi_\beta$ commutes with the shift operators. Specifically, the conjugated cyclic shift ($T$) on $\mathbb{F}_{q^2}^n$ corresponds exactly to the standard cyclic shift ($\sigma$) on $\mathbb{F}_q^{2n}$.
  $$\Psi_\beta(T(\mathbf{c})) = \sigma(\Psi_\beta(\mathbf{c}))$$

B. Alternating Inner Product

To address the dual structure, the authors introduce a new alternating inner product on $\mathbb{F}_{q^2}^n$:
$$\langle \mathbf{u}, \mathbf{v} \rangle_{a,\beta} = (\bar{\beta}^2 - \beta^2) \sum_{i=0}^{n-1} (u_i \bar{v}_i - \bar{u}_i v_i)$$
They demonstrate that this product is non-degenerate, $\mathbb{F}_q$-bilinear, and alternating. Crucially, they prove that $\Psi_\beta$ preserves orthogonality between this new alternating product and the symplectic inner product on $\mathbb{F}_q^{2n}$.

3. Key Contributions

1. Algebraic Correspondence and Enumeration

• Theorem: There is a bijective correspondence between $q^2$-ary additive conjucyclic codes of length $n$ and $q$-ary linear cyclic codes of length $2n$.
• Enumeration: By leveraging the factorization of $x^{2n}-1$ over $\mathbb{F}_q$, the authors derive the exact number of distinct additive conjucyclic codes. If $x^{2n}-1 = \prod g_i(x)^{p^\ell}$, the number of such codes is $(p^\ell + 1)^t$, where $t$ is the number of distinct irreducible factors.
• Generator Matrices: Explicit forms for generator matrices are provided. A generator matrix for an additive conjucyclic code is constructed by applying the inverse isomorphism $\Psi_\beta^{-1}$ to the rows of the generator matrix of the corresponding cyclic code, followed by conjugated cyclic shifts.

2. Dual-Containing Conditions

• The paper characterizes the condition under which an additive conjucyclic code contains its alternating dual ($C^{\perp_a} \subseteq C$).
• Using the correspondence, this condition is translated to the symplectic dual-containing condition of the associated cyclic code ($D^{\perp_s} \subseteq D$).
• Explicit parity-check matrices (generator matrices of the dual) are derived using the reciprocal polynomial of the cyclic code's generator.

3. Quantum Code Construction

• The authors provide a direct construction method for $q$-ary QECCs from dual-containing additive conjucyclic codes.
• Result: If $C$ is an $(n, M=q^k, d)$ additive conjucyclic code with $C^{\perp_a} \subseteq C$, it yields a pure quantum code with parameters $[[n, k-n, \ge d]]_q$.

4. Results and Examples

• Generalization: The framework generalizes previous results on quaternary ($\mathbb{F}_4$) codes to arbitrary $\mathbb{F}_{q^2}$.
• Flexibility: Unlike previous constructions that often resulted in repeated-root cyclic codes (which are asymptotically inferior), this method allows for both simple-root and repeated-root cyclic codes depending on the factorization of $x^{2n}-1$, offering better asymptotic potential.
• Illustrative Example:
  • Parameters: $q=4, n=11$ (Codes over $\mathbb{F}_{16}$).
  • Code: An additive conjucyclic code generated by a specific divisor of $x^{22}-1$.
  • Outcome: The construction yields a pure $[[11, 1, 5]]_4$ QECC.
  • Significance: This code exceeds the quantum Gilbert–Varshamov bound, improves upon previously known codes in the literature, and is optimal according to Grassl's tables.
  • Efficiency: Unlike optimal stabilizer codes found in tables which lack algebraic structure (requiring large storage), this code possesses a cyclic generator matrix, significantly reducing memory requirements for implementation.

5. Significance

This paper fills a critical gap in coding theory by providing the first systematic algebraic theory for additive conjucyclic codes over general finite fields. Its significance lies in:

1. Unification: It unifies the study of these codes with classical cyclic codes via a trace isomorphism, simplifying complex structural analysis.
2. Quantum Applications: It offers a robust, algebraic method for constructing non-binary quantum error-correcting codes with optimal or near-optimal parameters.
3. Practicality: The derived codes possess cyclic structures, making them efficient for encoding and decoding (via shift registers) and storage, addressing a major bottleneck in practical quantum communication systems.