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

MaRDI QIDQ6152275FDOQ6152275

Authors: Sergey Agievich 

Publication date: 11 March 2024

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

Recommendations

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Construction of bent functions from near-bent functions
• On ``bent functions
• Bent functions. Fundamentals and results
• Title not available (Why is that?)
• Counting all bent functions in dimension eight 99270589265934370305785861242880
• Title not available (Why is that?)
• Boolean functions for cryptography and coding theory
• Bent Rectangles

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)