Two characterizations of crooked functions
Aidan Roy, Chris Godsil
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.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research