Anticodes for the Grassmann and bilinear forms graphs (Q1894271): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3992965 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5707657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subspaces, subsets, and partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Orthogonal Polynomials, Duality and Association Schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the existence of perfect constant weight codes / rank | |||
Normal rank | |||
Latest revision as of 14:49, 23 May 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
