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!
|
| _version_ | 1866916063628754944 |
|---|---|
| author | Yang, Yulin |
| author_facet | Yang, Yulin |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_25090 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Improved Johnson-type Bounds for Insertion-Deletion Codes Yang, Yulin Information Theory Combinatorics 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. |
| title | Improved Johnson-type Bounds for Insertion-Deletion Codes |
| topic | Information Theory Combinatorics |
| url | https://arxiv.org/abs/2605.25090 |