Rank Modulation for Flash Memories

DOI10.1109/TIT.2009.2018336zbMath1367.94121WikidataQ59903056 ScholiaQ59903056MaRDI QIDQ4975887

Robert Mateescu, Jehoshua Bruck, Anxiao (Andrew) Jiang, Moshe Schwartz

Publication date: 8 August 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2009.2018336

Mathematics Subject Classification ID

68M07: Mathematical problems of computer architecture

68P20: Information storage and retrieval of data

94A14: Modulation and demodulation in information and communication theory

Related Items

Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity, Computing the ball size of frequency permutations under Chebyshev distance, On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric, 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