Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1587/transfun.E101.A.535 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
burst-deletion, flash memories, interleaving, multipermutation codes, rank modulation | Discrete mathematics,Arithmetic,Mathematics | Journal |
Volume | Issue | ISSN |
E101A | 2 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| zhao peng | 1 | 36 | 15.85 |
| Jianjun Mu | 2 | 41 | 10.63 |
| Yu-Cheng He | 3 | 9 | 2.70 |
| Xiaopeng Jiao | 4 | 38 | 9.90 |