Strongly regular graphs associated with bent functions

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn , Issue , 2004, Pages 380-383

  Huang, Tayuan ^a   You, Kuei Hung ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FOURIER TRANSFORMS; GRAPH THEORY; MATRIX ALGEBRA; NONLINEAR EQUATIONS; THEOREM PROVING;

BENT FUNCTIONS; BINARY FUNCTIONS; CAYLEY GRAPHS; REGULAR GRAPHS;

BOOLEAN FUNCTIONS;

EID: 3543121915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. A. Bernasconi and B. Codenotti, "Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem", IEEE Trans. Computers, Vol.48, No.3, Mar. 1999, pp. 345-351.
2. A. Bernasconi and B. Codenotti, and J. VanderKam, "A Characterization of Bent Functions in terms of Strongly Regular Graphs", IEEE Transactions on Computers, Vol.50 No.9, September 2001, pp. 984-985.
3. N. Biggs, Algebraic Graph Theory 2nd edition, Cambridge University Press, 1993.
4. C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs, CRC Press, 1996.
5. C. Godsil and G. Royle, Algebraic Graph Theory, Springer GTM 207, 2001.
6. T. Huang and C. R. Liu, "Spectral Characterization of Generalized Odd Graphs", Graph and Combinatorics, 15, 1999, pp. 195-209.
7. A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan Graphs", Combinatorical, vol.8, 1988, pp. 261-277.
8. O. S. Rothaus, "On Bent Functions", J. Combinatorial Theory (A), vol. 20, 1976, pp. 300-305.