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, Hu man 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.
