Two characterizations of crooked functions [article]

Aidan Roy, Chris Godsil
2007 arXiv   pre-print
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.
arXiv:0704.1293v1 fatcat:gqaa32dck5al3iucdw4tufspcm