基于多重着色的显式编辑纠错码
Explicit Edit Codes via Multicoloring
Huiling Xie, Zitan Chen
AI 速读 基于摘要
作者利用编辑混淆图的素数多重着色构造显式 q 元码,可纠正至多 t 个插入、删除与替换的任意组合,冗余达到 Levenshtein 存在性界的主项。
cs.IT · cs.DM · cs.DS
查看原文摘要
For any fixed integers $q\ge2$ and $t\ge1$, we construct explicit $q$-ary codes of length $n$ that correct any combination of at most $t$ insertions, deletions, and substitutions, with redundancy at most $2t\log_q n+O_{q,t}(\log\log n)$ $q$-ary symbols. This matches the leading redundancy term of Levenshtein's classical existential bound. Building on the standard graph-coloring approach, we use a prime-based multicoloring of the edit-confusion graph to assign multiple colors to each $q$-ary word of length $m<n$. Appending a short, edit-protected representation of an assigned color to the length-$m$ word yields a length-$n$ codeword. The choice among the assigned colors carries additional message information, thereby reducing the redundancy. The construction admits deterministic encoding and decoding in $\widetilde O_{q,t}(n^{6t+2})$ and $\widetilde O_{q,t}(n^{7t+2})$ time, respectively.