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
Signature Webhook HMAC-SHA256 Tidak Cocok? Hex vs Base64 dan 4 Jebakan yang Sering Terjadi
0dev.to
How do I make sure my agent drops outdated instructions instead of getting confused?
0dev.to

Klastro Walkthrough: Real Kubernetes Labs, in Your Browser
0dev.to
Part 2: The Main Problem - My Kali Download Was Too Small
0dev.to

Where the human gate goes: designing autonomy for coding agents
0dev.to
Nine clocks in one Next.js app, and the copyright year on 109 of our 111 pages was decided at 18:52 on 16 November
0dev.to