Two characterizations of crooked functions
Combinatorics
2007-05-23 v1
Abstract
We give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph.
Cite
@article{arxiv.0704.1293,
title = {Two characterizations of crooked functions},
author = {Aidan Roy and Chris Godsil},
journal= {arXiv preprint arXiv:0704.1293},
year = {2007}
}
Comments
6 pages, no figures