Hermitian ℓ-Complementary Codes

• Hermitian ℓ-complementary codes are linear error-correcting codes over 𝔽₍q²₎ defined by a Hermitian hull of dimension ℓ, unifying self-orthogonal, LCD, and self-dual codes.
• They are constructed using algebraic methods, matrix scaling, and algebraic geometry, yielding explicit families with optimal or near-optimal parameters.
• These codes are essential in developing entanglement-assisted quantum error-correcting codes and advancing classical coding theory, with active research on higher-dimensional extensions.

A Hermitian $\ell$-complementary code is a linear code $C \leq \mathbb{F}_{q^2}^n$ whose Hermitian hull—defined via the non-degenerate Hermitian inner product—is of prescribed dimension $\ell$ ($0 \leq \ell \leq k$). These codes substantively generalize Hermitian self-orthogonal, Hermitian linear complementary dual (LCD), and Hermitian self-dual codes, and their structural understanding is central to advances in both classical and quantum coding theory.

1. Definitions and Fundamental Properties

Let $\mathbb{F}_{q^2}$ be a finite field with involutive automorphism $x \mapsto x^q$, and let $C \leq \mathbb{F}_{q^2}^n$ be a linear $[n, k]_{q^2}$ code. The Hermitian inner product is

$\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$

for $x, y \in \mathbb{F}_{q^2}^n$. The Hermitian dual is $C \leq \mathbb{F}_{q^2}^n$0, and the Hermitian hull is $C \leq \mathbb{F}_{q^2}^n$1, with dimension $C \leq \mathbb{F}_{q^2}^n$2. A code is Hermitian $C \leq \mathbb{F}_{q^2}^n$3-complementary if $C \leq \mathbb{F}_{q^2}^n$4.

Special cases include:

• $C \leq \mathbb{F}_{q^2}^n$5: Hermitian LCD code ($C \leq \mathbb{F}_{q^2}^n$6)
• $C \leq \mathbb{F}_{q^2}^n$7: Hermitian self-orthogonal code ($C \leq \mathbb{F}_{q^2}^n$8)
• $C \leq \mathbb{F}_{q^2}^n$9: Hermitian self-dual code ($\ell$0)

For matrix-based constructions, a $\ell$1 generator matrix $\ell$2 satisfies $\ell$3, where $\ell$4 is entrywise conjugation.

2. Algebraic and Combinatorial Constructions

Explicit constructions of Hermitian $\ell$5-complementary codes can be founded on the principle that for any Hermitian self-orthogonal $\ell$6 code, there exists for every $\ell$7 an $\ell$8 code $\ell$9 with $0 \leq \ell \leq k$0. This is achieved by scaling columns of a systematic generator matrix $0 \leq \ell \leq k$1 by non-square elements of $0 \leq \ell \leq k$2, with rank arguments ensuring the desired hull dimension. Such techniques enable the construction of codes with arbitrary hull dimension starting from Hermitian self-orthogonal seeds (Sok, 2021).

Algebraic geometry (AG) evaluation codes from curves of genus $0 \leq \ell \leq k$3 further provide families of Hermitian self-orthogonal codes: the AG code $0 \leq \ell \leq k$4 constructed from a divisor $0 \leq \ell \leq k$5 of large degree on a curve $0 \leq \ell \leq k$6, under explicit conditions on $0 \leq \ell \leq k$7 and the differential $0 \leq \ell \leq k$8, is Hermitian self-orthogonal with dimension and hull determined by the curve and divisor properties. Particular instances include MDS codes from the projective line ($0 \leq \ell \leq k$9), almost-MDS codes from elliptic curves ($\mathbb{F}_{q^2}$0), and very long codes from Hermitian curves ($\mathbb{F}_{q^2}$1) (Sok, 2021).

For codes over $\mathbb{F}_{q^2}$2, column-by-column classification yields a canonical generator matrix for Hermitian LCD codes of dimension $\mathbb{F}_{q^2}$3, enabling exhaustive search and classification (Ishizuka, 2020).

3. Enumeration and Asymptotic Properties

The enumeration of Hermitian $\mathbb{F}_{q^2}$4-complementary codes is captured by $\mathbb{F}_{q^2}$5: the number of $\mathbb{F}_{q^2}$6 codes with Hermitian hull of dimension $\mathbb{F}_{q^2}$7. For $\mathbb{F}_{q^2}$8 (self-orthogonal), an explicit product formula depending on $\mathbb{F}_{q^2}$9's parity is known. For general $x \mapsto x^q$0, inclusion-exclusion via Möbius inversion in the lattice of subspaces yields: $x \mapsto x^q$1 where $x \mapsto x^q$2 is the number of $x \mapsto x^q$3 Hermitian self-orthogonal codes, and the Gaussian binomials are over $x \mapsto x^q$4 (Wang et al., 14 Dec 2025).

