Two Characterizations of Crooked Functions

DOI10.1109/TIT.2007.913505MaRDI QIDQ3604652zbMATH OpenOpenAlexFDO

Authors Aidan Roy, Chris Godsil

Publication date 24 February 2009

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

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

zbMATH Keywords

Almost perfectcrookeddistance-regular grapherror-correcting codenonlinear functionPreparata code

Mathematics Subject Classification ID

Cryptography (94A60)

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.

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

Cited in

(10)

• A family of crooked functions
• Crooked functions, bent functions, and distance regular graphs
• Uniformly packed codes and more distance regular graphs from crooked functions
• Exceptional crooked functions
• The \textit{crooked} property
• Survey on recent trends towards generalized differential and boomerang uniformities
• Examples of diameter-2 graphs with no triangle or \(K_{2,t}\)
• Resolution of the exceptional APN conjecture in the Gold degree case
• Line-parallelisms of \(\mathrm{PG}(n, 2)\) from preparata-like codes
• Almost perfect and planar 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)