On codes with a finite deciphering delay: constructing uncompletable words
Résumé
Let X a non-complete code with a finite dechiphering delay. We prove that an uncompletable word w of length O(n²d²) exists, where d stands for the delay and m stands for the length of the longest word in X. The proof leads to an explicit construction of w. This result partially resolves a conjecture proposed by Antonio Restivo in 1979.