A Note on a Combinatorial Conjecture

• 作者: Guixin Deng
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: BINARY STRING WEIGHT
• 年，卷（期）: 2013,（1）
• 页码范围: 49-52
• 页数: 4页
• 分类号: O1

摘要

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.