Two Characterizations of Crooked Functions

DOI10.1109/TIT.2007.913505zbMATH Open1311.94081arXiv0704.1293OpenAlexW2153201310MaRDI QIDQ3604652FDOQ3604652

Authors: Aidan Roy, Chris Godsil 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0704.1293

Recommendations

• Crooked functions
• Crooked functions, bent functions, and distance regular graphs
• A family of crooked functions
• The only crooked power functions are \(x^{2^k+2^l}\)
• Uniformly packed codes and more distance regular graphs from crooked functions

zbMATH Keywords

distance-regular graphnonlinear functionerror-correcting codePreparata codeAlmost perfectcrooked

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (6)

• Uniformly packed codes and more distance regular graphs from crooked functions
• The \textit{crooked} property
• A family of crooked functions
• Survey on recent trends towards generalized differential and boomerang uniformities
• Almost perfect and planar functions
• Exceptional crooked functions

This page was built for publication: Two Characterizations of Crooked Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604652)