Search arXiv⌕ Search

arXiv · 2610.26048

New Maximum Hermitian $d$-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 $d$-codes, Schmidt (2018) established the upper bound and constructed optimal additive codes for all admissible parameters except when $n$ and $d$ are both even and $4\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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paolo Santonastaso, Yue Zhou. 2026-10-19. New Maximum Hermitian $d$-Codes and New Invariants from Skew Polynomial Rings. https://arxiv.org/abs/2610.26048

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Insertion Correcting Capability for Quantum Deletion-Correcting Codes

It is conjectured that a quantum code $C$ corrects $t$ deletion errors if and only if $C$ corrects a total of $t$ insertion and deletion errors. Although this conjecture has been proved only under certain conditions, it has not been proved in general. In this paper, we prove this conjecture for general quantum codes. Specifically, we show that a quantum state after an insertion error is represented as a product state of the original multi-qudit system and the inserted quantum state. Then, we prove this conjecture by combining the previous results and this property. In addition, we define generalized insertion errors by removing the quantum channel requirement from insertion errors and present their properties.

cs.IT↗

Nonlinear Information Theory: Characterizing Distributional Uncertainty in Communication Models with Sublinear Expectation

A mathematical framework for information-theoretic analysis is established, with a new viewpoint of describing transmitted messages and communication channels by the nonlinear expectation theory, beyond classical probability framework. Based on nonlinear expectation theory, in this paper we define several fundamental concepts, such as nonlinear information entropy, nonlinear joint entropy, and nonlinear mutual information, and establish their basic properties. By using strong law of large numbers under sublinear expectations, we propose a nonlinear source coding theorem, which shows that nonlinear entropy is a sufficient achievability threshold for the achievable coding rate of uncertain-distribution sources under the maximum error probability criterion, and determines a cluster point of the achievable coding rate under the minimum error probability criterion. We also propose a nonlinear channel coding theorem, providing explicit expressions of the upper bound and a cluster point under the maximum and minimum error probability criterion, respectively, for the achievable coding rate of uncertain-distribution channels. Additionally, we propose a nonlinear rate-distortion source coding theorem, proving that the rate-distortion function based on nonlinear mutual information is a cluster point of the lossy compression performance of uncertain-distribution sources under the minimum expected distortion criterion. Finally, we show some examples and simulations to consolidate our theoretic study.

cs.IT↗

AoI-Aware Polar Code Blind Rate Adaptation

We study adaptive prefix-length selection for reliability-ordered coded transmission over $N$ coordinates, using only the $K$ most reliable, to balance age of information (AoI) against throughput. An additive-increase/decrease (AID) prefix-walk controller updates the prefix length from the last decoding outcome alone, at $O(1)$ per-slot cost with no channel estimation, inducing an irreducible birth--death chain whose mean drift fixes a unique balance point $K^\dagger$ (largest $K$ with success probability $\ge\tfrac12$), around which the stationary distribution concentrates geometrically. We derive this distribution in closed form via detailed balance and obtain exact steady-state AoI and goodput via renewal-reward analysis. Simulations on a $64$-coordinate polar code over a binary symmetric channel (BSC) confirm these predictions to within $0.3\%$. Relative to a genie-aided upper bound with perfect channel knowledge, we further quantify the goodput cost of adapting from a single feedback bit alone.

cs.IT↗