Home
Scholarly Works
Snake-in-the-Box Codes for Rank Modulation
Conference

Snake-in-the-Box Codes for Rank Modulation

Abstract

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 $p_{\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.

Authors

Yehezkeally Y; Schwartz M

Pagination

pp. 2983-2987

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Publication Date

July 1, 2012

DOI

10.1109/isit.2012.6284107

Name of conference

2012 IEEE International Symposium on Information Theory Proceedings
View published work (Non-McMaster Users)

Contact the Experts team