Multipermutation Codes Correcting a Predetermined Number of Adjacent Deletions

Peng ZHAO; Jianjun MU; Xiaopeng JIAO

doi:10.1587/transfun.E100.A.2176

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Regular Section

Multipermutation Codes Correcting a Predetermined Number of Adjacent Deletions

Peng ZHAO, Jianjun MU, Xiaopeng JIAO

Author information

Keywords: rank modulation, adjacent deletions, permutation codes, multipermutation codes, interleaving technique, flash memories

JOURNAL RESTRICTED ACCESS

2017 Volume E100.A Issue 10 Pages 2176-2179

DOI https://doi.org/10.1587/transfun.E100.A.2176

Details

Abstract

In this letter, three types of constructions for multipermutation codes are investigated by using interleaving technique and single-deletion permutation codes to correct a predetermined number of adjacent deletions. The decoding methods for the proposed codes are provided in proofs and verified with examples. The rates of these multipermutation codes are also compared.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!