Abstract: The problem of counting all inequivalent monotone Boolean functions of nine variables is considered. We solve the problem using known algorithms and deriving new ones when necessary. We ...
Abstract: In this paper, we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak and strong) octa/hexadeca and, in general, 2 k-bent ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback