Multipermutation Codes Correcting a Burst of Deletions
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.2 pp.535-538
- Publication Date
- 2018/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E101.A.535
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Peng ZHAO
Xidian University
Jianjun MU
Xidian University
Yucheng HE
Huaqiao University,Xidian University
Xiaopeng JIAO
Xidian University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Peng ZHAO, Jianjun MU, Yucheng HE, Xiaopeng JIAO, "Multipermutation Codes Correcting a Burst of Deletions" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 2, pp. 535-538, February 2018, doi: 10.1587/transfun.E101.A.535.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.535/_p
Copy
@ARTICLE{e101-a_2_535,
author={Peng ZHAO, Jianjun MU, Yucheng HE, Xiaopeng JIAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multipermutation Codes Correcting a Burst of Deletions},
year={2018},
volume={E101-A},
number={2},
pages={535-538},
abstract={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.},
keywords={},
doi={10.1587/transfun.E101.A.535},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Multipermutation Codes Correcting a Burst of Deletions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 535
EP - 538
AU - Peng ZHAO
AU - Jianjun MU
AU - Yucheng HE
AU - Xiaopeng JIAO
PY - 2018
DO - 10.1587/transfun.E101.A.535
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2018
AB - 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.
ER -
English
