We consider the problem of computing the capacity of a coded, multicast network over a small alphabet. We introduce a novel approach to this problem based on mixed integer programming. As an application of our approach, we recover, extend and refine various results that were previously obtained with case-by-case analyses or specialized arguments, giving evidence of the wide applicability of our approach and its potential. We also provide two simple ideas that reduce the complexity of our method for some families of networks. We conclude the paper by outlining a research program we wish to pursue in the future to investigate the capacity of large networks affected by noise, based on the approach proposed in this paper.
翻译:我们考虑用一个小字母计算一个编码的多播网络的能力的问题,我们采用基于混合整数编程的新办法解决这个问题,作为我们的方法的应用,我们恢复、扩大和完善以前通过个案分析或专门论据取得的各种结果,证明我们的方法及其潜力的广泛适用性,我们还提出两个简单的想法,减少我们方法对某些网络家庭的复杂性,我们最后我们根据本文件建议的办法,概述了我们今后希望开展的一项研究方案,以调查受噪音影响的大型网络的能力。