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
Cryptographic SARIF v2.1.0 Proofs for Autonomous AI Agents & Desktop Suite Innovations (Day 4)
0dev.to
Cybersecurity Best Practices for Small Businesses
0dev.to
Lean AI Second Brain: Babashka, Git & Local LLMs
0dev.to AI

Inside My AI Marketing Agent: More Than a Prompt
0dev.to AI

Building an Intelligent Assistant: My Architect's View of Amazon Bedrock AgentCore
0dev.to AWS
I indexed 2,606 legally free resources to learn the Indian stock market — here's how the no-build site works
0dev.to WebDev