跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21913 · v1

An upper bound on non-overlapping codes

首次提交 2026-11-17 05:28
版本更新 2026-11-17 05:28
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

Non-overlapping codes (also known as bifix-free codes or strong comma-free codes) have now been studied for over 60 years as part of information theory, with regular new applications appearing and much recent interest. Let XX be a binary non-overlapping code of length nn. The paper contains a self-contained proof that ∣X∣≤(56e+O(n−1))2nn |X|\leq \left(\frac{5}{6e} +O(n^{-1})\right)\frac{2^n}{n} as n→∞n\rightarrow\infty. This improves, by a factor of 5/65/6, the best previously known bound due to Levenshtein (1970). The paper builds on work by Fimmel, Michel, Pirot, Sereni and Strüngmann (2019), and by Stanovnik, Mo\v skon and Mraz (2024).

作者备注:22 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 05:28 · 最新观测版本

An upper bound on non-overlapping codes

Non-overlapping codes (also known as bifix-free codes or strong comma-free codes) have now been studied for over 60 years as part of information theory, with regular new applications appearing and much recent interest. Let XX be a binary non-overlapping code of length nn. The paper contains a self-contained proof that ∣X∣≤(56e+O(n−1))2nn |X|\leq \left(\frac{5}{6e} +O(n^{-1})\right)\frac{2^n}{n} as n→∞n\rightarrow\infty. This improves, by a factor of 5/65/6, the best previously known bound due to Levenshtein (1970). The paper builds on work by Fimmel, Michel, Pirot, Sereni and Strüngmann (2019), and by Stanovnik, Mo\v skon and Mraz (2024).

查看此版本解读 →查看此版本原文 ↗