














Abstract:We improve upon the Johnson-type bounds of Hayashi--Yasunaga and Liu--Tjuawinata--Xing for insertion--deletion codes by encoding each local list into a binary constant-weight code. The resulting local list-size bound is tight over sufficiently large alphabets. Combining this bound with an averaging argument and the constant-weight McEliece--Rodemich--Rumsey--Welch bound yields an asymptotic rate bound that strictly improves Yasunaga's Elias-type bound throughout the nontrivial range.
From: Yulin Yang [view email]
[v1]
Sun, 24 May 2026 14:10:55 UTC (5 KB)
[v2]
Thu, 28 May 2026 13:47:40 UTC (6 KB)
[v3]
Sun, 16 Aug 2026 16:33:17 UTC (162 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。