Backend
An upper bound on non-overlapping codes
arXiv math.IT0 views
arXiv:2611.21913v1 Announce Type: new Abstract: 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 $X$ be a binary non-overlapping code of length $n$. The paper contains a self-contained proof that \[ |X|\leq \left(\frac{5}{6e} +O(n^{-1})\right)\frac{2^n}{n} \] as $n\rightarrow\infty$. This improves, by a factor of $5/6$, the best previously known bound due to Levenshtein (1970). The paper builds on work by Fimmel, Michel, Pirot, Sereni and Str\"ungmann (2019), and by Stanovnik, Mo\v skon and Mraz (2024).
Source:https://arxiv.org/abs/2611.21913PreviousA polynomial-time decoding algorithm up to half the square-root bound for quadratic residue and generalized quadratic residue codesNextComputed Permutation Trellis Coding: Near-Optimal Quantization from Two Multiplications and a 64-Byte Table
Related posts
Your analytics export says more than you think (if you read it honestly)
0dev.to OpenSource
Tencent LoopForge: Turn Coding Agents Into Repeatable Software Delivery
0dev.to OpenSource
Your agent does not need more tools. It needs a checkpoint.
0dev.to OpenSource
NVIDIA SkillEvaluator 1.0.1: Test Agent Skills Before Shipping Them
0dev.to OpenSource
I routed Claude Code tasks to cheaper models. Here's what 15 requests saved. published: true tags: claudecode, ai, opensource, productivity
0dev.to OpenSource
Who Owns the Code AI Wrote?
0dev.to Programming