Login / Signup
Tight upper bounds on the redundancy of Huffman codes.
Renato M. Capocelli
Alfredo De Santis
Published in:
IEEE Trans. Inf. Theory (1989)
Keyphrases
</>
upper bound
lower bound
worst case
upper and lower bounds
tight bounds
lower and upper bounds
error correction
branch and bound
error probability
branch and bound algorithm
multiple description coding
sample size
efficiently computable
optimal solution
low complexity
decoding algorithm
permutation flowshop