首页|Rate-improved multi-permutation codes for correcting a single burst of stable deletions
Rate-improved multi-permutation codes for correcting a single burst of stable deletions
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
Permutation and multi-permutation codes have been widely studied due to their potential applications in communications and storage systems, especially in flash memory. In this paper, we consider balanced multi-permutation codes correcting a single burst of stable deletions of length t and length at most t, respectively. Based on the properties of burst stable deletions and stabilizer permutation subgroups, we propose two constructions of multi-permutation codes correcting a single burst of stable deletions of length up to some parameter. The multi-permutation codes can achieve larger rates than available codes while maintaining simple interleaving structures. Moreover, the decoding methods are given in proofs and verified by examples.
NETL
NSTL
