Self-delimiting binary code
= Self-delimiting binary code
A self-delimiting code permits a decoder to identify the end of a code without an external length marker. Encoding a binary word of length $\ell$ by $\ell$ ones, a zero and the word uses $2\ell+1$ bits. This yields an $O(\log n)$ description of a <natural number> in an incompressibility proof.