Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding
Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding
复制标题
具有高效编码和解码的渐近最优粘性插入校正码
DOI：
10.1109/isit.2017.8007016
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
A. Vardy
中科院分区：
文献类型：
--
作者：
Hessam Mahdavifar;A. Vardy
考虑了使用有效编码和解码来构建粘性插入校正代码的问题。一个{n，m，r）粘性插入校正代码由长度为n的M代码组成，以便可以纠正任何最多r粘性插入的模式。我们利用BCH代码及其在Lee空间中的类似代码来构建可免疫到R粘性插入的明确和系统的代码。结果表明，随着块长度的增长，结构中构造冗余位的数量与某个上限的比率接近一个，这意味着构造的渐近最优性。
The problem of constructing sticky-insertion-correcting codes with efficient encoding and decoding is considered. An {n, M, r) sticky-insertion-correcting code consists of M codewords of length n such that any pattern of up to r sticky insertions can be corrected. We utilize BCH codes and their analogous in the Lee space to construct explicit and systematic codes that are immune to up to r sticky insertions. It is shown that the ratio of the number of constructed redundancy bits in the construction to a certain upper bound approaches one as the block length grows large, which implies asymptotic optimality of the construction.