Golomb coding is a lossless data compression method using a family of data compression codes invented by Solomon W. Golomb in the 1960s. Alphabets following a geometric distribution will have a Golomb code as an optimal prefix code, making Golomb coding highly suitable for situations in which the occurrence of small values in the input stream is significantly more likely than large values.
Rice coding (invented by Robert F. Rice) denotes using a subset of the family of Golomb codes to produce a simpler (but possibly suboptimal) prefix code; Rice used this in an adaptive coding scheme, although "Rice coding" can refer to either that scheme or merely using that subset of Golomb codes. Whereas a Golomb code has a tunable parameter that can be any positive value, Rice codes are those in which the tunable parameter is a power of two. This makes Rice codes convenient for use on a computer, since multiplication and division by 2 can be implemented more efficiently in binary arithmetic.
Rice coding is used as the entropy encoding stage in a number of lossless image compression and audio data compression methods.
Contents
Overview
Use with signed integers
Golomb's scheme was designed to encode sequences of nonnegative numbers. However it is easily extended to accept sequences containing negative numbers using an overlap and interleave scheme, in which all values are reassigned to some positive number in a unique and reversible way. The sequence begins: 0, 1, 1, 2, 2, 3, 3, 4, 4 ... The n^{th} negative value (i.e., n) is mapped to the n^{th} odd number (2n1), and the m^{th} positive value is mapped to the m^{th} even number (2m). This may be expressed mathematically as follows: a positive value x is mapped to (), and a negative value y is mapped to ().
Construction of codes
Full article ▸
