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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 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.