# Simplification of Sum of Hamming Weight Sets

Let $k,n,K,m \in \mathbb{N}$ such that $k<n$. Let $l\in \mathbb{R}$, such that $0 \leq l \leq 1$. I am analyzing an algorithm and I need $O(N)$. Could you help me with the reduction of the expression $N$: $$N=\log_S(1-\sqrt[K]{l})$$

where

$S=(\sum_{i=1}^m 2^{k-n}\binom ni)/2^{k}$

Using hint of DW, I try.

$$N=\log_S(1-\sqrt[K]{l})=\dfrac{\log_2(1-\sqrt[K]{l})}{\log_2S}=\dfrac{\log_2(1-\sqrt[K]{l})}{\log_2(\sum_{i=1}^m 2^{k-n}\binom ni)-\log_2(2^{k})}.$$

Using inequality of this answer, I get

$$N=\dfrac{\log_2(1-\sqrt[K]{l})}{nH(m/n)-1},$$

where $H$ is the binary entropy function. In my case $m<<<n$. At this point Could you help me please?

• What have you tried? What progress have you made? Have you tried anything? Hint: $\log_a b = \log b / \log a$. – D.W. Apr 16 '18 at 3:51
• @D.W. I simplified the expression, but it need more simplification ... Could you help me please? – juaninf Apr 17 '18 at 9:33
• Seems like you've found a reasonable answer. Why have you rejected it? We need a more specific question than "Could you help me?". What are you trying to achieve? What is the purpose? There are probably many equivalent formulas you could find for that expression, but we have no criteria for choosing among them. What do you want to know about this expression? Do you want to upper-bound it? Lower-bound it? Do you care only about asymptotics, ignoring constant factors? Please edit your question to make it more specific. – D.W. Apr 17 '18 at 16:08