IEEE Transactions on Information Theory · 2019 · 16 citations · 19 references
EngineeringComputer ScienceAlgorithmsFault-tolerant ComputingInformation TheoryCoding TheoryError Control CodingError CorrectionError-correcting CodesBurst-error-correcting CodesCode ConstructionsParity-check MatricesPermutation CodesPermutations
Permutation codes and multipermutation codes are widely studied due to various applications in information theory. Designing codes correcting deletion errors has been the main subject of works in the literature and to the best of our knowledge, there exist only optimal codes capable of correcting a single deletion in a permutation. In this paper, we construct several classes of permutation and multipermutation codes that are capable of correcting a burst deletion of length s ≥ 2, for both stable and unstable models. Efficient error decoders are provided to show the correctness of our constructions.
19
Binary codes capable of correcting deletions, insertions and reversals
V.I. Levenshtein · Soviet physics. Doklady · 1965 · 10.4K citations
D. Slepian · Proceedings of the IEEE · 1965 · 332 citations
Rank Modulation for Flash Memories
Anxiao Jiang, Robert Mateescu, Moshe Schwartz et al. · IEEE Transactions on Information Theory · 2009 · 259 citations · Full text