Perfect codes in the sum-rank metric are shown to be impossible for large families of parameters, though the two-block case for small radius and q>e^3 is left unresolved by the proof.
Perfect Hermitian rank-metric codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This study investigates Hermitian rank-metric codes, a special class of rank-metric codes, focusing on perfect codes and on the analysis of their covering properties. Firstly, we establish bounds on the size of spheres in the space of Hermitian matrices and, as a consequence, we show that non-trivial perfect codes do not exist in the Hermitian case. We conclude the paper by examining their covering density.
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On the non-existence of perfect codes in the sum-rank metric
Perfect codes in the sum-rank metric are shown to be impossible for large families of parameters, though the two-block case for small radius and q>e^3 is left unresolved by the proof.