Average codelength theorem points out that the average codelength cannot be small than the low bound ( ), otherwise the uniquely decodable code do not exist.
A、H(S)
B、H(S)+log(r)
C、H(S) log(r)
D、H(S)/log(r)