论文标题
线网络的批处理代码的上限可伸缩性
Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks
论文作者
论文摘要
具有缓冲尺寸约束的线网络的能力是一个开放的，但实际上重要的问题。在本文中，研究了线网络的一类代码的上限（称为批处理代码）的上限。批处理代码可实现一系列的缓冲尺寸约束，并且足以包括文献中研究线网络中研究的特殊编码方案。现有的作品表征了几类参数集的批处理代码的可实现率，但将切割设置绑定为最佳现有的一般上限。在本文中，我们将批处理代码的可实现速率作为这些参数集的线网络长度的函数提供上限。与现有的可实现性结果相比，我们的上限按网络长度的顺序紧密。
The capacity of line networks with buffer size constraints is an open, but practically important problem. In this paper, the upper bound on the achievable rate of a class of codes, called batched codes, is studied for line networks. Batched codes enable a range of buffer size constraints, and are general enough to include special coding schemes studied in the literature for line networks. Existing works have characterized the achievable rates of batched codes for several classes of parameter sets, but leave the cut-set bound as the best existing general upper bound. In this paper, we provide upper bounds on the achievable rates of batched codes as functions of line network length for these parameter sets. Our upper bounds are tight in order of the network length compared with the existing achievability results.
