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

DOI10.1007/S10623-019-00693-YzbMATH Open1429.68071arXiv1601.05539OpenAlexW2987073342MaRDI QIDQ2302152FDOQ2302152

Authors: Xiang Wang, Fangwei Fu 

Publication date: 25 February 2020

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

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 $el{l}_{infty}$-metric are Gray codes, which can be capable of detecting one $el{l}_{infty}$-error. In this paper, we give two constructions of $el{l}_{infty}$-snakes. On the one hand, inspired by Yehezkeally and Schwartz's construction, we present a new construction of the $el{l}_{infty}$-snake. The length of this $el{l}_{infty}$-snake is longer than the length of the $el{l}_{infty}$-snake constructed by Yehezkeally and Schwartz. On the other hand, we also give another construction of $el{l}_{infty}$-snakes by using $mathcalK$-snakes and obtain the longer $el{l}_{infty}$-snakes than the previously known ones.

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

Recommendations

• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
• scientific article; zbMATH DE number 2154157
• scientific article; zbMATH DE number 36687
• scientific article; zbMATH DE number 1498820
• scientific article; zbMATH DE number 21365

zbMATH Keywords

Gray codesflash memoryrank modulationsnake-in-the-box codes\(\ell_{\infty}\)-snakes\(\mathcal{K}\)-snakes

Mathematics Subject Classification ID

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)

Cites Work

• Rank Modulation for Flash Memories
• Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
• Permutation Arrays Under the Chebyshev Distance
• Snake-in-the-Box Codes for Rank Modulation
• Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
• Error-Correction in Flash Memories via Codes in the Ulam Metric
• Metrics on permutations, a survey
• Codes in Permutations and Error Correction for Rank Modulation
• Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
• Snake-in-the-Box Codes for Rank Modulation Under Kendall’s $\tau $ -Metric
• Perfect Snake-in-the-Box Codes for Rank Modulation
• Constructions of Snake-in-the-Box Codes for Rank Modulation
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric
• Constant-Weight Gray Codes for Local Rank Modulation
• Generalized Gray Codes for Local Rank Modulation
• Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation

Cited In (9)

• Isomorphism of maximum length circuit codes
• Snake-in-the-Box Codes for Rank Modulation
• A new non-asymptotic upper bound for snake-in-the-box codes
• Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
• A new lower bound for snake-in-the-box codes
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
• New nonexistence results on perfect permutation codes under the Hamming metric
• Title not available (Why is that?)
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric

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)