Rank Modulation for Flash Memories

DOI10.1109/TIT.2009.2018336zbMath1367.94121OpenAlexW2076639947WikidataQ59903056 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

Mathematical problems of computer architecture (68M07) Information storage and retrieval of data (68P20) Modulation and demodulation in information and communication theory (94A14)

Related Items (16)

Codes of length two correcting single errors of limited size ⋮ Codes of Length 2 Correcting Single Errors of Limited Size ⋮ Consolidation for compact constraints and Kendall tau LP decodable permutation codes ⋮ New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ Perfect codes from \(\operatorname{PGL}(2,5)\) in star graphs ⋮ Computing the ball size of frequency permutations under Chebyshev distance ⋮ Coding for locality in reconstructing permutations ⋮ Lower bounds on the size of spheres of permutations under the Chebychev distance ⋮ Constructions of multi-permutation codes correcting a single burst of deletions ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ On the snake-in-the-box codes for rank modulation under Kendall's \(\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

This page was built for publication: Rank Modulation for Flash Memories