Chop-and-Shuffle信道的重组码
Reassembly Codes for the Chop-and-Shuffle Channel
摘要:
我们研究了从一个通道中检索数据的问题,该通道将输入序列分解为一组随机长度的无序片段,我们称之为斩波和洗牌通道。每个片段的长度遵循几何分布。我们提出了嵌套Varshamov-Tenengolts(VT)代码来恢复数据。我们评估的出错率和我们的计划的复杂性数值。我们的研究结果表明,解码错误随着输入长度的增加而减少,并且我们的方法具有比基线暴力方法更低的复杂度。我们还提出了一个新的建设VT码,量化所需的奇偶校验位的最大数量,并表明,我们的方法需要更少的奇偶校验位相比,已知的结果。
英文摘要:
We study the problem of retrieving data from a channel that breaks the input sequence into a set of unordered fragments of random lengths, which we refer to as the chop-and-shuffle channel. The length of each fragment follows a geometric distribution. We propose nested Varshamov-Tenengolts (VT) codes to recover the data. We evaluate the error rate and the complexity of our scheme numerically. Our results show that the decoding error decreases as the input length increases, and our method has a significantly lower complexity than the baseline brute-force approach. We also propose a new construction for VT codes, quantify the maximum number of the required parity bits, and show that our approach requires fewer parity bits compared to known results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。