betaFeedback

WorksComputer Science

New Maximum Hermitian dd-Codes and New Invariants from Skew Polynomial Rings

Abstract

Maximum rank-distance codes were introduced independently by Delsarte (1978) and Gabidulin (1985) for unrestricted matrix spaces, and their study was subsequently extended to the classical form spaces of alternating, symmetric, and Hermitian matrices. For Hermitian dd-codes, Schmidt (2018) established the upper bound and constructed optimal additive codes for all admissible parameters except when nn and dd are both even and 4≤d≤n−24\le d\le n-2. We settle this final open existence case, more generally, construct additive maximum Hermitian rank-metric codes for every admissible length and minimum distance. Rather than working directly in the space of Hermitian matrices, we construct our objects within central simple algebras with unitary involution arising from quotients of skew polynomial rings. We also introduce scalar-field and Lyapunov operators in these algebras, leading to new invariants for the equivalence of additive Hermitian codes. Explicitly determining these invariants yields strong necessary conditions for Hermitian equivalence and demonstrates that our construction contains a large number of pairwise inequivalent codes.

Introduction

Let X\mathcal{X} be a space of matrices over a finite field. The rank metric on X\mathcal{X} is

drk(A,B)=rk⁡(A−B),d_{\mathrm{rk}}(A,B)=\operatorname{rk}(A-B),

and a nonempty subset C⊆X\mathcal{C} \subseteq\mathcal{X} is a dd-code if rk⁡(A−B)≥d\operatorname{rk}(A-B) \ge d whenever A,B∈CA,B \in\mathcal{C} are distinct. The basic extremal questions are to determine the largest possible cardinality, to construct codes attaining the relevant bound, and to classify the extremal codes under the natural rank-metric isometries.

For unrestricted rectangular matrices, the theory began with two independent constructions. Delsarte used the association scheme of bilinear forms, while Gabidulin used extension fields and linearized polynomials [3, 6]. Both constructions attain the rank-metric Singleton bound and give the classical maximum rank-distance, or MRD, codes. These two viewpoints—bilinear forms and linearized-polynomial evaluation—remain fundamental in rank-metric coding theory.

A parallel extremal theory arises in matrix spaces defined by an adjoint symmetry. We use the term classical form spaces for the spaces of alternating and symmetric bilinear forms and of Hermitian sesquilinear forms; after choosing bases, these become the spaces of alternating, symmetric, and Hermitian matrices. Delsarte and Goethals obtained sharp bounds and optimal constructions in ends_mid=1 the alternating-form space [4]. Schmidt subsequently established corresponding results for symmetric forms in odd and even characteristic and for Hermitian forms [18, 19, 20, 21]. For some parameters of symmetric-form spaces and Hermitian-form spaces, the sharp upper bound for arbitrary codes is not known, whereas the corresponding additive problem has a sharp bound. Accordingly, a maximum additive dd-code means an additive subgroup that attains the sharp upper bound in its ambient form space.

Let Hn(Fq2/Fq)\mathcal{H}_n(\mathbb{F}_{q^2}/\mathbb{F}_q) be the space of n×nn \times n Hermitian matrices over Fq2\mathbb{F}_{q^2}. Schmidt proved that every additive Hermitian dd-code CC satisfies

∣C∣≤qn(n−d+1).(1)|C| \leq q^{n(n-d+1)}. \tag*{(1)}

He also constructed codes attaining (1) for all admissible pairs (n,d)(n,d), except when nn and dd are both even and

4≤d≤n−2;4 \leq d \leq n-2;

the endpoint cases d=2d=2 and d=nd=n were already known [20]. See also [24] for another construction of codes attaining the bound in (1) when d=2d=2. Thus the even–even range was the last unresolved existence case for maximum additive dd-codes among the classical form spaces described above.

The first purpose of this paper is to close this gap. More generally, we give a uniform construction over every quadratic extension Fqs/Fqs/2\mathbb{F}_{q^s}/\mathbb{F}_{q^{s/2}}, where s≥2s \geq2 is even. Set

L=Fqn,K=Fq,L = \mathbb{F}_{q^n}, \qquad K = \mathbb{F}_q,

let σ\sigma generate Gal⁡(L/K)\operatorname{Gal}(L/K), and consider the skew polynomial ring

R=L[X;σ],Xα=σ(α)X(α∈L).R = L[X;\sigma], \qquad X\alpha= \sigma(\alpha)X \quad(\alpha\in L).

