Editing List of algorithms (section)

====Lossless compression algorithms====
{{main|:Category:Lossless compression algorithms|l1=Lossless compression algorithms}}
* [[Burrows–Wheeler transform]]: preprocessing useful for improving [[Lossless data compression|lossless compression]]
* [[Context tree weighting]]
* [[Delta encoding]]: aid to compression of data in which sequential data occurs frequently
* [[Dynamic Markov compression]]: Compression using predictive arithmetic coding
* [[Dictionary coder]]s
** [[Byte pair encoding]] (BPE)
** [[Deflate]]
** [[Lempel–Ziv]]
*** [[LZ77 and LZ78]]
*** [[LZJB|Lempel–Ziv Jeff Bonwick]] (LZJB)
*** [[Lempel–Ziv–Markov chain algorithm]] (LZMA)
*** [[Lempel–Ziv–Oberhumer]] (LZO): speed oriented
*** [[Lempel–Ziv–Stac]] (LZS)
*** [[Lempel–Ziv–Storer–Szymanski]] (LZSS)
*** [[Lempel–Ziv–Welch]] (LZW)
*** [[LZWL]]: syllable-based variant
*** [[LZX]]
*** [[LZRW|Lempel–Ziv Ross Williams]] (LZRW)
* [[Entropy encoding]]: coding scheme that assigns codes to symbols so as to match code lengths with the probabilities of the symbols
** [[Arithmetic coding]]: advanced [[entropy]] coding
*** [[Range encoding]]: same as [[arithmetic coding]], but looked at in a slightly different way
** [[Huffman coding]]: simple lossless compression taking advantage of relative character frequencies
*** [[Adaptive Huffman coding]]: [[adaptive coding]] technique based on Huffman coding
*** [[Package-merge algorithm]]: Optimizes Huffman coding subject to a length restriction on code strings
** [[Shannon–Fano coding]]
** [[Shannon–Fano–Elias coding]]: precursor to arithmetic encoding<ref>{{Cite web |title=Shannon-Fano-Elias Coding |url=https://my.ece.msstate.edu/faculty/fowler/Classes/ECE8813/Handouts/shannon_fano_elias.pdf |url-status=dead |archive-url=https://web.archive.org/web/20210228164521/https://my.ece.msstate.edu/faculty/fowler/Classes/ECE8813/Handouts/shannon_fano_elias.pdf |archive-date=2021-02-28 |access-date=2023-10-11 |website=my.ece.msstate.edu}}</ref>
* [[Entropy encoding|Entropy coding with known entropy characteristics]]
** [[Golomb coding]]: form of entropy coding that is optimal for alphabets following geometric distributions
** [[Rice coding]]: form of entropy coding that is optimal for alphabets following geometric distributions
** [[Truncated binary encoding]]
** [[Unary coding]]: code that represents a number n with n ones followed by a zero
** [[Universal code (data compression)|Universal codes]]: encodes positive integers into binary code words
*** Elias [[Elias delta coding|delta]], [[Elias gamma coding|gamma]], and [[Elias omega coding|omega]] coding
*** [[Exponential-Golomb coding]]
*** [[Fibonacci coding]]
*** [[Levenshtein coding]]
* [[FELICS|Fast Efficient & Lossless Image Compression System]] (FELICS): a lossless image compression algorithm
* [[Incremental encoding]]: delta encoding applied to sequences of strings
* [[PPM compression algorithm|Prediction by partial matching]] (PPM): an adaptive statistical data compression technique based on context modeling and prediction
* [[Run-length encoding]]: lossless data compression taking advantage of strings of repeated characters
* [[SEQUITUR algorithm]]: lossless compression by incremental grammar inference on a string