Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1587/transfun.E100.A.2176 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
rank modulation, adjacent deletions, permutation codes, multipermutation codes, interleaving technique, flash memories | Discrete mathematics,Mathematics | Journal |
Volume | Issue | ISSN |
E100A | 10 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| zhao peng | 1 | 36 | 15.85 |
| Jianjun Mu | 2 | 41 | 10.63 |
| Xiaopeng Jiao | 3 | 38 | 9.90 |