Paperlane

no. 17 · Wednesday 18 November 2026

An upper bound on non-overlapping codes

Simon R. Blackburn

math.IT · 22 pp

Abstract

Non-overlapping codes (also known as bifix-free codes or strong comma-free codes) have now been studied for over 60 years as part of information theory, with regular new applications appearing and much recent interest. Let $X$ be a binary non-overlapping code of length $n$. The paper contains a self-contained proof that \[ |X|\leq \left(\frac{5}{6e} +O(n^{-1})\right)\frac{2^n}{n} \] as $n\rightarrow\infty$. This improves, by a factor of $5/6$, the best previously known bound due to Levenshtein (1970). The paper builds on work by Fimmel, Michel, Pirot, Sereni and Strüngmann (2019), and by Stanovnik, Mo\v skon and Mraz (2024).

comments
22 pages
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.21913 ↗