Tag
source-coding
- Jun 27, 2026 Arithmetic Coding by Interval Subdivision How a message becomes a single rational interval, why the decoder needs no codeword boundaries, and what finite-precision renormalization must do to keep the arithmetic exact. computation theory
- Aug 4, 2025 Entropy Rate of a Markov Source and the Value of Context Why the per-symbol cost of a source with memory is not its order-0 entropy, how the entropy rate is computed from a transition matrix, and what context models capture that frequency tables cannot. computation theory
- Nov 5, 2024 Prefix Codes, the Kraft Inequality, and Why Huffman Is Optimal How decodability without separators constrains code lengths, what the Kraft sum measures, and the exchange argument that makes Huffman coding the best prefix code for a known distribution. computation theory