Codes, graphs, and schemes from nonlinear functions

European Journal of Combinatorics

Volumn 24, Issue 1, 2003, Pages 85-98

  van Dam, Edwin R ^a   Fon Der Flaass, D ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037286797     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0195-6698(02)00116-6     Document Type: Article

References (21)

1. Bending T. Fon-Der-Flaass D. Crooked functions, bent functions, and distance regular graphs Electron. J. Comb. 5 R34 1998 14
2. Brouwer A.E. Cohen A.M. Neumaier A. Distance-Regular Graphs 1989 Springer-Verlag
3. Brouwer A.E. Tolhuizen L.M.G.M. A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters Des. Codes Cryptogr. 3 1993 95-98
4. de Caen D. van Dam E.R. Association schemes related to Kasami codes and Kerdock sets Des. Codes Cryptogr. 18 1999 89-102
5. de Caen D. Mathon R. Moorhouse G.E. A family of antipodal distance-regular graphs related to the classical Preparata codes J. Algebr. Comb. 4 1995 317-327
6. Cameron P.J. van Lint J.H. Designs, Graphs, Codes and their Links 1991 Cambridge University Press Cambridge
7. Canteaut A. Charpin P. Dobbertin H. Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture IEEE Trans. Inform. Theory 46 2000 4-8
8. Carlet C. Charpin P. Zinoviev V. Codes, bent functions and permutations suitable for DES-like cryptosystems Des. Codes Cryptogr. 15 1998 125-156
9. Chabaud F. Vaudenay S. Links between differential and linear cryptanalysis in: Advances in Cryptology, EUROCRYPT '94, Lecture Notes in Computer Science 1995 356-365 Springer New York
10. Charpin P. Open problems on cyclic codes in: Pless V.S. Huffman W.C. (Eds.), Handbook of Coding Theory 1998 963-1063 Elsevier Amsterdam
11. Coulter R.S. Henderson M. A class of functions and their application in constructing semi-biplanes and association schemes Discrete Math. 202 1999 21-31
12. van Dam E.R. Fon-Der-Flaass D. Uniformly packed codes and more distance regular graphs from crooked functions J. Algebr. Comb. 12 2000 115-121
13. n): a new case for n divisible by 5 in: Jungnickel D. Niederreiter H. (Eds.), Finite Fields and Applications 2001 113-121 Springer Berlin
14. Gold R. Maximal recursive sequences with 3-valued recursive crosscorrelation functions IEEE Trans. Inform. Theory 14 1968 154-156
15. Helleseth T. Kumar P.V. Sequences with low correlation in: Pless V.S. Huffman W.C. (Eds.), Handbook of Coding Theory 1998 1765-1853 Elsevier Amsterdam
16. Hollmann H.D.L. Xiang Q. A proof of the Welch and Niho conjectures on cross-correlations of binary m-sequences Finite Fields Appl. 7 2001 253-286
17. Kasami T. The weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes Inform. Control. 18 1971 369-394
18. van Lint J.H. Introduction to Coding Theory third ed. 1998 Springer-Verlag
19. Nyberg K. Differentially uniform mappings for cryptography in: Advances in Cryptology, EUROCRYPT '93, Lecture Notes in Computer Science 1994 55-64 Springer New York
20. Turyn R.J. Character sums and difference sets Pacific J. Math. 15 1965 319-346
21. Q. Xiang, Maximally nonlinear functions and bent functions, Des. Codes Cryptogr. 17 (1999) 211-218.