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.

翻译：我们通过将每个局部列表编码为二进制恒定重量码，改进了Hayashi与Yasunaga关于插入删除码的Johnson型界。所得局部列表大小界在字母表足够大时是紧的。将该恒定重量公式应用于McEliece-Rodemich-Rumsey-Welch界，可得到一个渐近速率界，该界在非平凡范围内严格优于Yasunaga的Elias型界。