Abstract | ||
---|---|---|
Permutation codes and multipermutation codes are widely studied due to various applications in information theory. Designing codes correcting deletion errors has been the main subject of works in the literature and to the best of our knowledge, there exist only optimal codes capable of correcting a single deletion in a permutation. In this paper, we construct several classes of permutation and mul... |
Year | DOI | Venue |
---|---|---|
2020 | 10.1109/TIT.2019.2933819 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Modulation,Redundancy,Decoding,Flash memories,Indexes,AWGN | Information theory,Discrete mathematics,Computer science,Permutation,Correctness | Journal |
Volume | Issue | ISSN |
66 | 2 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yeow Meng Chee | 1 | 593 | 62.01 |
San Ling | 2 | 10 | 4.56 |
Tuan Thanh Nguyen | 3 | 5 | 2.80 |
Van Khu Vu | 4 | 9 | 5.34 |
Hengjia Wei | 5 | 16 | 6.58 |
Xiande Zhang | 6 | 52 | 15.19 |