Improved Johnson-type Bounds for Insertion-Deletion Codes
Information Theory
2026-05-29 v2 math.IT
Abstract
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.
Cite
@article{arxiv.2605.25090,
title = {Improved Johnson-type Bounds for Insertion-Deletion Codes},
author = {Yulin Yang},
journal= {arXiv preprint arXiv:2605.25090},
year = {2026}
}