Anticodes for the Grassmann and bilinear forms graphs (Q1894271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Anticodes for the Grassmann and bilinear forms graphs |
scientific article; zbMATH DE number 777670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Anticodes for the Grassmann and bilinear forms graphs |
scientific article; zbMATH DE number 777670 |
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
0.8786660432815552
0 references
0.7732231020927429
0 references
0.7711098790168762
0 references
0.769569456577301
0 references
