Rank Modulation for Flash Memories
From MaRDI portal
Cited in
(21)- Consolidation for compact constraints and Kendall tau LP decodable permutation codes
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Coding for locality in reconstructing permutations
- Perfect codes from \(\operatorname{PGL}(2,5)\) in star graphs
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Covering radius of permutation groups with infinity-norm
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation
- New lower bounds for permutation arrays using contraction
- Strongly restricted permutations and tiling with fences
- Lower bounds on the size of spheres of permutations under the Chebychev distance
- Codes of length two correcting single errors of limited size
- Constructions of multi-permutation codes correcting a single burst of deletions
- Codes of length 2 correcting single errors of limited size
- Computing the ball size of frequency permutations under Chebyshev distance
- Space-optimal quasi-Gray codes with logarithmic read complexity
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
- Rate-improved multi-permutation codes for correcting a single burst of stable deletions
- Diametric problem for permutations with the Ulam metric (optimal anticodes)
- The sequence reconstruction of permutations with Hamming metric
- Constructing permutation codes under the generalized Kendall- metric
- Rank-modulation codes for DNA storage in shotgun sequencing: structure and distance properties
This page was built for publication: Rank Modulation for Flash Memories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975887)