Salomon D. Variable-length Codes for Data Compression

New York: Springer, 2007. - 205p.Most data compression methods that are based on variable-length codes employ the Huffman or Golomb codes. However, there are a large number of less-known codes that have useful properties and these can be useful. This book brings this large set of codes to the attention of workers in the field and for students of computer science. The author’s crystal clear style of writing and presentation allows easy access to the topic.Codes, Fixed- and Variable-Length
Prefix Codes
VLCs, Entropy, and Redundancy
Universal Codes
The Kraft–McMillan Inequality
Tunstall Code
Schalkwijk's Coding
Tjalkens–Willems V-to-B Coding
Phased-In Codes
Redundancy Feedback (RF) Coding
Recursive Phased-In Codes
Self-Delimiting Codes
Huffman CodingVLCs for Integers
Start-Step-Stop Codes
Start/Stop Codes
Elias Codes
Levenstein Code
Even–Rodeh Code
Punctured Elias Codes
Other Prefix Codes
Ternary Comma Code
Location Based Encoding (LBE)
Stout Codes
Boldi–Vigna (ζ) Codes
Yamamoto's Recursive Code
VLCs and Search Trees
Taboo Codes
Wang's Flag Code
Yamamoto Flag Code
Number Bases
Fibonacci Code
Generalized Fibonacci Codes
Goldbach Codes
Additive Codes
Golomb Code
Rice Codes
Subexponential Code
Codes Ending with ""Codes For Error Control
The Free Distance
Synchronous Prefix Codes
Resynchronizing Huffman Codes
Bidirectional Codes
Symmetric Codes
VLEC CodesSummary and Unification