Everything about Tunstall coding

🧭 Start here: a 6-step reading path

1. Read the overview: Tunstall codingA 5-minute orientation
2. Pick up a classic book: A new code to lifeThe most-reprinted book on the subject
3. Read the landmark paper: Tunstall adaptive coding and miscodingCited 12 times
4. Go sideways: LZ77 and LZ78A closely related topic
5. Go sideways: Lempel–Ziv–WelchA closely related topic

🏆 Landmark papers (most cited)

• Tunstall adaptive coding and miscoding

  F. Fabris, A. Sgarro, R. Pauletti · 1996 · IEEE Transactions on Information Theory · 12 citations

• On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources

  Mitsuharu ARIMURA · 2010 · IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · 3 citations

• Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources

  Mitsuharu ARIMURA · 2015 · IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · 2 citations

• Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence

  Mitsuharu ARIMURA · 2016 · IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · 1 citations

• Error performance of Tunstall coding

  J.A. Briffa, V. Buttigieg · 1999 · Electronics Letters · 0 citations

📚 Books worth reading

• A new code to lifeCaroline Vogeley Tunstall · 1918
• 📕Sensing in natureCarlos López-Larrea · 2011

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• LZ77 and LZ78 LZ77 and LZ78 are the two lossless data compression algorithms published in papers by Abraham Lempel and Jacob Ziv in 1977 and 1978. They are also known…
• Lempel–Ziv–Welch Lempel–Ziv–Welch (LZW) is a universal lossless compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in…
• 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…
• Comma code A comma code is a type of prefix-free code in which a comma, a particular symbol or sequence of symbols, occurs at the end of a code word and never occurs…
• Truncated binary encoding Truncated binary encoding is an entropy encoding typically used for uniform probability distributions with a finite alphabet. It is parameterized by an…
• Concatenated error correction code In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code. They were conceived…
• Canonical Huffman code 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…
• Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…