Choose a monic irreducible self-reciprocal polynomial F(Y)∈K[Y]F(Y) \in K[Y] of degree ss. Since F(Xn)F(X^n) is central in RR, the quotient

RF:=R/RF(Xn)R_F := R/RF(X^n)

is a central simple algebra of degree nn over its center EF≅Fqs\mathbb{E}_F \cong\mathbb{F}_{q^s}. Self-reciprocity of FF yields an involution of the second kind

Θ:RF⟶RF,\Theta: R_F \longrightarrow R_F,

whose restriction ϱ\varrho to EF\mathbb{E}_F has fixed field EFϱ≅Fqs/2\mathbb{E}_F^\varrho\cong\mathbb{F}_{q^{s/2}}. Under a suitable splitting isomorphism RF≅Mn(EF)R_F \cong M_n(\mathbb{E}_F), the fixed-point space Fix⁡(Θ)\operatorname{Fix}(\Theta) is identified with

Hn(EF/EFϱ).\mathcal{H}_n(\mathbb{E}_F/\mathbb{E}_F^\varrho).

Thus the Hermitian matrix space is realized intrinsically as the symmetric part of a central simple algebra with unitary involution.

For 0≤ℓ≤ns/2−10 \leq\ell\leq ns/2 - 1, define

Sℓ(F):={α0+∑i=1ℓ(σ−i(αi)X−i+αiXi)+RF(Xn):α0,…,αℓ∈Fqn}.(2)S_\ell(F) := \left\{ \alpha_0 + \sum_{i=1}^{\ell} \left(\sigma^{-i}(\alpha_i)X^{-i} + \alpha_iX^i\right) + RF(X^n) : \alpha_0,\ldots,\alpha_\ell\in\mathbb{F}_{q^n} \right\}. \tag*{(2)}

The paired coefficients are exactly the condition that the displayed elements be fixed by Θ\Theta. For 1≤d≤n1 \leq d \leq n, set

ℓ=ℓd:=s(n−d+1)−22.\ell= \ell_d := \frac{s(n-d+1)-2}{2}.

We prove that Sℓd(F)\mathcal{S}_{\ell d}(F) has minimum rank distance dd and cardinality

qsn(n−d+1)/2=∣Fqs/2∣n(n−d+1).q^{sn(n-d+1)/2}=\left|\mathbb{F}_{q^{s/2}}\right|^{n(n-d+1)}.

It therefore attains the sharp Hermitian bound. Consequently, for any even ss our construction yields maximum additive Hermitian dd-codes in Hn(Fqs/Fqs/2)\mathcal{H}_n(\mathbb{F}_{q^s}/\mathbb{F}_{q^{s/2}}) for every (n,d)(n,d), including the previously open even–even range.

We next study equivalence. Let E/F\mathbb{E}/\mathbb{F} be a quadratic extension of finite fields, let A∗:=(Aϱ)TA^*:=\left(A^\varrho\right)^{\mathsf{T}}, and let C,D⊆Hn(E/F)\mathcal{C},\mathcal{D}\subseteq\mathcal{H}_n(\mathbb{E}/\mathbb{F}) be additive codes. The full semilinear equivalence relation used in this paper is the following: C\mathcal{C} and D\mathcal{D} are Hermitian equivalent if

D={μNAφN∗:A∈C}(3)\mathcal{D}=\{\mu NA^\varphi N^*:A\in\mathcal{C}\} \tag*{(3)}

for some N∈GL⁡n(E)N\in\operatorname{GL}_n(\mathbb{E}), μ∈F×\mu\in\mathbb{F}^{\times}, and φ∈Aut⁡(E)\varphi\in\operatorname{Aut}(\mathbb{E}), where AφA^\varphi is obtained by applying φ\varphi entrywise. These are precisely the semilinear rank-metric isometries fixing the zero matrix, up to the standard translation term [25].

Our analysis of equivalence is based on two structural invariants that we introduce. The first is the scalar field

F(C):={λ∈F:λC⊆C}.\mathcal{F}(\mathcal{C}):=\{\lambda\in\mathbb{F}:\lambda\mathcal{C}\subseteq\mathcal{C}\}.

If Φ(A)=μNAφN∗\Phi(A)=\mu NA^\varphi N^* gives an equivalence from C\mathcal{C} to D\mathcal{D}, then

