Live briefing
Everything about Range coding
Entropy coding method
Range coding is an entropy coding method defined by G. Nigel N. Martin in a 1979 paper, which effectively rediscovered the FIFO arithmetic code first introduced by Richard Clark Pasco in 1976. Given a stream of symbols and their probabilities, a range coder produces a space-efficient stream of bits to represent these symbols and, given the stream and the probabilities, a range decoder reverses the process. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Range codingA 5-minute orientation
- Skim a recent paper: Radar Target Complex High-Resolution Range Profile Modulation by External Time Coding MetasurfaceInfluential work since 2022
- Pick up a classic book: Where the Wild Things AreThe most-reprinted book on the subject
- Read the landmark paper: Intensity coding and the dynamic range problemCited 104 times
- Go sideways: Arithmetic codingA closely related topic
- Go sideways: Asymmetric numeral systemsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Intensity coding and the dynamic range problem
Convolutional Sparse Coding for High Dynamic Range Imaging
Host Range and Coding Potential of Eukaryotic Giant Viruses
Image coding for three-dimensional range-gated imaging
Long-range Brillouin optical time-domain analysis sensor employing pulse coding techniques
Mechanisms of long range silencing by imprinted macro non-coding RNAs
A Coding Scheme for Visible Light Communication With Wide Dimming Range
Comparison of Deterministic Phase Coding with Random Phase Coding in Terms of Dynamic Range
🆕 Influential since 2022
Radar Target Complex High-Resolution Range Profile Modulation by External Time Coding Metasurface
Real-Time LiDAR Point Cloud Compression Using Bi-Directional Prediction and Range-Adaptive Floating-Point Coding
A Novel Transmitter-Interpulse Phase Coding MIMO-Radar for Range Ambiguity Separation
A comprehensive survey of long-range tertiary interactions and motifs in non-coding RNA structures
Ultra-Long Range Distributed Acoustic Sensor Using Poly-Phase Coding Approach
📚 Books worth reading
Where the Wild Things AreMaurice Sendak · 1963
MadeleineLudwig Bemelmans · 1920
The Snowy DayEzra Jack Keats, Marilyn Sanabria · 1962
Make Way for DucklingsRobert McCloskey, David Crommett · 1941
Sylvester and the magic pebbleWilliam Steig · 1969
Doctor De SotoWilliam Steig · 1982
Madeline's RescueLudwig Bemelmans · 1900
Stone soupMarcia Brown · 1947
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Asymmetric numeral systems Asymmetric numeral systems (ANS) is a family of entropy encoding methods introduced by Jarosław (Jarek) Duda from Jagiellonian University, used in data…
- 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…
- Fibonacci coding In mathematics and computing, Fibonacci coding is a universal code which encodes positive integers into binary code words. It is one example of representations…
- 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…
- Context-adaptive binary arithmetic coding Context-adaptive binary arithmetic coding (CABAC) is a form of entropy encoding used in the H.264/MPEG-4 AVC and High Efficiency Video Coding (HEVC) standards…
- 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…
- Elias delta coding Elias δ code or Elias delta code is a universal code encoding the positive integers developed by Peter Elias. To code a number X ≥ 1: Let N = ⌊log2 X⌋;…