Error-Correction in Flash Memories via Codes in the Ulam Metric

DOI10.1109/TIT.2013.2239700zbMath1364.94711arXiv1202.0932MaRDI QIDQ2989267

Vitaly Skachek, Olgica Milenković, Farzad Farnoud (Hassanzadeh)

Publication date: 8 June 2017

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

Full work available at URL: https://arxiv.org/abs/1202.0932

Mathematics Subject Classification ID

Data structures (68P05) Decoding (94B35)

Related Items (10)

New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Coding for locality in reconstructing permutations ⋮ Constructions of multi-permutation codes correcting a single burst of deletions ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ Proof of a conjecture of Kløve on permutation codes under the Chebychev distance ⋮ On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation ⋮ New theoretical bounds and constructions of permutation codes under block permutation metric

This page was built for publication: Error-Correction in Flash Memories via Codes in the Ulam Metric