Generator

Bits per symbol as one symbol takes over the stream

Rendered here at the parameters it defaults to, with every essay that calls it — which is the same list as the blast radius of changing it.
Bits per symbol as one symbol takes over the streamAn alphabet of 8, with the first symbol appearing at the probability on the horizontal axis and the rest sharing what is left. The entropy falls toward zero. Arithmetic coding follows it within a hundredth of a bit everywhere. Huffman flattens at exactly 1.000, because the shortest word a prefix code has is one bit and it must be spent on every symbol — at p = 0.99, that is 8.7 times what the stream is worth.0.1250.30.50.70.80.90.99probability of the dominant symbolbits per symbol0.01.63.2one bit per symbolHuffmanArithmeticEntropy H₀model: order 0 · 16,384 symbols per point8.7× at p = 0.99

Bits per symbol as one symbol takes over the stream

An alphabet of 8, with the first symbol appearing at the probability on the horizontal axis and the rest sharing what is left. The entropy falls toward zero. Arithmetic coding follows it within a hundredth of a bit everywhere. Huffman flattens at exactly 1.000, because the shortest word a prefix code has is one bit and it must be spent on every symbol — at p = 0.99, that is 8.7 times what the stream is worth.

Drawn at 700 × 430, wide on the page. Everything above is what skew-staircase returns with no arguments; the caption is the generator's own, computed from the numbers in the drawing rather than written beside it.

2 essays call skew-staircase. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about — which is what optcheck and figfill exist to catch.

Where it is called

Changing this generator changes every one of these figures.

The library, page 4 of 5 — where skew-staircase sits