Two Characterizations of Crooked Functions
Chris D. Godsil, Aidan Roy · IEEE Transactions on Information Theory · 2008
In this correspondence, 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.