Dynamic Shannon coding

DOI10.1016/j.ipl.2006.09.015zbMath1189.94040arXivcs/0503085OpenAlexW2046831124MaRDI QIDQ845979

Travis Gagie

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0503085

zbMATH Keywords

data compressionon-line algorithms

Mathematics Subject Classification ID

Source coding (94A29)

Related Items

Worst-Case Optimal Adaptive Prefix Coding ⋮ Minimax trees in linear time with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• An analysis of the Burrows—Wheeler transform
• Huffman coding with unequal letter costs
• Dynamic Asymmetric Communication
• Dynamic huffman coding
• Design and analysis of dynamic Huffman codes
• Sorting and Searching in Multisets
• Generalized Kraft Inequality and Arithmetic Coding
• Huffman codes and self-information
• Variations on a theme by Huffman
• Bounding the Compression Loss of the FGK Algorithm
• Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
• A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
• Channels which transmit letters of unequal duration
• Algorithms – ESA 2004
• A Method for the Construction of Minimum-Redundancy Codes
• An optimum encoding with minimum longest code and total number of digits
• The sound of silence: Guessing games for saving energy in a mobile environment