Permutation Codes for Correcting a Burst of at Most $t$ Deletions
Permutation Codes for Correcting a Burst of at Most $t$ Deletions
复制标题
DOI：
10.1109/allerton49937.2022.9929395
复制
发表时间：
2022-09
期刊：
影响因子：
--
通讯作者：
Shuche Wang;Yuanyuan Tang;Ryan Gabrys;Farzad Farnoud
中科院分区：
文献类型：
--
作者：
Shuche Wang;Yuanyuan Tang;Ryan Gabrys;Farzad Farnoud
置换码由于其在存储器件和电力线传输系统中的应用而受到极大的关注。在本文中，我们构建了一个家庭的置换码，能够纠正突发的最多$t$删除与$\log n+\mathcal{O}（\log\log n）$位的冗余，其中$t$是一个常数，显着提高了国家的最先进的建设与冗余$2t\log n$位。
Codes over permutations have received significant attention due to their applications in memory devices and powerline transmission systems. In this paper, we construct a family of permutation codes that are capable of correcting a burst of at most $t$ deletions with $\log n+\mathcal{O}(\log\log n)$ bits of redundancy where $t$ is a constant, which significantly improves upon the state-of-the-art construction with redundancy $2t\log n$ bits.