Sum-rank Hamming codes are the longest one-error-correcting codes in the sum-rank metric; when the extension degree is one they are characterized by maximal partial spreads and can be perfect.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Hamming and simplex codes for the sum-rank metric
Sum-rank Hamming codes are the longest one-error-correcting codes in the sum-rank metric; when the extension degree is one they are characterized by maximal partial spreads and can be perfect.