Asymptotically for large $x \mapsto x^q$5, the average weight enumeration of Hermitian self-orthogonal codes matches that of all unrestricted codes. Moreover, for fixed $x \mapsto x^q$6, the fraction of Hermitian self-orthogonal codes of dimension $x \mapsto x^q$7 with minimum distance less than $x \mapsto x^q$8 vanishes as $x \mapsto x^q$9, provided $C \leq \mathbb{F}_{q^2}^n$0. It follows that Hermitian self-orthogonal MDS codes are asymptotically dense in the space of all such codes as $C \leq \mathbb{F}_{q^2}^n$1 grows (Wang et al., 14 Dec 2025).

4. Structural and Codeword Characterizations

A codeword-level criterion for the Hermitian LCD property asserts that for a linear code $C \leq \mathbb{F}_{q^2}^n$2 over $C \leq \mathbb{F}_{q^2}^n$3, $C \leq \mathbb{F}_{q^2}^n$4 is Hermitian LCD if and only if for every nonzero $C \leq \mathbb{F}_{q^2}^n$5 there exists $C \leq \mathbb{F}_{q^2}^n$6 with $C \leq \mathbb{F}_{q^2}^n$7. This is equivalent to the invertibility of $C \leq \mathbb{F}_{q^2}^n$8 for a generator matrix $C \leq \mathbb{F}_{q^2}^n$9. For one-generator $[n, k]_{q^2}$0-quasi-cyclic codes, necessary and sufficient algebraic conditions reduce to (i) an invariance under Frobenius and reciprocal map for the polynomial generator $[n, k]_{q^2}$1 and (ii) coprimality of a certain folded sum of the generating polynomials with the co-generator (Guan et al., 2023).

For small dimensions, canonical generator matrices and combinatorial conditions (e.g., parity constraints on the multiplicities of column types) completely determine existence and optimality, as in the classification of optimal quaternary Hermitian LCD codes of dimension $[n, k]_{q^2}$2 (Ishizuka, 2020) and the nonexistence theorems for $[n, k]_{q^2}$3 (Araya et al., 2019).

5. Explicit Families and Parameter Ranges

Construction methods yield explicit infinite families of Hermitian $[n, k]_{q^2}$4-complementary codes with optimal or near-optimal parameters, including:

• MDS and almost-MDS codes from AG curves and systematic matrix generators with hull dimension varying over the full allowed range (Sok, 2021);
• Quaternary Hermitian LCD codes with new record minimum distances via extension-and-puncturing of generator matrices (Harada, 2021);
• Complete classification of optimal $[n, k]_{q^2}$5 Hermitian LCD codes for all $[n, k]_{q^2}$6 except those with $[n, k]_{q^2}$7, and explicit families for $[n, k]_{q^2}$8 (Ishizuka, 2020, Araya et al., 2019).

Parameter sets for constructed codes include families of MDS $[n, k]_{q^2}$9 codes for projective lines, almost-MDS codes from elliptic/hyperelliptic curves, and high-dimensional codes $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$0 which were previously inaccessible for prescribed hull dimension (Sok, 2021).

6. Applications to Quantum Error Correction

Hermitian $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$1-complementary codes are instrumental in constructing entanglement-assisted quantum error correcting codes (EAQECCs). Given a $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$2 code with hull dimension $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$3, the standard construction yields

$\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$4

where $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$5 is the minimum distance of the Hermitian dual (Sok, 2021, Araya et al., 2019). Codes constructed via the algebraic geometric and systematic generator methods can attain the EA-Singleton bound for a wide range of parameters. For example, MDS Hermitian LCD codes can be used to construct maximal-entanglement EAQECCs meeting the Griesmer bound when $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$6, providing distance-optimal quantum codes (Araya et al., 2019).

7. Open Problems and Future Directions

Challenges remain in extending classification and construction to higher dimensions, systematically closing gaps in the table of optimal parameters for Hermitian LCD and more general $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$7-complementary codes. The generalization of combinatorial bounds on column multiplicities and the discovery of new highly-structured seed codes for propagation via extension remain open. On the quantum side, it is unresolved whether maximal-entanglement EAQECCs meeting the Griesmer bound can always be achieved for arbitrary $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$8 (Araya et al., 2019, Harada, 2021).

Ongoing research addresses both the explicit identification of new families with prescribed hull and the asymptotic landscape, where almost all self-orthogonal codes are MDS as $\langle x, y \rangle_H = \sum_{i=1}^n x_i y_i^q,$9 grows. Classification for $x, y \in \mathbb{F}_{q^2}^n$0 and extension of algebraic curve constructions to new parameter ranges are active areas of investigation (Wang et al., 14 Dec 2025, Sok, 2021).