Uniformly Packed Codes and More Distance Regular Graphs from Crooked Functions

Journal of Algebraic Combinatorics

Volumn 12, Issue 2, 2000, Pages 115-121

  Van Dam, E R ^a   Fon Der Flaass, D ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Association scheme; Crooked function; Distance regular graph; Uniformly packed code

Indexed keywords

EID: 0038410825     PISSN: 09259899     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026583725202     Document Type: Article

References (7)

1. T. Bending and D. Fon-Der-Flaass, "Crooked functions, bent functions, and distance regular graphs," Electronic Journal of Combinatorics 5 (R34) (1998).
2. A.E. Brouwer, A.M. Cohen, and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin, 1989.
3. D. de Caen and E.R. van Dam, "Association schemes related to Kasami codes and Kerdock sets," Designs, Codes and Cryptography, to appear.
4. D. de Caen, R. Mathon, and G.E. Moorhouse, "A family of antipodal distance-regular graphs related to the classical Preparata codes," J. Alg. Combin. 4 (1995), 317-327.
5. C. Carlet, P. Charpin, and V. Zinoviev, "Codes, bent functions and permutations suitable for DES-like cryptosystems," Designs, Codes and Cryptography 15 (1998), 125-156.
6. J.H. van Lint, Introduction to Coding Theory, 3rd edition, Springer-Verlag, 1998.
7. H.C.A. van Tilborg, "Uniformly packed codes," Thesis, Eindhoven University of Technology, 1976.