.png){kind=icon}
返回
Gray codes over certain run-length sequences for local rank modulation
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-018-9509-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the local rank modulation (LRM) scheme, a sliding window produces a sequence of permutations by moving over a sequence of variables. LRM has been presented as a method of storing data in flash memory, which represents a natural generalization of the classical rank modulation scheme. In this paper, we present a study on Gray codes over certain run-length sequences for the (1,2,n)-LRM scheme to simulate virtual multilevel flash memory cells while maintaining the advantages of LRM. Unlike previous studies on the LRM scheme, we present Gray codes over certain run-length sequences in the (1,2,n)-LRM scheme. This class of Gray codes can overcome the drawback of the many distinct charge levels required in the rank modulation scheme and in certain Gray codes for LRM. Furthermore, we demonstrate that the proposed codes have an asymptotically optimal rate.
Keyword:
flash memory
local rank modulation
Gray codes
rank modulation
run-length sequences
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
分享收藏Intrusion Detection systems using Real-Valued Negative Selection Algorithm with Optimized Detectors
PREAI
分享收藏分享收藏
查看更多内容