# Two characterizations of crooked functions

## TL;DR

This paper presents two new characterizations of crooked functions, linking them to properties of certain codes and graphs, which enhances understanding of their structure and potential applications.

## Contribution

It introduces two novel characterizations of crooked functions, connecting them to code minimum distance and graph distance-regularity, expanding theoretical understanding.

## Key findings

- Crooked functions characterized by code minimum distance
- Crooked functions characterized by graph distance-regularity
- Provides new theoretical tools for analyzing 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.