Live briefing
Everything about Golomb coding
Lossless data compression method
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 a geometric distribution will have a Golomb code as an optimal prefix code, making Golomb coding highly suitable for situations in which the occurrence of small values in the input stream is significantly more likely than large values. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Golomb codingA 5-minute orientation
- Skim a recent paper: Image Coding based Orthogonal Polynomials Multiresolution Analysis with Joint Probability Context Modeling and Modified Golomb-Rice Entropy CodingInfluential work since 2022
- Pick up a classic book: Shift register sequencesThe most-reprinted book on the subject
- Read the landmark paper: Test data compression and decompression based on internal scan chains and Golomb codingCited 37 times
- Go sideways: Universal code (data compression)A closely related topic
- Go sideways: Elias gamma codingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Test data compression and decompression based on internal scan chains and Golomb coding
Low-noise delays from dynamic Brillouin gratings based on perfect Golomb coding of pump waves
Optimal Golomb-Rice Code Extension for Lossless Coding of Low-Entropy Exponentially Distributed Sources
Adaptive Golomb Code for Joint Geometrically Distributed Data and Its Application in Image Coding
ECG compression based on wavelet transform and Golomb coding
Universal Golomb–Rice Coding Parameter Estimation Using Deep Belief Networks for Hyperspectral Image Compression
Analysis and implementation of novel Rice Golomb coding algorithm for wireless sensor networks
Exponential Golomb and Rice Error Correction Codes for Generalized Near-Capacity Joint Source and Channel Coding
🆕 Influential since 2022
Image Coding based Orthogonal Polynomials Multiresolution Analysis with Joint Probability Context Modeling and Modified Golomb-Rice Entropy Coding
Two-Stage Golomb – Context-Adaptive Binary Arithmetic Coders Coding in Lossless Image Compression
Efficient and Real-Time Compression Schemes of Multi-Dimensional Data from Ocean Buoys Using Golomb-Rice Coding
Highly Efficient Digitized Quasi-3D Photolithography Based on a Modified Golomb Coding via DMD Laser Direct Writing
VLSI architecture of a True Random Number Generator with hierarchical Von Neumann corrector and hybrid run length-Golomb coding for data compression
📚 Books worth reading
- 📕Shift register sequencesSolomon W. Golomb · 1967
Basic Concepts in Information Theory and CodingSolomon W. Golomb · 1994
Shift register sequencesSolomon W. Golomb · 1967
Basic concepts in information theory and codingSolomon W. Golomb · 1994- 📕Shift register sequences [by] Solomon W. Golomb, with portions co-authored by Lloyd R. Welch, Richard M. Goldstein and Alfred W. HalesSolomon W. Golomb · 1967
Sequences And Their Applications Seta 2008 5th International Conference Lexington Ky Usa September 1418 2008 ProceedingsSolomon W. Golomb · 2008
Sequences, Subsequences, and ConsequencesSolomon W. Golomb · 2007- 📕Information, Coding and MathematicsRobert J. McEliece, Mario Blaum · 2002
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Universal code (data compression) In data compression, a universal code for integers is a prefix code that maps the positive integers onto binary codewords, with the additional property…
- 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…
- FELICS FELICS, which stands for Fast Efficient & Lossless Image Compression System, is a lossless image compression algorithm that performs 5-times faster than…
- 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…
- Elias omega coding Elias ω coding or Elias omega coding is a universal code encoding the positive integers developed by Peter Elias. Like Elias gamma coding and Elias delta…
- Lossless JPEG Lossless JPEG is a 1993 addition to JPEG standard by the Joint Photographic Experts Group to enable lossless compression. However, the term may also be…
- 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…
- Exponential-Golomb coding An exponential-Golomb code (or just Exp-Golomb code) is a type of universal code. To encode any nonnegative integer x using the exp-Golomb code: Write…