Name
Title | ||
|---|---|---|
Coset Partitioning Construction of Systematic Permutation Codes Under the Chebyshev Metric |
Abstract | ||
|---|---|---|
The rank-modulation scheme has been recently proposed to write and store data in flash memories efficiently. In this paper, a new construction of systematic error-correcting codes for permutations is presented under the Chebyshev distance. By constructing a subgroup code and using its coset codes to partition the set of information permutations, the proposed code construction can achieve much larger code cardinality and hence higher code rates. To facilitate the encoding and decoding of the constructed codes, we also investigate the concepts of ranking and unranking for permutations, and generalize them to
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>
-ranking and
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>
-unranking for multi-permutations. Examples are provided to demonstrate the relevant concepts and the encoding/decoding algorithms. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/tcomm.2019.2900679 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Systematics,Measurement,Modulation,Redundancy,Error correction codes,Encoding,Decoding | Chebyshev distance,Discrete mathematics,Subgroup Code,Ranking,Computer science,Permutation,Cardinality,Electronic engineering,Decoding methods,Coset,Encoding (memory) | Journal |
Volume | Issue | ISSN |
67 | 6 | 0090-6778 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui Han | 1 | 14 | 7.99 |
| Jianjun Mu | 2 | 8 | 3.23 |
| Yu-cheng He | 3 | 53 | 10.01 |
| Xiaopeng Jiao | 4 | 16 | 2.42 |