Article citationsMore>>

G. Deng and P. Yuan, “On a Combinatorial Conjecture of Tu and Deng,” Integers, Vol. 12, No. A48, 2012.

has been cited by the following article:

• TITLE: A Note on a Combinatorial Conjecture

  AUTHORS: Guixin Deng

  KEYWORDS: Binary String; Weight

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.3 No.1, January 29, 2013

  ABSTRACT: 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.