Range coding
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
Range coding (or 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.
Nº Q818947 ★
Common · History
Range coding
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
Range coding (or 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.
From Wikipedia
Range coding (or 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 coding, except that coding 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 coding 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.
Text: Wikipédia, CC BY-SA 4.0. · Image: jasco (talk) (CC BY-SA 3.0) ·
Related cards
-
Unique formula identifier
European hazardous material identifier
Nº Q61745460 ★
Not listed
-
Geohash
Similarity-hashing function invented in 2008, specific for geographic coordinates compressing or for location clustering
Nº Q3101207 ★★
Not listed
-
Runic (Unicode block)
Unicode block (U+16A0-16FF) containing letters, punctuation marks and numeral symbols from various old Germano-Nordic runic scripts
Nº Q2494047 ★★
Not listed
-
K
Knuth's up-arrow notation
Method of notation of very large integers
Nº Q908427 ★★★
Not listed
-
I
ISO/IEC 646
International standard for 7-bit character encoding, adapted to several simplified Latin alphabets
Nº Q764925 ★
Not listed
-
K
Kaprekar's routine
Iterative algorithm
Nº Q18413622 ★★★★
Not listed
-
R
Rabin–Karp algorithm
String searching algorithm
Nº Q1384131 ★
Not listed
-
F
Faà di Bruno's formula
Theorem
Nº Q1437653 ★
Not listed
-
L
Linear-feedback shift register
Type of shift register in computing
Nº Q681101 ★★
Not listed
-
JPEG File Interchange Format
Compressed image file format
Nº Q26329975 ★★
Not listed
-
Integer programming
Mathematical optimization problem in which variables are restricted to be integers
Nº Q6042592 ★★
Not listed
-
U
UTF-32
Format for transforming texts encoded with 4 bytes per code point in the universal character set defined by ISO/IEC 10646 and the Unicode Standard
Nº Q736068 ★
Not listed
-
R
Risch algorithm
Algorithm used to compute integrals of functions, especially used in computer algebra systems
Nº Q1382512 ★
Not listed
-
S
System F
Typed lambda calculus
Nº Q2552799 ★
Not listed
-
POCSAG
Communications protocol
Nº Q1412087 ★
Not listed
-
T
TPK algorithm
Program to compare computer programming languages
Nº Q7831057 ★★
Not listed
-
B
Brent's method
Root-finding algorithm
Nº Q905988 ★
Not listed
-
R
Regula falsi
Root-finding algorithm
Nº Q1476057 ★★
Not listed