We study the structure of anticodes in the sum-rank metric for arbitrary fields and matrix blocks of arbitrary sizes. Our main result is a complete classification of optimal linear anticodes. We also compare the cardinality of the ball in the sum-rank metric with that of an optimal linear anticode, showing that the latter is strictly larger over sufficiently large finite fields. Finally, we give examples of parameters for which the largest anticode is neither a ball nor a linear anticode.
|Number of pages||19|
|Journal||Linear Algebra and Its Applications|
|State||Published - Jun 15 2022|
Bibliographical noteFunding Information:
H. Gluesing-Luerssen was partially supported by the grant #422479 from the Simons Foundation.A. Ravagnani is partially supported by the Dutch Research Council through grant VI.Vidi.203.045.
© 2022 The Author(s)
- Matrix code
- Sum-rank metric
ASJC Scopus subject areas
- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics