On a Combinatorial Conjecture
Cusick, Thomas W.
MetadataShow full item record
Recently, Tu and Deng proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, the first of which are also bent functions. The second class gives balanced function, which have optimal algebraic degree and the best nonlinearity known up to now. In this paper, using three differenct approaches, we prove this conjecture is true in many cases with different counting strategies. We also propose some problems about the weight equation which are related to this conjecture. Because of the scattered distribution, we predict that an exact count is difficult to obtain, in general.
Showing items related by title, author, creator and subject.
Carter, Jason W. (Monterey, California. Naval Postgraduate School, 1997-09);Heuristic methods of solving exploratory data analysis problems suffer from one major weakness - uncertainty regarding the optimality of the results. The developers of DaMI (Data Mining Initiative), a genetic algorithm ...
The Fourier Entrophy-Influence Conjecture Holds for a Log-Density 1 Class of Cryptographic Boolean Functions Gangopadhyay, Sugata; Stanica, Pantelimon (2014);We consider the Fourier Entropy-Infuence (FEI) conjecture in the context of cryptographic Boolean functions. We show that the FEI conjecture is true for the functions satisfying the strict avalanche criterion, which forms ...
The Fourier Entropy-Influence Conjecture Holds for a Log-Density 1 Class of Cryptographic Boolean Functions Stănică, Pantelimon; Gangopadhyay, Sugata (2014-01-25);We consider the Fourier Entropy-Infl uence (FEI) conjecture in the context of cryptographic Boolean functions. We show that the FEI con jecture is true for the functions satisfying the strict avalanche criterion, ...