Network combination operations preserving the sufficiency of linear network codes
Network combination operations preserving the sufficiency of linear network codes
复制标题
网络组合操作保持线性网络码的充分性
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
J. Walsh
中科院分区：
文献类型：
--
作者：
Congduan Li;S. Weber;J. Walsh
定义并给出将较小网络组合成较大网络的操作，其方式使得较大网络的速率区域可以直接从较小网络的相关速率区域获得。所选择的操作还具有在组合中保持线性网络码类的充分性和香农（多阵）外界的严密性的性质。定义了四种这样的操作，所考虑的线性码的类别包括标量码和向量码。证明了这些操作使人们能够获得任意大小的网络的速率区域，并确定某些类别的线性码是否足够和/或香农外界界对这些网络是否紧。
Operations that combine smaller networks into a larger network in a manner such that the rate region of the larger network can be directly obtained from the associated rate regions of the smaller networks are defined and presented. The operations are selected to also have the property that the sufficiency of classes of linear network codes and the tightness of the Shannon (polymatroid) outer bound are preserved in the combination. Four such operations are defined, and the classes of linear codes considered include both scalar and vector codes. It is demonstrated that these operations enable one to obtain rate regions for networks of arbitrary size, and to also determine if some classes of linear codes are sufficient and/or the Shannon outer bound bound is tight for these networks.