Uniformly packed codes and more distance regular graphs from crooked functions
type: Item
instance of: scholarly article
title: Uniformly packed codes and more distance regular graphs from crooked functions
zbMATH Open document ID: 0966.05084
DOI: 10.1023/A:1026583725202
published in: Journal of Algebraic Combinatorics
publication date: 2001-08-16T00:00:00Z
review text: 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)].
reviewed by: M. R. Darafsheh
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 1553307
zbMATH Keywords: crooked functions
zbMATH Keywords: distance regular graphs
zbMATH Keywords: association schemes
author: Edwin R. Van Dam
author: Dmitry G. Fon-Der-Flaass
MaRDI profile type: Publication
cites work: Crooked functions, bent functions, and distance regular graphs
cites work: Q3992965
cites work: Association schemes related to Kasami codes and Kerdock sets
cites work: A family of antipodal distance-regular graphs related to the classical Preparata codes
cites work: Codes, bent functions and permutations suitable for DES-like cryptosystems
cites work: Q3946078
cites work: Q4099518
description: scientific article; zbMATH DE number 1553307