The connections between graph theory, and more generally association schemes, and coding theory were established by Delsarte for the Hamming metric and rank-metric codes. The ambient metric space of Hamming-metric codes and rank-metric codes can be seen as Cayley graphs generated by words of weight one. The metrics considered then coincide with the geodesic distances of these distance-regular graphs. We focus on a generalisation of this framework to the space of tensors over a finite field, endowed with the tensor-rank as a metric. This space corresponds to the Cayley graph generated by rank-one tensors, which is not distance-regular for tensors of order at least 3. We show that the spectrum of this graph has a recursive expression and depends on the possible intersections between tensor subspaces of large enough dimension and the Segre variety. The spectrum of this graph for 3-order tensors can be expressed with the rank distribution of the rank-metric codes generated by these tensors. In particular, we obtain the complete spectrum of the graph for 2x3x3 tensors over any finite field. We apply this result to derive bounds on the dimension of tensor codes in the tensor-rank metric using the eigenvalue method, and in particular the ratio-type bound.

翻译：暂无翻译