Snake-in-the-box codes for rank modulation

Yonatan Yehezkeally; Moshe Schwartz

doi:10.1109/ISIT.2012.6284107

Snake-in-the-box codes for rank modulation

Yonatan Yehezkeally, Moshe Schwartz

Department of Electrical & Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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 τ-metric, which applies to charge-constrained errors, and the ℓ _∞- 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.

Original language	English
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	2993-2997
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6284107
State	Published - 22 Oct 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: 1 Jul 2012 → 6 Jul 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Conference

Conference	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	1/07/12 → 6/07/12

Keywords

Snake-in-the-box codes
flash memory
permutations
rank modulation

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2012.6284107

Cite this

@inproceedings{5ddc7be395a84c1dba1feb3d2f601390,

title = "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 τ-metric, which applies to charge-constrained errors, and the ℓ ∞- 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.",

keywords = "Snake-in-the-box codes, flash memory, permutations, rank modulation",

author = "Yonatan Yehezkeally and Moshe Schwartz",

year = "2012",

month = oct,

day = "22",

doi = "10.1109/ISIT.2012.6284107",

language = "English",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2993--2997",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

Yehezkeally, Y & Schwartz, M 2012, Snake-in-the-box codes for rank modulation. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6284107, IEEE International Symposium on Information Theory - Proceedings, pp. 2993-2997, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/07/12. https://doi.org/10.1109/ISIT.2012.6284107

TY - GEN

T1 - Snake-in-the-box codes for rank modulation

AU - Yehezkeally, Yonatan

AU - Schwartz, Moshe

PY - 2012/10/22

Y1 - 2012/10/22

N2 - 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 τ-metric, which applies to charge-constrained errors, and the ℓ ∞- 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.

AB - 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 τ-metric, which applies to charge-constrained errors, and the ℓ ∞- 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.

KW - Snake-in-the-box codes

KW - flash memory

KW - permutations

KW - rank modulation

UR - http://www.scopus.com/inward/record.url?scp=84867514588&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6284107

DO - 10.1109/ISIT.2012.6284107

M3 - Conference contribution

AN - SCOPUS:84867514588

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2993

EP - 2997

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

Snake-in-the-box codes for rank modulation

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this