Everything about Universal code (data compression)
Type of prefix code
In data compression, a universal code for integers is a prefix code that maps the positive integers onto binary codewords, with the additional property that whatever the true probability distribution on integers, as long as the distribution is monotonic (i.e., p(i) ≥ p(i + 1) for all positive i), the expected lengths of the codewords are within a constant factor of the expected lengths that the optimal code for that probability distribution would have assigned. A universal code is asymptotically optimal if the ratio between actual and optimal expected lengths is bounded by a function of the information entropy of the code that, in addition to being bounded, approaches 1 as entropy approaches infinity. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Universal code (data compression)A 5-minute orientation
- Pick up a classic book: Coding theoryThe most-reprinted book on the subject
- Read the landmark paper: Structured grammar-based codes for universal lossless data compressionCited 11 times
- Go sideways: Golomb codingA closely related topic
- Go sideways: Huffman codingA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Coding theoryChaoping Xing, Sanjiv Lingayah · 2004
A student's guide to coding and information theoryStefan M. Moser · 2012
Digital signal compressionWilliam A. Pearlman · 2011
Compressive Sensing for Wireless NetworksHusheng Li · 2013
Classical and Quantum Information TheoryEmmanuel Desurvire · 2009
Digital systems testing and testable designMiron Abramovici · 1990
Classical thermodynamicsLynn D. Russell · 1993- 📕Multi-stage decoding for multi-level block modulation codesShu Lin · 1991
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Golomb coding Golomb coding is a lossless data compression method using a family of data compression codes invented by Solomon W. Golomb in the 1960s. Alphabets following…
- 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…
- Prefix code A prefix code is a type of code system distinguished by its possession of the prefix property, which requires that there is no whole code word in the system…
- Elias gamma coding Elias γ code or Elias gamma code is a universal code encoding positive integers developed by Peter Elias. It is used most commonly when coding integers…
- Unary coding Unary coding, or the unary numeral system, is an entropy encoding that represents a natural number, n, with n ones followed by a zero (if the term natural…
- 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…
- 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…
- Arithmetic coding Arithmetic coding (AC) is a form of entropy coding used in lossless data compression. Normally, a string of characters is represented using a fixed number…