A Note on a Combinatorial Conjecture - Open Journal of Discrete Mathematics

OJDM > Vol.3 No.1, January 2013

A Note on a Combinatorial Conjecture ()

HTML XML

Download as PDF (Size: 82KB) PP. 49-52

DOI: 10.4236/ojdm.2013.31010 5,245 Downloads 7,667 Views Citations

Author(s)

Guixin Deng

Affiliation(s)

School of Mathematical Science, Guangxi Teachers Education University, Nanning, China.

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.

KEYWORDS

Binary String; Weight

Share and Cite:

G. Deng, "A Note on a Combinatorial Conjecture," Open Journal of Discrete Mathematics, Vol. 3 No. 1, 2013, pp. 49-52. doi: 10.4236/ojdm.2013.31010.

Journals Menu