Abstract
Text compression requires numbers to represented as compactly as possible, especially the more-frequent values. This chapter describes various compact representations, and especially the "Universal Codes" to represent arbitrarily large values. Many of these codes are seldom mentioned in general literature.
Keywords: Shannon-Fano codes, Human codes, Elias` α, β, γ and ω codes, Rice codes, Golomb codes, start-step-stop codes, ternary comma codes, Fibonacci codes, Goldbach and Ibsen codes, Wheeler 1/2 code.
About this chapter
Cite this chapter as:
Peter Fenwick ;Universal (Variable Length) Codes, Introduction to Computer Data Representation (2014) 1: 159. https://doi.org/10.2174/9781608058822114010012
DOI https://doi.org/10.2174/9781608058822114010012 |
Publisher Name Bentham Science Publisher |