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
Event Analytics Platform & RFID Attendee Tracking in Saudi Arabia
0dev.to Data

10 Adımda Yapay Zeka Otomasyonu ile Öğrenme Hızımı Nasıl 3 Katına Çıkardım
0dev.to Data
What 50 Backlinks Taught Me About Building a Niche Site in Public
0dev.to Discuss
The Year "Prove You're Human" Became Law and Infrastructure
0dev.to Discuss

Beyond Management: Why Executive Leadership Coaching is the Missing Link in Modern Organizational Growth
0dev.to Discuss

Stop Eyeballing AI Benchmarks: Why Your Next Tool Evaluation Needs a Tiny Test Fixture
0dev.to Discuss