3 papers
math.CO2024
Eigenvalue bounds for the distance- chromatic number of a graph and their application to Lee codes
Aida Abiad, Alessandro Neri, Luuk Reijnders
We derive eigenvalue bounds for the -distance chromatic number of a graph, which is a generalization of the classical chromatic number. We apply such bounds to hypercube graphs,…
cs.IT2023
Higher-degree symmetric rank-metric codes
Arthur Bik, Alessandro Neri
Over fields of characteristic unequal to , we can identify symmetric matrices with homogeneous polynomials of degree . This allows us to view symmetric rank-metric codes as l…
cs.IT2021
The geometry of one-weight codes in the sum-rank metric
Alessandro Neri, Paolo Santonastaso, Ferdinando Zullo
We provide a geometric characterization of -dimensional -linear sum-rank metric codes as tuples of -subspaces of . We then us…