Classifying bent functions by their Cayley graphs
Combinatorics
2018-12-13 v6
Abstract
In 1999 Bernasconi and Codenotti noted that the Cayley graph of a bent function is strongly regular. This paper describes the concept of extended Cayley equivalence of bent functions, discusses some connections between bent functions, designs, and codes, and explores the relationship between extended Cayley equivalence and extended affine equivalence. SageMath scripts and CoCalc worksheets are used to compute and display some of these relationships, for bent functions up to dimension 8.
Cite
@article{arxiv.1705.04507,
title = {Classifying bent functions by their Cayley graphs},
author = {Paul Leopardi},
journal= {arXiv preprint arXiv:1705.04507},
year = {2018}
}
Comments
69 pages, 54 figures, 24 tables. Revised after the previous version was rejected by INTEGERS Journal. Warning: Because the previous version was rejected, the results presented here are not properly vetted and may still be incorrect