Capacity Results for the Noisy Shuffling Channel

Capacity Results for the Noisy Shuffling Channel
复制标题

噪声洗牌通道的容量结果

DOI:
10.1109/isit.2019.8849789
复制
发表时间:
2019
期刊:
2019 IEEE International Symposium on Information Theory (ISIT)
影响因子:
--
通讯作者:
Reinhard Heckel
Reinhard Heckel
中科院分区:
--
文献类型:
--
作者:
Ilan Shomorony;Reinhard Heckel

文献摘要

被引文献

相似文献

受基于DNA的存储的启发,我们研究了噪声洗牌信道,它可以被看作是一个标准的噪声信道(如BSC)和洗牌信道的级联,它将数据块分成小块并对其进行洗牌。该通道通过捕获其两个关键方面来模拟DNA存储系统:(1)数据被写入以无序方式存储的许多短DNA分子上,以及(2)分子在合成,测序和存储期间被噪声破坏。对于BSC-洗牌信道,我们的能力的特点,正是(一个大的参数集),并表明,一个简单的基于索引的编码方案是最佳的。
Motivated by DNA-based storage, we study the noisy shuffling channel, which can be seen as the concatenation of a standard noisy channel (such as the BSC) and a shuffling channel, which breaks the data block into small pieces and shuffles them. This channel models a DNA storage system, by capturing two of its key aspects: (1) the data is written onto many short DNA molecules that are stored in an unordered way and (2) the molecules are corrupted by noise at synthesis, sequencing, and during storage. For the BSC-shuffling channel we characterize the capacity exactly (for a large set of parameters), and show that a simple index-based coding scheme is optimal.