Anticodes for the Grassmann and bilinear forms graphs (Q1894271): Difference between revisions

This paper presents anticodes in Grassmann graphs and bilinear forms graphs. A new proof of the result due to Chihara viz. ``Many infinite families of classical distance-regular graphs have no nontrivial perfect codes, including the Grassmann graphs and the bilinear forms graphs'' has been given for these two families. The main tool is Delsarte's anticode condition and the technique is an extension of an approach taken by Roos in the study of perfect codes in the Johnson graphs.