Permutation codes correcting a single burst deletion II: Stable deletions
Permutation codes correcting a single burst deletion II: Stable deletions
复制标题
纠正单次突发删除的排列码 II：稳定删除
DOI：
10.1109/isit.2017.8007017
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Hengjia Wei
中科院分区：
文献类型：
--
作者：
Yeow Meng Chee;San Ling;Tuan Thanh Nguyen;Van Khu Vu;Hengjia Wei
我们构造了能够纠正稳定删除突发的排列码。对于单个S稳定缺失的纠正，我们的码的大小为sn！/((2s)n)2，上界为n！/S！(n−S+1)。对于单个突发的S稳定缺失和最多b个S稳定缺失的情况，我们构造了排列码。
We construct permutation codes capable of correcting bursts of stable deletions. For correcting a single burst of exactly s stable deletions, our code has size sn!/((2s)!n)2 while the upper bound is n!/s!(n − s + 1). We also construct permutation codes for the cases of single burst of up to s stable deletions, and up to b bursts of at most s stable deletions each.