Crooked Functions, Bent Functions, and Distance Regular Graphs
暂无分享,去创建一个
Let $V$ and $W$ be $n$-dimensional vector spaces over $GF(2)$. A mapping $Q:V\rightarrow W$ is called crooked if it satisfies the following three properties: $Q(0)=0$; $Q(x)+Q(y)+Q(z)+Q(x+y+z)\neq 0$ for any three distinct $x,y,z$; $Q(x)+Q(y)+Q(z)+Q(x+a)+Q(y+a)+Q(z+a)\neq 0$ if $a\neq 0$ ($x,y,z$ arbitrary). We show that every crooked function gives rise to a distance regular graph of diameter 3 having $\lambda=0$ and $\mu=2$ which is a cover of the complete graph. Our approach is a generalization of a recent construction found by de Caen, Mathon, and Moorhouse. We study graph-theoretical properties of the resulting graphs, including their automorphisms. Also we demonstrate a connection between crooked functions and bent functions.
[1] O. S. Rothaus,et al. On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.
[2] Chris D. Godsil,et al. Distance regular covers of the complete graph , 1992, J. Comb. Theory, Ser. B.
[3] D. D. Caen,et al. A Family of Antipodal Distance-Regular Graphs Related to the Classical Preparata Codes , 1995 .
[4] Peter J. Cameron,et al. Designs, graphs, codes, and their links , 1991 .