Range coding, the Glossary
Range coding (or range encoding) is an entropy coding method defined by G. Nigel N. Martin in a 1979 paper,, Video & Data Recording Conference, Southampton, UK, July 24–27, 1979.[1]
Table of Contents
16 relations: Arithmetic coding, Asymmetric numeral systems, Binary number, Byte, Data compression, Decimal, Entropy coding, Fraction, Huffman coding, Integer, Multiscale Electrophysiology Format, Open source, Power of two, Probability distribution, Shannon–Fano coding, Southampton.
- Entropy coding
Arithmetic coding
Arithmetic coding (AC) is a form of entropy encoding used in lossless data compression. Range coding and Arithmetic coding are data compression and entropy coding.
See Range coding and Arithmetic coding
Asymmetric numeral systems
Asymmetric numeral systems (ANS)J. Range coding and Asymmetric numeral systems are data compression.
See Range coding and Asymmetric numeral systems
Binary number
A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method for representing numbers that uses only two symbols for the natural numbers: typically "0" (zero) and "1" (one).
See Range coding and Binary number
Byte
The byte is a unit of digital information that most commonly consists of eight bits.
Data compression
In information theory, data compression, source coding, or bit-rate reduction is the process of encoding information using fewer bits than the original representation.
See Range coding and Data compression
Decimal
The decimal numeral system (also called the base-ten positional numeral system and denary or decanary) is the standard system for denoting integer and non-integer numbers.
Entropy coding
In information theory, an entropy coding (or entropy encoding) is any lossless data compression method that attempts to approach the lower bound declared by Shannon's source coding theorem, which states that any lossless data compression method must have an expected code length greater than or equal to the entropy of the source. Range coding and entropy coding are data compression.
See Range coding and Entropy coding
Fraction
A fraction (from fractus, "broken") represents a part of a whole or, more generally, any number of equal parts.
Huffman coding
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. Range coding and Huffman coding are data compression.
See Range coding and Huffman coding
Integer
An integer is the number zero (0), a positive natural number (1, 2, 3,...), or the negation of a positive natural number (−1, −2, −3,...). The negations or additive inverses of the positive natural numbers are referred to as negative integers.
Multiscale Electrophysiology Format
Multiscale Electrophysiology Format (MEF) was developed to handle the large amounts of data produced by large-scale electrophysiology in human and animal subjects.
See Range coding and Multiscale Electrophysiology Format
Open source
Open source is source code that is made freely available for possible modification and redistribution.
See Range coding and Open source
Power of two
A power of two is a number of the form where is an integer, that is, the result of exponentiation with number two as the base and integer as the exponent.
See Range coding and Power of two
Probability distribution
In probability theory and statistics, a probability distribution is the mathematical function that gives the probabilities of occurrence of possible outcomes for an experiment.
See Range coding and Probability distribution
Shannon–Fano coding
In the field of data compression, Shannon–Fano coding, named after Claude Shannon and Robert Fano, is one of two related techniques for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured). Range coding and Shannon–Fano coding are data compression and entropy coding.
See Range coding and Shannon–Fano coding
Southampton
Southampton is a port city in Hampshire, England.
See Range coding and Southampton
See also
Entropy coding
- Arithmetic coding
- Context-adaptive binary arithmetic coding
- Context-adaptive variable-length coding
- Elias delta coding
- Elias gamma coding
- Elias omega coding
- Entropy coding
- Even–Rodeh coding
- Exponential-Golomb coding
- Golomb coding
- Levenshtein coding
- Range coding
- Shannon–Fano coding
- Truncated binary encoding
- Unary coding
- Universal code (data compression)
- Variable-length code
References
[1] https://en.wikipedia.org/wiki/Range_coding
Also known as Range encoder, Range encoding.