Feb 22, 2019 · We prove that the Tu–Deng Conjecture holds almost surely in the following sense: the proportion of t∈[1,2k−2] t ∈ [ 1 , 2 k − 2 ] such that the ...
Jul 25, 2017 · We prove that the Tu--Deng Conjecture holds almost surely in the following sense: the proportion of t\in[1,2^k-2] such that the above inequality ...
Jul 25, 2017 · We prove that the Tu–Deng Conjecture holds almost surely in the following sense: the proportion of t ∈ 11,...,2k - 2l such that the above ...
The Tu–Deng Conjecture holds almost surely in the following sense: the proportion of $t\in[1,2^k-2]$ such that the above inequality holds approaches $1$ as ...
Oct 22, 2024 · The Tu--Deng Conjecture is concerned with the sum of digits $w(n)$ of $n$ in base~$2$ (the Hamming weight of the binary expansion of $n$) ...
TL;DR: In this paper, it was shown that the Tu-Deng Conjecture holds almost surely in the following sense: the proportion of t ∈ [ 1 , 2 k − 2 ] such that ...
Spiegelhofer, L., & Wallner, M. (2019). The Tu-Deng conjecture holds almost surely. Electronic Journal of Combinatorics, 26(1). https://doi.org/10.37236/ ...
Two new results are proved about Tu-Deng's combinatorial conjecture about Boolean functions that satisfy algebraic immunity and a new family of integers is ...
Conjecture 1 holds when w(t) ≤ 10. For further researching, it's likely that we need the exact value of cases not listed in Lemma 6. Therefore, we need to.
Missing: Surely. | Show results with:Surely.
Apr 18, 2019 · This conjecture arose when Cusick was working on a related conjecture due to Tu and Deng [13, 14], which concerns binary addition modulo 2k − 1.