2022/12/14 by Christopher Hojny, Hojny, Christopher, Altan B. Kılıç +3
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Interconnection Networks and Systems #Optimization and Control (math.OC) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2212.07230
openalex publication_date 2022/12/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.