Abstract
Let k be a positive integer. For any positive integer x = Σ ∞ i=0 x i 2i, where x i = 0, 1, we define the weight w(x) of x by w(x) ≔ Σ ∞ i=0 x i . For any integer t with 0 < t < 2k − 1, let S t ≔ {(a, b) ∈ ℤ2|a + b ≡ t (mod 2k − 1), w(a) + w(b) < k, 0 ≤ a, b ≤ 2k − 2}. This paper gives explicit formulas for cardinality of S t in the cases of w(t) ≤ 3 and an upper bound for cardinality of S t when w(t) = 4. From this one then concludes that a conjecture proposed by Tu and Deng in 2011 is true if w(t) ≤ 4.
Similar content being viewed by others
References
Tu Z and Deng Y, A conjecture about binary strings and its applications on constructing Boolean function with optimal algebraic immunity, Des. Codes Cryptogr., 2011, 60: 1–14.
Tu Z and Deng Y, Boolean functions with algebraic immunity one, Journal of Systems Science and Mathematical Sciences, 2011, 31(5): 512–518.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research was supported partially by the National Science Foundation of China under Grant No. 11371260 and the Youth Foundation of Sichuan University Jinjiang College under Grant No. QJ141308.
This paper was recommended for publication by Editor HU Lei.
Rights and permissions
About this article
Cite this article
Cheng, K., Hong, S. & Zhong, Y. A note on the Tu-Deng conjecture. J Syst Sci Complex 28, 702–724 (2015). https://doi.org/10.1007/s11424-015-2240-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-015-2240-3