Algorithms that make data smaller, such as LZW, LZ77, DEFLATE, Huffman coding, arithmetic coding, run-length encoding, Zstandard and Brotli. An algorithm belongs here when its cited article calls it a compression algorithm or a coding method for compression. It excludes algorithms that only search or compare strings. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.
All Data Compression Algorithms
Filter Results21 entries
Sources
Inter Frame (Wikipedia)
Delta encoding (Wikipedia)
Has Member: Delta encoding, Lead, second paragraphQuote, Has Member: Delta encoding, Lead, second paragraph
delta encoding greatly reduces data redundancy
View the Source LZ4 (compression algorithm) (Wikipedia)
Has Member: LZ4 (compression algorithm), LeadQuote, Has Member: LZ4 (compression algorithm), Lead
LZ4 is a lossless data compression algorithm optimized for fast compression and decompression.
View the Source Lempel-Ziv-Oberhumer (Wikipedia)
Has Member: Lempel-Ziv-Oberhumer, LeadQuote, Has Member: Lempel-Ziv-Oberhumer, Lead
(LZO) is a lossless data compression algorithm that is focused on decompression speed.
View the Source Lempel-Ziv-Storer-Szymanski (source article)
Has Member: Lempel-Ziv-Storer-Szymanski, LeadQuote, Has Member: Lempel-Ziv-Storer-Szymanski, Lead
is a lossless data compression algorithm, a derivative of LZ77
View the Source Canonical Huffman code (Wikipedia)
Has Member: Canonical Huffman code, LeadQuote, Has Member: Canonical Huffman code, Lead
In computer science and information theory, a canonical Huffman code is a particular type of Huffman code with unique properties which allow it to be described in a very compact manner.
View the Source LZX (Wikipedia)
Has Member: LZX, Lead sectionQuote, Has Member: LZX, Lead section
LZX is an LZ77 family compression algorithm, a slightly improved version of DEFLATE.
View the Source Zopfli (Wikipedia)
Has Member: Zopfli, Lead sectionQuote, Has Member: Zopfli, Lead section
Zopfli is a data compression library that performs deflate, gzip and zlib data encoding
View the Source Lempel-Ziv-Welch (Wikipedia)
Has Member: LZW Algorithm, Lead sectionQuote, Has Member: LZW Algorithm, Lead section
universal lossless compression algorithm
View the Source LZ77 and LZ78 (Wikipedia)
Has Member: LZ77 Algorithm, Lead section
are the two lossless data compression algorithms
Has Member: LZ78 Algorithm, Lead section
are the two lossless data compression algorithms
View the SourceDeflate (Wikipedia)
Has Member: DEFLATE Algorithm, Lead sectionQuote, Has Member: DEFLATE Algorithm, Lead section
is a lossless data compression algorithm
View the Source Wikipedia: Huffman coding
Wikimedia FoundationHas Member: Huffman Coding Algorithm, Lead sectionQuote, Has Member: Huffman Coding Algorithm, Lead section
commonly used for lossless data compression
View the Source LZMA (Wikipedia)
Has Member: LZMA Algorithm, Lead sectionQuote, Has Member: LZMA Algorithm, Lead section
is a lossless data compression algorithm
View the Source Zstd (Wikipedia)
Has Member: Zstandard Algorithm, Lead sectionQuote, Has Member: Zstandard Algorithm, Lead section
is a lossless data compression algorithm
View the Source Brotli (Wikipedia)
Has Member: Brotli Algorithm, Lead sectionQuote, Has Member: Brotli Algorithm, Lead section
is a lossless data compression algorithm
View the Source Shannon-Fano coding (Wikipedia)
Has Member: Shannon-Fano Coding Algorithm, Lead sectionQuote, Has Member: Shannon-Fano Coding Algorithm, Lead section
In the field of data compression, Shannon-Fano coding
View the Source Byte-pair encoding (Wikipedia)
Has Member: Byte Pair Encoding Algorithm, Lead sectionQuote, Has Member: Byte Pair Encoding Algorithm, Lead section
for encoding strings of text into smaller strings
View the Source Prediction by partial matching (Wikipedia)
Has Member: Prediction by Partial Matching Algorithm, Lead sectionQuote, Has Member: Prediction by Partial Matching Algorithm, Lead section
adaptive statistical data compression technique
View the Source Burrows-Wheeler transform, Wikipedia
Has Member: Burrows-Wheeler Transform Algorithm, LeadQuote, Has Member: Burrows-Wheeler Transform Algorithm, Lead
The Burrows-Wheeler transform (BWT) rearranges a character string into runs of similar characters, in a manner that can be reversed to recover the original string.
View the Source NIST Dictionary of Algorithms and Data Structures: arithmetic coding
NIST Dictionary of Algorithms and Data StructuresHas Member: Arithmetic Coding Algorithm, DefinitionQuote, Has Member: Arithmetic Coding Algorithm, Definition
A minimal variable-length message coding based on the frequency of each character.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.