
TL;DR
This paper introduces a simple construction for non-overlapping codes with near-optimal size, improving understanding of their maximum cardinality and providing new bounds and exact results for small lengths.
Contribution
It presents a new simple construction for non-overlapping codes that is optimal when length divides alphabet size, and offers bounds and exact sizes for small lengths.
Findings
Construction is optimal when n divides q
Codes are within a constant factor of Levenshtein's upper bound
Exact maximum sizes for lengths 3 or less
Abstract
We say that a -ary length code is \emph{non-overlapping} if the set of non-trivial prefixes of codewords and the set of non-trivial suffices of codewords are disjoint. These codes were first studied by Levenshtein in 1964, motivated by applications in synchronisation. More recently these codes were independently invented (under the name \emph{cross-bifix-free} codes) by Baji\'c and Stojanovi\'c. We provide a simple construction for a class of non-overlapping codes which has optimal cardinality whenever divides . Moreover, for all parameters and we show that a code from this class is close to optimal, in the sense that it has cardinality within a constant factor of an upper bound due to Levenshtein from 1970. Previous constructions have cardinality within a constant factor of the upper bound only when is fixed. Chee, Kiah, Purkayastha and Wang showed that a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
