Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden. We prove some general bounds and we give several constructions in the case of binary codes. Our techniques also allow us to provide an alternative, elementary proof of a lower bound on non-overlapping codes due to Levenshtein in 1964.

翻译：非重叠码的研究已有近60年历史。在这类码中，任何码字的非空真前缀都不是另一码字的后缀。本文研究禁止特定长度重叠的码，证明了若干一般性界，并给出了二进制码情况下的多种构造方法。我们的技术还提供了列文斯坦1964年关于非重叠码下界的一个替代性初等证明。