On Coding Over Sliced Information
On Coding Over Sliced Information
复制标题
DOI：
10.1109/tit.2021.3063709
复制
发表时间：
2018-09
影响因子：
2.5
通讯作者：
Jin Sima;Netanel Raviv;Jehoshua Bruck
中科院分区：
文献类型：
--
作者：
Jin Sima;Netanel Raviv;Jehoshua Bruck
最近，由于DNA存储等领域的新兴应用，对数据作为无序二进制字符串集发送的通道模型的兴趣有所增加。在本文中，我们分析了最小冗余的二进制码下的替代错误，这个通道，并提供了几个建设，其中一些被证明是渐近最佳常数。本文中令人惊讶的结果是，虽然信息向量被切成一组无序的字符串，但纠正错误所需的冗余位的数量按顺序相当于经典纠错范式中所需的数量。
The interest in channel models in which the data is sent as an unordered set of binary strings has increased lately, due to emerging applications in DNA storage, among others. In this paper we analyze the minimal redundancy of binary codes for this channel under substitution errors, and provide several constructions, some of which are shown to be asymptotically optimal up to constants. The surprising result in this paper is that while the information vector is sliced into a set of unordered strings, the amount of redundant bits that are required to correct errors is order-wise equivalent to the amount required in the classical error correcting paradigm.