No. 0922 February 2026.
Probability and statistics, MT2204. Code on GitHub.
A message is an interval: arithmetic coding
Arithmetic coding gives every symbol a slice of [0, 1) as wide as its probability, zooms into the slice, and repeats. The seven letters of my name leave an interval about five millionths wide. Naming one number inside it takes 18 bits. The entropy of the letters says 17.65 bits is the floor.
Encoding DESMOND with symbol counts taken from the message itself, the fixed model my encoder uses. Each row zooms into the highlighted slice of the row above. Computed on this page.
what I don’t understand yet
My encoder holds the interval as a 28-digit decimal, and it collapses after a few dozen symbols. Real coders use integers and renormalise as they go. I want to derive why that loses nothing.