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.

翻译：本文中，我们将谱方法应用于交错双线性型图。通过该方法，我们获得了在最小秩距离给定值下交错秩度量码大小的上界。我们通过计算将结果与德尔萨特线性规划界进行比较，发现两者给出相同数值。对于最小秩距离较小的情况，我们能够建立这两种方法的等价性，而较大值情形仍待解决。