Variations on a theme by Huffman

DOI10.1109/TIT.1978.1055959zbMath0399.94012OpenAlexW2038649859MaRDI QIDQ4184761

Robert G. Gallager

Publication date: 1978

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1978.1055959

zbMATH Keywords

RedundancyArithmetic CodeBinary Huffman CodeBinary Prefix Condition Code

Mathematics Subject Classification ID

Arithmetic codes (94B40) Prefix, length-variable, comma-free codes (94A45)

Related Items (26)

Block Huffman coding ⋮ Optimal Skeleton Huffman Trees Revisited ⋮ Lossless compression schemes for ECG signals using neural network predictors ⋮ Dynamic Shannon coding ⋮ Worst-Case Optimal Adaptive Prefix Coding ⋮ ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC ⋮ A fast algorithm for adaptive prefix coding ⋮ On the redundancy achieved by Huffman codes ⋮ Weighted forward looking adaptive coding ⋮ A fast dynamic compression scheme for natural language texts ⋮ Exact and approximation algorithms for error-detecting even codes ⋮ Algorithmic information and simplicity in statistical physics ⋮ Is Huffmann coding dead? ⋮ Minimax trees in linear time with applications ⋮ A fast and efficient nearly-optimal adaptive Fano coding scheme ⋮ Optimal binary search trees ⋮ Optimal prefix codes with fewer distinct codeword lengths are faster to construct ⋮ Parity codes ⋮ Generating probabilities with a specified entropy ⋮ Forward looking Huffman coding ⋮ An efficient layered data compression scheme with constraint analysis ⋮ The \(S\)-digraph optimization problem and the greedy algorithm ⋮ Maximal codeword lengths in Huffman codes ⋮ New bounds on \(D\)-ary optimal codes ⋮ Approximate counting: a detailed analysis ⋮ Text compression methods

This page was built for publication: Variations on a theme by Huffman