λΦ(A)=Φ(φ−1(λ)A),\lambda\Phi(A)=\Phi\left(\varphi^{-1}(\lambda)A\right),

and hence

F(D)=φ(F(C)).\mathcal{F}(\mathcal{D})=\varphi(\mathcal{F}(\mathcal{C})).

Thus the isomorphism type, and in particular the cardinality, of the scalar field is an invariant of Hermitian equivalence. Schmidt’s trace constructions are linear over the entire fixed field, whereas, for s>2s>2, our codes have a proper scalar field; when ℓd<ns/4\ell d<ns/4, it is exactly Fq\mathbb{F}_q. This separates the new codes from Schmidt’s constructions whenever the latter exist with the same parameters.

The second invariant is obtained from Lyapunov-type operators. For b‾∈RF\overline{b}\in R_F, put

Δb‾(z‾):=b‾ z‾+z‾ Θ(b‾),z‾∈Fix⁡(Θ),\Delta_{\overline{b}}(\overline{z}):=\overline{b}\,\overline{z}+\overline{z}\,\Theta(\overline{b}),\qquad\overline{z}\in\operatorname{Fix}(\Theta),

and define

L(C):={b‾∈RF:Δb‾(C)⊆C}.\mathcal{L}(\mathcal{C}):=\{\overline{b}\in R_F:\Delta_{\overline{b}}(\mathcal{C})\subseteq\mathcal{C}\}.

After passage to matrices, Δb‾\Delta_{\overline{b}} becomes the Hermitian Lyapunov operator A↦BA+AB∗A\mapsto BA+AB^*. The corresponding Lyapunov equations are classical objects in matrix analysis and control theory, and have been studied from several viewpoints; see, for instance [1, 10, 13, 14]. Its transformation under (3) is immediate. Since finite-field automorphisms commute with ϱ\varrho, if B′=NBφN−1B'=NB^\varphi N^{-1}, then

