Upper bounding the number of bent functions using 2-row bent rectangles

MaRDI QIDQ6152275zbMATH OpenFDO

Authors Sergey Agievich

Publication date 11 March 2024

Full work available at URL https://vestifm.belnauka.by/jour/article/view/712

zbMATH Keywords

bent functionWalsh-Hadamard spectrumnear-bent functionnumber of bent functionsbent rectangle

Mathematics Subject Classification ID

Boolean functions (94D10) Boolean algebras (Boolean rings) (06Exx)

Recommendations

• A best possible computable upper bound on bent functions
• On the number of bent functions with 8 variables
• Bent Rectangles

Cites work

• scientific article; zbMATH DE number 6508183 (Why is no real title available?)
• scientific article; zbMATH DE number 177031 (Why is no real title available?)
• Bent Rectangles
• Bent functions. Fundamentals and results
• Boolean functions for cryptography and coding theory
• Construction of bent functions from near-bent functions
• Counting all bent functions in dimension eight 99270589265934370305785861242880
• On ``bent functions

This page was built for publication: Upper bounding the number of bent functions using 2-row bent rectangles

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