当前位置:
X-MOL 学术
›
Des. Codes Cryptogr.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
An asymptotic lower bound on the number of bent functions
Designs, Codes and Cryptography ( IF 1.4 ) Pub Date : 2023-05-19 , DOI: 10.1007/s10623-023-01239-z V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov
中文翻译:
弯曲函数数量的渐近下界
更新日期:2023-05-21
Designs, Codes and Cryptography ( IF 1.4 ) Pub Date : 2023-05-19 , DOI: 10.1007/s10623-023-01239-z V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov
A Boolean function f on n variables is said to be a bent function if the absolute value of all its Walsh coefficients is \(2^{n/2}\). Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on a modification of the Maiorana–McFarland family of bent functions and recent progress in the estimation of the number of transversals in latin squares and hypercubes. By-products of our proofs are the asymptotics of the logarithm of the numbers of partitions of the Boolean hypercube into 2-dimensional affine and linear subspaces.
中文翻译:
弯曲函数数量的渐近下界
如果所有沃尔什系数的绝对值为\(2^{n/2}\) ,则n 个变量的布尔函数f被称为弯曲函数。我们的主要结果是布尔弯曲函数数量的新渐近下界。它基于 Maiorana–McFarland 弯曲函数族的修改以及最近在估计拉丁方和超立方体的横截数方面取得的进展。我们证明的副产品是布尔超立方体划分为二维仿射和线性子空间的数量的对数渐近。