Eigenvalue bounds and alternating rank-metric codes
Combinatorics
2024-05-16 v1 Information Theory
math.IT
Abstract
In this note we apply a spectral method to the graph of alternating bilinear forms. In this way, we obtain upper bounds on the size of an alternating rank-metric code for given values of the minimum rank distance. We computationally compare our results with Delsarte's linear programming bound, observing that they give the same value. For small values of the minimum rank distance, we are able to establish the equivalence of the two methods. The problem remains open for larger values.
Cite
@article{arxiv.2405.09254,
title = {Eigenvalue bounds and alternating rank-metric codes},
author = {Aida Abiad and Gianira N. Alfarano and Alberto Ravagnani},
journal= {arXiv preprint arXiv:2405.09254},
year = {2024}
}