Variable-length Codes for Data Compression
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 - such as those containing certain bit patterns, or those that are robust - and these can be useful. This book b...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
London :
Springer London,
2007.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- From the contents
- Codes, Fixed- and Variable-Length
- Prefix Codes
- VLCs, Entropy, and Redundancy
- Universal Codes
- The Kraft-MacMillan 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 Coding
- VLCs 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
- 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 '1'
- Codes for Error Control
- The Free Distance
- Synchronous Prefix Codes
- Resynchronizing Huffman Codes
- Bidirectional Codes
- Symmetric Codes
- VLEC Codes
- Summary.