Two characterizations of crooked functions

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.

6 pages, no figures