Snake-in-the-box codes for rank modulation

Yonatan Yehezkeally, Moshe Schwartz

Research output: Contribution to journalArticlepeer-review

34 Scopus citations


Motivated by the rank-modulation scheme with applications to flash memory, we consider Gray codes capable of detecting a single error, also known as snake-in-the-box codes. We study two error metrics: Kendall's \tau-metric, which applies to charge-constrained errors, and the \ell \infty-metric, which is useful in the case of limited-magnitude errors. In both cases, we construct snake-in-the-box codes with rate asymptotically tending to 1. We also provide efficient successor-calculation functions, as well as ranking and unranking functions. Finally, we also study bounds on the parameters of such codes.

Original languageEnglish
Article number6191350
Pages (from-to)5471-5483
Number of pages13
JournalIEEE Transactions on Information Theory
Issue number8
StatePublished - 23 Jul 2012


  • Flash memory
  • permutations
  • rank modulation
  • snake-in-the-box codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Snake-in-the-box codes for rank modulation'. Together they form a unique fingerprint.

Cite this