Range encoding is an entropy coding method defined by G. Nigel N. Martin in a 1979 paper, which effectively rediscovered the FIFO arithmetic code first introduced by Richard Clark Pasco in 1976. Given a stream of symbols and their probabilities, a range coder produces a space efficient stream of bits to represent these symbols and, given the stream and the probabilities, a range decoder reverses the process.
Range coding is very similar to arithmetic encoding, except that encoding is done with digits in any base, instead of with bits, and so it is faster when using larger bases (e.g. a byte) at small cost in compression efficiency. After the expiration of the first (1978) arithmetic coding patent, range encoding appeared to clearly be free of patent encumbrances. This particularly drove interest in the technique in the open source community. Since that time, patents on various well-known arithmetic coding techniques have also expired.
Read more about Range Encoding: How Range Encoding Works, Relationship With Arithmetic Coding
Famous quotes containing the word range:
“The Canadians of those days, at least, possessed a roving spirit of adventure which carried them further, in exposure to hardship and danger, than ever the New England colonist went, and led them, though not to clear and colonize the wilderness, yet to range over it as coureurs de bois, or runners of the woods, or, as Hontan prefers to call them, coureurs de risques, runners of risks; to say nothing of their enterprising priesthood.”
—Henry David Thoreau (1817–1862)