On Multi-Source Networks: Enumeration, Rate Region Computation, and Hierarchy

@article{Li2017OnMN,
  title={On Multi-Source Networks: Enumeration, Rate Region Computation, and Hierarchy},
  author={Congduan Li and Steven P. Weber and John MacLaren Walsh},
  journal={IEEE Transactions on Information Theory},
  year={2017},
  volume={63},
  pages={7283-7303}
}
Recent algorithmic developments have enabled computers to automatically determine and prove the capacity regions of small hypergraph networks under network coding. A structural theory relating network coding problems of different sizes is developed to make the best use of this newfound computational capability. A formal notion of network minimality is developed, which removes components of a network coding problem that are inessential to its core complexity. Equivalence between different… 

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

The problem of automating rate region converse proofs in multi-source network coding is considered, and an algorithm for explicitly computing polyhedral outer bounds on the rate regions of

Inner Bounds for the Almost Entropic Region and Network Code Construction

TLDR
A random local search algorithm is designed to find an entropic vector and associated distribution near to a given target vector and extended to optimize functions of joint entropies, and a novel approach to constructing network codes is shown.

Network combination operations preserving the sufficiency of linear network codes

TLDR
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.

Optimization-based linear network coding for general connections of continuous flows

TLDR
This paper considers a new method for constructing linear network codes for general connections of continuous flows to minimize the total cost of edge use based on mixing and proposes two equivalent alternative formulations with discrete mixing and continuous mixing.

Optimization-Based Linear Network Coding for General Connections of Continuous Flows

TLDR
This paper considers a new method for constructing linear network codes for general connections of continuous flows to minimize the total cost of the edge use based on mixing and proposes two equivalent alternative formulations with discrete mixing and continuous mixing.

Computational Techniques for Investigating Information Theoretic Limits of Information Systems

TLDR
This work proposes using the disjoint-set data structure to algorithmically identify the reduction mapping, instead of relying on exhaustive enumeration in the equivalence classification, and considers four techniques to investigate the fundamental limits of information systems.

Hierarchical Performance Analysis on Random Linear Network Coding

TLDR
Different upper bounds on the failure probability of RLNC for the network constrained by different partial network topology information are obtained and it is observed that if more networkTopology information can be utilized, tighter upper bounds can be obtained, as expected.

Proving and Disproving Information Inequalities: Theory and Scalable Algorithms

TLDR
This paper demonstrates how linear programming can be used to find an analytic proof of an information inequality or an analytic counterexample to disprove it if the inequality is not true in general and proposes a scalable algorithmic framework based on the alternating direction method of multipliers to solve a multitude of user-specific problems.

On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region

  • Yirui LiuJ. Walsh
  • Computer Science
    2019 IEEE International Symposium on Information Theory (ISIT)
  • 2019
A new method is presented, consisting of exclusively simple linear algebra computations, for computing the linear programming Shannon outer bound to the network coding capacity region of a directed

Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding

TLDR
Methods for solving CLRP built from group theoretic techniques for combinatorial generation are developed and described and several computational experiments with interesting instances of network coding and secret sharing demonstrating the utility of the method are provided.

References

SHOWING 1-10 OF 72 REFERENCES

On equivalence between network topologies

  • M. EffrosT. HoS. Jalali
  • Computer Science
    2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2010
TLDR
A new hierarchical approach is proposed which finds upper and lower bounding networks of smaller size for a given network, and is able to simplify some families of network structures without any loss in accuracy.

Network embedding operations preserving the insufficiency of linear network codes

  • Congduan LiS. WeberJ. Walsh
  • Computer Science
    2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
TLDR
Experimental results on the rate regions of multilevel diversity coding systems (MDCS), a sub-class of the broader family of multi-source multi-sink networks with special structure, are presented and it is proven that they have the desired inheritance property.

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

The problem of automating rate region converse proofs in multi-source network coding is considered, and an algorithm for explicitly computing polyhedral outer bounds on the rate regions of

Networks, Matroids, and Non-Shannon Information Inequalities

TLDR
The Vamos network is constructed, and it is proved that Shannon-type information inequalities are insufficient even for computing network coding capacities of multiple-unicast networks.

Network combination operations preserving the sufficiency of linear network codes

TLDR
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.

Algorithms for computing network coding rate regions via single element extensions of matroids

TLDR
This paper proposes an algorithm, which essentially builds all matroids that form valid network codes for a given network from scratch, as network-constrained matroid enumeration.

Computer aided proofs for rate regions of independent distributed source coding problems

TLDR
The rate regions of independent distributed source coding (IDSC) problems, a sub-class of the broader family of multi-source multi-sink networks, are investigated and exact rate regions are proven together with code constructions that achieve them.

A new computational approach for determining rate regions and optimal codes for coded networks

A new computational technique is presented for determining rate regions for coded networks. The technique directly manipulates the extreme ray representation of inner and outer bounds for the region

A Theory of Network Equivalence – Part II: Multiterminal Channels

TLDR
Bounding the difference between upper and lower bounding models bounds both the accuracy of the technique and the price of separating source-network coding from channel coding, enabling the application of tools and results derived in that domain.

Dualities Between Entropy Functions and Network Codes

  • T. ChanA. Grant
  • Computer Science
    IEEE Transactions on Information Theory
  • 2008
TLDR
These duality results provide an alternative proof of the insufficiency of linear (and abelian) network codes, and the utility of non-Shannon inequalities to tighten outer bounds on network coding capacity regions.
...