Uniformly packed codes and more distance regular graphs from crooked functions (Q1592955)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1553307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uniformly packed codes and more distance regular graphs from crooked functions |
scientific article; zbMATH DE number 1553307 |
Statements
Uniformly packed codes and more distance regular graphs from crooked functions (English)
0 references
16 August 2001
0 references
The authors use crooked functions to construct distance regular graphs, symmetric association schemes with five classes and uniformly packed codes. Crooked functions were introduced by \textit{T. D. Bending} and \textit{D. Fon-Der-Flaass} in [Crooked functions, bent functions, and distance regular graphs, Electron. J. Comb. 5, Research paper R34 (1998; Zbl 0903.05053); printed version J. Comb. 5, 507-520 (1998)].
0 references
crooked functions
0 references
distance regular graphs
0 references
association schemes
0 references
0.8554386496543884
0 references
0.8518760204315186
0 references
0.850364089012146
0 references
0.8108661770820618
0 references
0.8086902499198914
0 references
