收集重叠世代的编码优惠券
Collecting Coded Coupons over Overlapping Generations
摘要：
由于诸如计算复杂性之类的许多实际原因，在P2P分发网络和其他应用中对子集（称为代）而不是对所有内容块进行编码是必要的。仅在代内编码的惩罚是总体吞吐量降低。先前已经表明，允许连续的世代以从头到脚的方式重叠可以提高吞吐量。在这里，我们提出并研究了一个计划，称为{ \it随机附件码}，创建共享的数据包之间的任何两代随机，而不仅仅是相邻的。通过优化很少的设计参数，我们获得了一个简单的方案，该方案在预期吞吐量和解码失败概率的收敛速度方面都优于具有相当计算复杂性的非重叠和从头到脚重叠方案。零。我们提供了一个实用的算法，用于精确分析有限长度信息的随机附件码的预期吞吐量。该算法使我们能够量化的吞吐量与计算复杂性的权衡，这是必要的方案参数的最佳选择。
英文摘要：
Coding over subsets (known as generations) rather than over all content blocks in P2P distribution networks and other applications is necessary for a number of practical reasons such as computational complexity. A penalty for coding only within generations is an overall throughput reduction. It has been previously shown that allowing contiguous generations to overlap in a head-to-toe manner improves the throughput. We here propose and study a scheme, referred to as the {\it random annex code}, that creates shared packets between any two generations at random rather than only the neighboring ones. By optimizing very few design parameters, we obtain a simple scheme that outperforms both the non-overlapping and the head-to-toe overlapping schemes of comparable computational complexity, both in the expected throughput and in the rate of convergence of the probability of decoding failure to zero. We provide a practical algorithm for accurate analysis of the expected throughput of the random annex code for finite-length information. This algorithm enables us to quantify the throughput vs.computational complexity tradeoff, which is necessary for optimal selection of the scheme parameters.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
