Codes Correcting a Burst of Deletions for Permutations and Multi-Permutations

Abstract

Codes over permutations and multi-permutations have been recently proposed for efficiently storing data in flash memories. Based on the interleaving techniques for permutations, we construct two classes of permutation codes which can correct a single burst symbol-invariant deletion (SID) of length up to t. Moreover, a class of balanced multi-permutation codes capable of correcting a single burst SID of length up to t is presented. The simple decoding procedures for the constructed codes are included in proofs and verified by examples.