Snake-in-the-Box Codes for Rank Modulation

Details Snake-in-the-Box Codes for Rank Modulation Snake-in-the-Box Codes for Rank Modulation

2011-07-18

arxiv.org/abs/1107.3372v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Snake-in-the-Box Codes for Rank Modulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Snake-in-the-Box Codes for Rank Modulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Snake-in-the-Box Codes for Rank Modulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271176