Snake-in-the-box codes under the _-metric for rank modulation

DOI10.1007/S10623-019-00693-YMaRDI QIDQ2302152zbMATHOpenAlexFDO

Publication date 25 February 2020

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

Gray codes flash memory rank modulation snake-in-the-box codes \(\ell_{\infty}\)-snakes \(\mathcal{K}\)-snakes

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Modulation and demodulation in information and communication theory (94A14)

Abstract: In the rank modulation scheme, Gray codes are very useful in the realization of flash memories. For a Gray code in this scheme, two adjacent codewords are obtained by using one "push-to-the-top" operation. Moreover, snake-in-the-box codes under the

e l l_{i n f t y}

-metric are Gray codes, which can be capable of detecting one

e l l_{i n f t y}

-error. In this paper, we give two constructions of

e l l_{i n f t y}

-snakes. On the one hand, inspired by Yehezkeally and Schwartz's construction, we present a new construction of the

e l l_{i n f t y}

-snake. The length of this

e l l_{i n f t y}

-snake is longer than the length of the

e l l_{i n f t y}

-snake constructed by Yehezkeally and Schwartz. On the other hand, we also give another construction of

e l l_{i n f t y}

-snakes by using

m a t h c a l K

-snakes and obtain the longer

e l l_{i n f t y}

-snakes than the previously known ones.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302152)