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
-
Data Encryption Standard
Early unclassified symmetric-key block cipher
Nº Q135035 ★★
Not listed
-
Bi-quinary coded decimal
Numeral encoding scheme
Nº Q864961 ★
Not listed
-
P
Pascal's rule
Combinatorial identity about binomial coefficients
Nº Q17099544 ★★
Not listed
-
Newton–Cotes formulas
Formulas for numerical integration
Nº Q944241 ★
Not listed
-
X
X.690
ITU-T recommendation
Nº Q797714 ★
Not listed
-
Kolmogorov complexity
Measure of algorithmic complexity
Nº Q1456811 ★★★
Not listed
-
B
Binary-to-text encoding
Scheme for encoding arbitrary binary data as plain text
Nº Q3775042 ★
Not listed
-
Legendre transformation
Involutive transformation on real-valued convex functions of one real variable
Nº Q908652 ★★
Not listed
-
E
Encoding/decoding model of communication
Cultural studies model
Nº Q2889000 ★
Not listed
-
K
Key size
Number of bits in a key used by a cryptographic algorithm
Nº Q1557574 ★
Not listed
-
F
FIPS 140-3
U.S. government cryptographic standard
Nº Q5425842 ★
Not listed
-
I
ISO/IEC 2022
Higher-level 7-bit and 8-bit character encoding system
Nº Q1197730 ★
Not listed
-
V
Verbal arithmetic
A puzzle of reconstructing equations that have been enciphered into words
Nº Q1332573 ★
Not listed
-
Introduction to entropy
Non-technical introduction to entropy
Nº Q6058959 ★
Not listed
-
S
Sloot Digital Coding System
Dutch computer scientst
Nº Q1682224 ★
Not listed
-
G
Gauss–Legendre algorithm
Quadratically converging iterative algorithm for computing π
Nº Q2448949 ★
Not listed
-
Grover's algorithm
Quantum unstructured search algorithm that finds with high probability the unique input to a black box function that produces a particular output value using 𝑂(𝑁) evaluations
Nº Q1028292 ★★
Not listed
-
Arithmetical hierarchy
Hierarchy which classifies certain sets based on the complexity of formulas that define them
Nº Q669094 ★
Not listed