arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.4484cs.ITmath.IT
收藏

秩调制的约束码

Constrained Codes for Rank Modulation

Sarit Buzaglo, Eitan Yaakobi

摘要:

受秩调制方案的启发,Sala和Dolecek最近的一项工作探索了排列的约束码的研究。他们研究的约束是由闪存中的单元间干扰现象继承的,其中高电平单元可以无意中增加低电平单元的电平。本文将Sala和Dolecek研究的模型扩展为两个约束。置换$σ\in S_n$满足\emph{two-neighbor $k$-constraint},如果对于所有$2 \leq i \leq n-1$,是$|σ(i-1)-σ(i)|\leq k$或$|σ(i)-σ(i+1)|\leq k$,并且它满足\emph{asymmetric two-neighbor $k$-constraint},如果对于所有$2 \leq i \leq n-1$,是$σ(i-1)-σ(i) < k$或$σ(i+1)-σ(i) < k$。我们表明,第一个约束的容量是$(1+ε)/2$的情况下,$k=Θ(n^ε)$和第二个约束的容量是1,无论$k$的值。我们还扩展了我们的结果,并研究了这两个约束的能力结合纠错码在肯德尔的$τ$度量。

英文摘要:

Motivated by the rank modulation scheme, a recent work by Sala and Dolecek explored the study of constraint codes for permutations. The constraint studied by them is inherited by the inter-cell interference phenomenon in flash memories, where high-level cells can inadvertently increase the level of low-level cells. In this paper, the model studied by Sala and Dolecek is extended into two constraints. A permutation $σ\in S_n$ satisfies the \emph{two-neighbor $k$-constraint} if for all $2 \leq i \leq n-1$ either $|σ(i-1)-σ(i)|\leq k$ or $|σ(i)-σ(i+1)|\leq k$, and it satisfies the \emph{asymmetric two-neighbor $k$-constraint} if for all $2 \leq i \leq n-1$, either $σ(i-1)-σ(i) < k$ or $σ(i+1)-σ(i) < k$. We show that the capacity of the first constraint is $(1+ε)/2$ in case that $k=Θ(n^ε)$ and the capacity of the second constraint is 1 regardless to the value of $k$. We also extend our results and study the capacity of these two constraints combined with error-correction codes in the Kendall's $τ$ metric.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