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

无重复码

Repeat-Free Codes

Ohad Elishco, Ryan Gabrys, Eitan Yaakobi, Muriel Médard

摘要:

在本文中,我们考虑的问题编码数据到\textit{repeat-free}序列中的序列被施加包含任何$k$ -元组最多一次(预定义的$k$)。首先,计算无重复约束的容量。然后,提出了一种有效的算法,它使用两个比特的冗余,编码长度为$n$序列的$k=2+2\log (n)$。然后改进该算法以支持$1<a$的形式为$k=a\log (n)$的任何$k$值,而其冗余是$o(n)$。我们还计算了无重复序列的容量时,结合当地的限制,这是由一个受约束的系统,和多维无重复码的容量。

英文摘要:

In this paper we consider the problem of encoding data into \textit{repeat-free} sequences in which sequences are imposed to contain any $k$-tuple at most once (for predefined $k$). First, the capacity of the repeat-free constraint are calculated. Then, an efficient algorithm, which uses two bits of redundancy, is presented to encode length-$n$ sequences for $k=2+2\log (n)$. This algorithm is then improved to support any value of $k$ of the form $k=a\log (n)$, for $1<a$, while its redundancy is $o(n)$. We also calculate the capacity of repeat-free sequences when combined with local constraints which are given by a constrained system, and the capacity of multi-dimensional repeat-free codes.

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

↑