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
-
Arithmetical hierarchy
Hierarchy which classifies certain sets based on the complexity of formulas that define them
Nº Q669094 ★
Not listed
-
U
UTF-8
Variable-width encoding (into one to four bytes) and transformation format of code points for the universal character set defined by ISO/IEC 10646 and The Unicode® Standard, compatible with ASCII
Nº Q193537 ★★★★
Not listed
-
Euclidean algorithm
Algorithm for computing greatest common divisors
Nº Q230848 ★★★
Not listed
-
O
Optimal asymmetric encryption padding
Padding scheme often used together with RSA encryption; a form of Feistel network which uses a pair of random oracles to process the plaintext prior to asymmetric encryption; introduced by Bellare and Rogaway; standardized in PKCS#1 v2 and RFC 2437
Nº Q1635634 ★
Not listed
-
I
ISO 31-11
ISO standard for mathematical signs and symbols for use in the physical sciences and technology
Nº Q3510991 ★
Not listed
-
F
Fibonacci heap
Heap data structure made of a forest of trees
Nº Q1410737 ★
Not listed
-
Shannon–Fano coding
Technique for constructing a prefix code
Nº Q2645 ★
Not listed
-
Geometric Shapes (Unicode block)
Unicode block (U+25A0-25FF)
Nº Q750114 ★★
Not listed
-
C
Chunked transfer encoding
Streaming data transfer mechanism in HTTP/1.1, which divides the data stream into nonoverlapping chunks sent and received independently
Nº Q2572227 ★
Not listed
-
G
Granite Rapids
Code name for Intel Xeon microprocessors (2024)
Nº Q97311775 ★★
Not listed
-
A
Alexis Hocquenghem
French mathematician (1908-1990)
Nº Q4721463 ★
Not listed
-
U
Uuencoding
Format that encodes binary data as a sequence of printable ASCII characters
Nº Q1570391 ★
Not listed
-
Feynman diagram
Pictorial representations of the behavior of subatomic particles
Nº Q386272 ★★★
Not listed
-
E
Entropy (information theory)
Expected value of the amount of information delivered by a message
Nº Q204570 ★★★
Not listed
-
S
Second normal form
Database normalization requirement after first normal form
Nº Q277396 ★★
Not listed
-
R10000
MIPS microprocessor
Nº Q3414989 ★
Not listed
-
I
Introduction to Algorithms
Book on computer programming
Nº Q1141518 ★★
Not listed
-
Newton's method
Algorithm for finding a zero of a function
Nº Q374195 ★★★
Not listed