Shannon Lower Bound
Suppose we are given an algorithm that compresses a string x of length n and the algorithm only uses the frequencies of the symbols {a1,a2,...,am} in the string as input.
Let c(x) be the compressed result represented in bit.
and ni is the frequency of ai.