Anticodes for the Grassmann and bilinear forms graphs (Q1894271): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Anticodes for the Grassmann and bilinear forms graphs |
scientific article |
Statements
Anticodes for the Grassmann and bilinear forms graphs (English)
0 references
2 December 1996
0 references
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.
0 references
Grassmann graphs
0 references
bilinear forms graphs
0 references
Delsarte's anticode condition
0 references
