Quantum MDS codes from complements of unions of finite-field subsets

Technical Summary: Quantum MDS Codes from Complements of Unions of Finite-Field Subsets

Problem Statement
The construction of quantum maximum-distance-separable (MDS) codes with minimum distances exceeding $q/2 + 1$ for lengths $n > q+1$ remains a significant challenge in quantum coding theory. While the Hermitian construction reduces this problem to finding classical Hermitian self-orthogonal Generalized Reed–Solomon (GRS) codes over $\mathbb{F}_{q^2}$, existing methods based on trace maps, linear transformations, and cosets of multiplicative subgroups often face limitations in the attainable minimum distances for specific code lengths. Specifically, there is a need for new constructions that yield quantum MDS codes with strictly larger minimum distances than those obtainable from previously known families, either directly or via the propagation rule.

Methodology
The authors propose a unified framework for constructing Hermitian self-orthogonal GRS codes by utilizing complements of unions of subsets of $\mathbb{F}_{q^2}$ (or $\mathbb{F}_{q^2}^*$) as locator sets.

1. Theoretical Framework:

   • Let $X \in \{\mathbb{F}_{q^2}, \mathbb{F}_{q^2}^*\}$ and $B \subset X$ be a union of selected subsets. The locator set is defined as $A = X \setminus B$.
   • The authors derive a sufficient condition for Hermitian self-orthogonality (Theorem 3.3) by expressing the Lagrange coefficients of $A$ in terms of the vanishing polynomial of $B$.
   • This condition relies on the Frobenius automorphism $x \mapsto x^q$ and requires finding a polynomial $G(x)$ such that $G(\alpha)^q = \gamma G(\alpha)$ for all $\alpha \in A$, where $\gamma$ is a specific element in the kernel of the norm map.
   • The column multipliers $v_\alpha$ are chosen such that their norms satisfy specific constraints derived from the vanishing polynomials of the constituent subsets.

2. Construction of Five Families:
   The authors apply this general condition to construct five distinct families of Hermitian self-orthogonal GRS codes by combining different types of subsets:

   • Family I: Combines sets with prescribed norm values ($U_\nu$) and cosets of multiplicative subgroups ($M_\delta$).
   • Family II: Combines sets with prescribed trace values ($L_c$) and cosets ($M_\delta$).
   • Family III: Combines sets with prescribed trace values ($L_c$) and sets with prescribed norm values ($U_\nu$).
   • Family IV: Combines two families of sets with prescribed trace values ($L_c$ and $K_e$) with cosets ($M_\delta$).
   • Family V: Combines two families of sets with prescribed trace values ($L_c$ and $K_e$) with sets of prescribed norm values ($U_\nu$).
   • Crucially, the framework allows for non-empty intersections among the subsets, with the code length determined by the cardinality of the union $B$ via the inclusion-exclusion principle.

3. Parameter Comparison:
   The resulting quantum codes share a common parameter form: length $n = q^2 - Sq + \theta$ and minimum distance range $2 \le d \le d^* = q - S + 1$. The authors systematically compare these parameters against:

   • Constructions based on trace maps combined with subspaces or norm maps (Fang et al.).
   • Constructions based on affine and projective linear transformations (Li et al.).
   • Constructions based on cosets of multiplicative subgroups (various authors, listed as R5–R20 in the Appendix).
   • Comparisons account for codes derived via the propagation rule.

Key Results

1. Existence of Five Families: The paper establishes the existence of five families of $q$-ary quantum MDS codes with minimum distances $d^* = q - S + 1$. For sufficiently large $q$, these distances satisfy $d^* > q/2 + 1$.
2. Strict Improvements over Trace-Based Constructions:
   • The authors derive upper bounds on the minimum distances of codes obtained from trace-subspace and trace-norm constructions (Proposition 4.3).
   • They provide sufficient conditions (Corollary 4.4) under which their five families achieve strictly larger minimum distances than these trace-based constructions at the same length. These improvements occur for infinitely many values of $q$.
3. Strict Improvements over Linear Transformation Constructions:
   • For the range $(q^2 - 1)/2 < n < q^2$, the authors determine the largest minimum distance attainable by linear transformation constructions (Proposition 4.5).
   • Applying this to their second family yields a two-parameter family of length $n = (q-R)(q-b)$ (Corollary 4.7). Under specific conditions, this family achieves a minimum distance strictly greater than the best possible from linear transformations.
   • The gain in minimum distance ($d^* - d_{LLJ}$) grows linearly with $q$ for fixed parameters $R$ and $b$ (Corollary 4.8).
4. Strict Improvements over Coset-Based Constructions:
   • By analyzing congruence conditions on the lengths of codes from families R5–R16, the authors derive fixed-length upper bounds on their minimum distances (Corollary 4.10).
   • They show that their second construction (Corollary 4.11) yields codes with lengths $n = (q-R)(q-b)$ that strictly exceed these bounds.
   • Furthermore, they demonstrate that codes from families R17–R20 cannot reach the lengths covered by their improvements because their original lengths are bounded by $(q^2-1)/2$.

Significance
The paper claims to provide a systematic method for constructing quantum MDS codes with improved parameters by leveraging the algebraic structure of complements of unions of finite-field subsets. The primary significance lies in:

• Generalization: The sufficient condition for Hermitian self-orthogonality applies to any finite collection of subsets satisfying specific hypotheses, allowing for complex intersections.
• Parameter Expansion: The constructions yield quantum MDS codes with lengths $n = q^2 - O(q)$ and minimum distances $d^* = q - O(1)$, specifically exceeding $q/2 + 1$.
• Provable Superiority: The paper provides rigorous proofs that, under suitable parameter conditions, these new codes possess strictly larger minimum distances than those obtainable from several prominent existing constructions (trace-based, linear transformation-based, and coset-based) at the same code length.
• Infinite Families: The authors exhibit specific infinite subfamilies where the gain in minimum distance over known constructions grows linearly with $q$.

The work does not propose experimental implementations or new physical applications but focuses on the theoretical advancement of the parameter space for quantum error-correcting codes. Future work is suggested to extend this method to extended GRS codes and other structured subsets with computable intersections.