高效和通用的抗腐败喷泉码
Efficient and Universal Corruption Resilient Fountain Codes
摘要：
在本文中，我们提出了一个新的家庭喷泉码，克服对抗性错误。也就是说，我们考虑的可能性，到达的数据包的一个无比率纠删码的某一部分被损坏在一个不可检测的方式。在实践中，损坏的分组可以归因于由对手控制的通信路径的一部分或恶意的源的一部分。所提出的代码类似和扩展LT和Raptor码。然而，他们的好处超过现有的编码方案是多方面的。首先，为了克服损坏的数据包，我们的代码使用信息理论技术，而不是密码原语。因此，在中继器和接收器之间不需要秘密信道。第二，在建议的方案中的编码器是无视对手的实力，但执行，如果它的实力是事先知道的。第三，码的稀疏结构便于高效解码。最后，当源之间不允许通信时，代码很容易适合具有多个源的分散场景。我们提出了详尽的，以及有效的解码规则。除了作为无比率码的明显用途之外，我们的码在分布式计算中具有重要的应用。
英文摘要：
In this paper, we present a new family of fountain codes which overcome adversarial errors. That is, we consider the possibility that some portion of the arriving packets of a rateless erasure code are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths which are controlled by an adversary or to a portion of the sources that are malicious. The presented codes resemble and extend LT and Raptor codes. Yet, their benefits over existing coding schemes are manifold. First, to overcome the corrupted packets, our codes use information theoretic techniques, rather than cryptographic primitives. Thus, no secret channel between the senders and the receivers is required. Second, the encoders in the suggested scheme are oblivious to the strength of the adversary, yet perform as if its strength was known in advance. Third, the sparse structure of the codes facilitates efficient decoding. Finally, the codes easily fit a decentralized scenario with several sources, when no communication between the sources is allowed. We present both exhaustive as well as efficient decoding rules. Beyond the obvious use as a rateless codes, our codes have important applications in distributed computing.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
