论文标题
具有限制重叠的代码的构造和界限
Constructions and bounds for codes with restricted overlaps
论文作者
论文摘要
已有将近60年的非重叠代码进行了研究。在这样的代码中，任何代码字的正确，非空的前缀均为任何代码字的后缀。在本文中，我们研究了禁止某些指定尺寸的重叠的代码。我们证明了一些一般的界限，并在二进制代码的情况下提供了几个结构。我们的技术还使我们能够提供1964年由于Levenshtein引起的非重叠代码的替代基本证明。
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.
