A Note on a Combinatorial Conjecture
نویسنده
چکیده
It is difficult to find Boolean functions achieving many good cryptographic properties. Recently, Tu and Deng obtained two classes of Boolean functions with good properties based on a combinatorial conjecture about binary strings. In this paper, using different approaches, we prove this conjecture is true in some cases. This conjecture has resisted different attempts of proof since it is hard to find a recursive method. In this paper we give a recursive formula in a special case.
منابع مشابه
A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملOn a generalized combinatorial conjecture involving addition mod 2 k − 1 Gérard
In this note, we give a simple proof of the combinatorial conjecture proposed by Tang, Carlet and Tang, based on which they constructed two classes of Boolean functions with many good cryptographic properties. We also give more general properties about the generalization of the conjecture they propose.
متن کاملNote: On Hanlon's Eigenvalue Conjecture
has conjectured an explicit formula for the eigenvalues of certain combinatorial matrices related to the cohomology of nilpotent Lie algebras. Several special cases of this conjecture are now established. 1996 Academic Press, Inc.
متن کاملA Note on a Combinatorial Interpretation of the e-Coefficients of the Chromatic Symmetric Function
Stanley has studied a symmetric function generalization XG of the chromatic polynomial of a graph G. The innocent-looking Stanley-Stembridge Poset Chain Conjecture states that the expansion of XG in terms of elementary symmetric functions has nonnegative coefficients if G is a clawfree incomparability graph. Here we give a combinatorial interpretation of these coefficients by combining Gasharov...
متن کاملA Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کامل