vix.ing · top · new · best · stats · spec

Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation

2016/07/22 by Jayant Apte, Apte, Jayant, John MacLaren Walsh +1
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1607.06833

23 pages, 15 figures

openalex publication_date 2016/07/22 · openalex created_date 2016/08/23 · arxiv created 2017/07/06 · arxiv updated 2017/07/10 · openalex updated_date 2026/07/28

Abstract

Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations of linear codes, to applied ones such as designing coded networks, distributed storage systems, and caching systems, can be posed as polyhedral projections. These problems are demonstrated to exhibit multiple types of polyhedral symmetries. It is shown how these symmetries can be exploited to reduce the complexity of solving these problems through polyhedral projection.

Citations

Related