On the maximum size of variable-length non-overlapping codes
<|reference_start|>On the maximum size of variable-length non-overlapping codes: Non-overlapping codes are a set of codewords such that the prefix of each codeword is not a suffix of any codeword in the set, including itself. If the lengths of the codewords are variable, it is additionally required that every codeword is not contained in any other codeword as a subword. Let $C(n,q)$ be the maximum size of $q$-ary fixed-length non-overlapping codes of length $n$. The upper bound on $C(n,q)$ has been well studied. However, the nontrivial upper bound on the maximum size of variable-length non-overlapping codes of length at most $n$ remains open. In this paper, by establishing a link between variable-length non-overlapping codes and fixed-length ones, we are able to show that the size of a $q$-ary variable-length non-overlapping code is upper bounded by $C(n,q)$. Furthermore, we prove that the average length of the codewords in a $q$-ary variable-length non-overlapping codes is lower bounded by $\lceil \log_q \tilde{C} \rceil$, and is asymptotically no shorter than $n-2$ as $q$ approaches $\infty$, where $\tilde{C}$ denotes the cardinality of $q$-ary variable-length non-overlapping codes of length up to $n$.<|reference_end|>
@article{wang2024on,
    title={On the maximum size of variable-length non-overlapping codes},
    author={Geyang Wang and Qi Wang},
    journal={arXiv preprint arXiv:2402.18896},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.18896},
    primaryClass={cs.IT math.CO math.IT}
}