Quadratic bounds for uncompletable words and matrix mortality

Rahul Chandelkar, Samrath Singh Chadha, Samrath Chadha

Every finite nonempty incomplete uniquely decipherable code with maximum word length $k$ has an uncompletable word of length at most $4k^2-3k$. The bound is independent of the numb…