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年。在这类码中，任意码字的任何非空真前缀都不是其他码字的后缀。本文研究禁止特定大小重叠的码，证明了若干通用界，并给出了二进制情形下的几种构造方法。我们的技术还允许为莱文斯坦（Levenshtein，1964）提出的非重叠码下界提供另一种初等证明。