Multipermutation Codes Correcting a Burst of Deletions

Peng ZHAO  Jianjun MU  Yucheng HE  Xiaopeng JIAO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.2   pp.535-538
Publication Date: 2018/02/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.535
Type of Manuscript: LETTER
Category: Coding Theory
burst-deletion,  flash memories,  interleaving,  multipermutation codes,  rank modulation,  

Full Text: PDF>>
Buy this Article

Codes over permutations and multipermutations have received considerable attention since the rank modulation scheme is presented for flash memories. Deletions in multipermutations often occur due to data synchronization errors. Based on the interleaving of several single-deletion-correcting multipermutation codes, we present a construction of multipermutation codes for correcting a burst of at most t deletions with shift magnitude one for t ≥2. The proposed construction is proved with including an efficient decoding method. A calculation example is provided to validate the construction and its decoding method.