Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.25090 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We improve upon the Johnson-type bound of Hayashi and Yasunaga for insertion-deletion codes by encoding each local list into a binary constant-weight code. The resulting local list-size bound is tight for sufficiently large alphabets. Applying the McEliece--Rodemich--Rumsey--Welch bound to this constant-weight formulation yields an asymptotic rate bound that strictly improves on Yasunaga's Elias-type bound in the nontrivial range.