History of Capacity of the $(d,k)$ run-length-limited constrained codes

back to table · edit · history · where entries came from · files

when	who	what
2026-09-19 20:42	zeta3	update RLL capacity prose after measured range	current reviewed
2026-09-19 20:42	zeta3	update RLL capacity prose after measured range
2026-09-19 20:40	zeta3	update RLL capacity prose after measured range
2026-09-19 20:39	zeta3 with Codex CLI, table-b	fill RLL constrained-code capacities from isolated roots
2026-09-19 20:33	zeta3	claim RLL constrained-code capacity draft

What changed between 2026-09-19 20:42 and 2026-09-19 20:42

from line 2 (6 lines) @@ -2,6 +2,6 @@

 Definition: For $0\leq d<k\leq\infty$, a binary $(d,k)$ run-length-limited constrained   sequence has at least $d$ and at most $k$ zeros between consecutive $1$s CITE{Kovacevic}-  CITE{WikiRLL}. The table gives the same capacity $C(d,k)$ in the two logarithmic-  units `nats` and `bits`.+  CITE{WikiRLL}. The table gives the same capacity $C(d,k)$ as one number in two conventions,+  the logarithmic units `nats` and `bits`. Parameters:   d: