Dictionary Encoding Algorithm

A Dictionary Encoding Algorithm is a Lossless Data Compression Algorithm that is used to build a dictionary of the compressed data.

• AKA: Dictionary Coder, Substitution Coder.
• Example(s):
  • Byte-Pair Encoding (BPE) Algorithm,
  • Deflate Algorithm,
  • Lempel-Ziv Algorithm.
  • …
• Counter-Example(s):
  • Context Tree Weighting (CTW) Algorithm,
  • Entropy Encoding Algorithm,
  • Lossy Compression Algorithm.
• See: Data Structure, Data Processing Algorithm, Natural Language Processing Algorithm, String (Computer Science), Image Compression Algorithm, Lossy Compression Algorithm, Burrows-Wheeler Transform, Delta Encoding Algorithm, Dynamic Markov Compression Algorithm, BPEmb.

---

---

References

2021

• (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Dictionary_coder Retrieved:2021-5-2.
  • A dictionary coder, also sometimes known as a substitution coder, is a class of lossless data compression algorithms which operate by searching for matches between the text to be compressed and a set of strings contained in a data structure (called the 'dictionary') maintained by the encoder. When the encoder finds such a match, it substitutes a reference to the string's position in the data structure.

---