The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Flash Memories
Rank modulation for flash memories
IEEE Transactions on Information Theory
Linear-time ranking of permutations
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On the capacity of the precision-resolution system
IEEE Transactions on Information Theory
Constructions of permutation arrays
IEEE Transactions on Information Theory
Two constructions of permutation arrays
IEEE Transactions on Information Theory
Permutation arrays for powerline communication and mutually orthogonal latin squares
IEEE Transactions on Information Theory
Correcting charge-constrained errors in the rank-modulation scheme
IEEE Transactions on Information Theory
Decoding frequency permutation arrays under Chebyshev distance
IEEE Transactions on Information Theory
Exploiting half-wits: smarter storage for low-power devices
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Lower bounds on the size of spheres of permutations under the Chebychev distance
Designs, Codes and Cryptography
Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices
Journal of Combinatorial Theory Series A
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
| Hi-index | 754.97 |
We study error-correcting codes for permutations under the infinity norm, motivated by a novel storage scheme for flash memories called rank modulation. In this scheme, a set of n flash cells are combined to create a single virtual multi-level cell. Information is stored in the permutation induced by the cell charge levels. Spike errors, which are characterized by a limited-magnitude change in cell charge levels, correspond to a low-distance change under the infinity norm. We define codes protecting against spike errors, called limited-magnitude rank-modulation codes (LMRM codes), and present several constructions for these codes, some resulting in optimal codes. These codes admit simple recursive, and sometimes direct, encoding and decoding procedures. We also provide lower and upper bounds on the maximal size of LMRM codes both in the general case, and in the case where the codes form a subgroup of the symmetric group. In the asymptotic analysis, the codes we construct outperform the Gilbert-Varshamov-like bound estimate.