ΔB′(μNAφN∗)=μNΔB(A)φN∗.\Delta_{B'}(\mu NA^\varphi N^*)=\mu N\Delta_B(A)^\varphi N^*.

Consequently,

L(D)=NL(C)φN−1.\mathcal{L}(\mathcal{D})=N\mathcal{L}(\mathcal{C})^\varphi N^{-1}.

For n≥3n\geq3 and 1≤ℓ<ns/41\leq\ell<ns/4, we determine this invariant explicitly:

L(Sℓ(F))=L+BF,BF:={λ∈EF:λ+Θ(λ)∈Fq}.\mathcal{L}(\mathcal{S}_{\ell}(F))=\mathbb{L}+\mathbb{B}_F,\qquad\mathbb{B}_F:=\{\lambda\in\mathbb{E}_F:\lambda+\Theta(\lambda)\in\mathbb{F}_q\}.

The distinguished copy of L=Fqn\mathbb{L}=\mathbb{F}_{q^n} can be recovered from this additive subgroup. Hence an equivalence between two members of the family must normalize that field, reducing an arbitrary Hermitian isometry to a strongly constrained comparison in a common semilinear model.

Based on this determination of the Lyapunov invariant, Section 6 proves strong necessary conditions for equivalence between Sℓ(F)\mathcal{S}_{\ell}(F) and Sℓ(G)\mathcal{S}_{\ell}(G). A full Hermitian equivalence may first apply an automorphism of E=Fqs\mathbb{E}=\mathbb{F}_{q^s}; the conditions below are therefore understood up to this field automorphism. If τ\tau denotes the induced automorphism of K=Fq\mathbb{K}=\mathbb{F}_q, write FτF^{\tau} for the polynomial obtained by applying τ\tau to the coefficients of FF. Assume now that n>2n>2. The conclusions are as follows.

  • When

1≤ℓ<min⁡{n,ns/4},1\leq\ell<\min\{n,ns/4\},

the equivalence between Sℓ(F)\mathcal{S}_{\ell}(F) and Sℓ(G)\mathcal{S}_{\ell}(G) leads to

Fτ(Y)=λsG(λ−1Y)F^{\tau}(Y)=\lambda^{s}G(\lambda^{-1}Y)

for some λ∈Fq×\lambda\in\mathbb{F}_q^{\times}.

  • When s>4s>4 and

n<ℓ<ns4,n<\ell<\frac{ns}{4},

References

  1. [1]R. Byers and S. G. Nash. On the singular “vectors” of the Lyapunov operator. SIAM Journal on Algebraic and Discrete Methods, 8(1):59–66, 1987.DOI
  2. [2]L. Carlitz. Some theorems on irreducible reciprocal polynomials over a finite field. Journal für die reine und angewandte Mathematik, 227:212–220, 1967.DOI
  3. [3]P. Delsarte. Bilinear forms over a finite field, with applications to coding theory. Journal of Combinatorial Theory, Series A, 25(3):226–241, 1978.DOI
  4. [4]P. Delsarte and J.-M. Goethals. Alternating bilinear forms over GF(q). Journal of Combinatorial Theory, Series A, 19(1):26–50, 1975.DOI
  5. [5]U. Dempwolff. Autotopism groups of cyclic semifield planes. J. Algebraic Combin., 34(4):641–669, 2011.DOI
  6. [6]E. M. Gabidulin. Theory of codes with maximum rank distance. Problemy Peredachi Informatsii, 21(1):3–16, 1985.
  7. [7]J. Gómez-Torrecillas, F. J. Lobillo, and G. Navarro. Computing the bound of an Ore polynomial. Applications to factorization. Journal of Symbolic Computation, 92:269–297, 2019.
  8. [8]J. Gómez-Torrecillas, F. J. Lobillo, G. Navarro, and D. Santonastaso. Adjoint and duality for rank-metric codes in a skew polynomial framework. arXiv preprint arXiv:2511.05084, 2025.
  9. [9]K. R. Goodearl and R. B. Warfield. An introduction to noncommutative Noetherian rings. Cambridge university press, 2004.DOI
  10. [10]G. A. Hewer and C. S. Kenney. The sensitivity of the stable Lyapunov equation. SIAM Journal on Control and Optimization, 26(2):321–344, 1988.
  11. [11]N. Jacobson. Finite-dimensional division algebras over fields. Springer Science & Business Media, 2009.
  12. [12]M.-A. Knus, A. Merkurjev, M. Rost, and J.-P. Tignol. The book of involutions, volume 44 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 1998.DOI
  13. [13]P. Lancaster. Explicit solutions of linear matrix equations. SIAM Review, 12(4):544–566, 1970.DOI
  14. [14]J.-R. Li and J. White. Low rank solution of Lyapunov equations. SIAM Journal on Matrix Analysis and Applications, 24(1):260–280, 2002.
  15. [15]G. Longobardi, G. Lunardon, R. Trombetti, and Y. Zhou. Automorphism groups and new constructions of maximum additive rank metric codes with restrictions. Discrete Mathematics, 343(7):111871, 15, 2020.DOI
  16. [16]O. Ore. Theory of non-commutative polynomials. Annals of Mathematics, 34(3):480–508, 1933.DOI
  17. [17]P. Santonastaso and Y. Zhou. On the autotopism groups and the equivalence of finite cyclic semifields. arXiv preprint arXiv:2607.19172, 2026.arxiv.org/abs/2607.19172
  18. [18]K.-U. Schmidt. Symmetric bilinear forms over finite fields of even characteristic. Journal of Combinatorial Theory, Series A, 117(8):1011–1026, 2010.DOI
  19. [19]K.-U. Schmidt. Symmetric bilinear forms over finite fields with applications to coding theory. Journal of Algebraic Combinatorics, 42(2):635–670, 2015.arxiv.org/abs/1410.7184
  20. [20]K.-U. Schmidt. Hermitian rank distance codes. Designs, Codes and Cryptography, 86(7):1469–1481, 2018.arxiv.org/abs/1702.02793
  21. [21]K.-U. Schmidt. Quadratic and symmetric bilinear forms over finite fields and their association schemes. Algebraic Combinatorics, 3(1):161–189, 2020.arxiv.org/abs/1803.04274
  22. [22]J. Sheekey. New semifields and new MRD codes from skew polynomial rings. Journal of the London Mathematical Society, 101(1):432–456, 2020.DOI
  23. [23]D. E. Taylor. The geometry of the classical groups, volume 9. Heldermann Verlag, 1992.
  24. [24]R. Trombetti and F. Zullo. On maximum additive Hermitian rank-metric codes. Journal of Algebraic Combinatorics, 54(1):151–171, 2021.arxiv.org/abs/2001.06628
  25. [25]Z. Wan. Geometry of Matrices. World Scientific, 1996.

Paper details

vlnc:W_35zgn8p3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents