A Computational Approach for Determining Rate Regions and Codes Using Entropic Vector Bounds
A computational technique for determining rate regions for networks and multilevel diversity coding systems based on inner and outer bounds for the region of entropic vectors is discussed. An inner bound based on binary representable matroids is discussed that has the added benefit of identifying optimal linear codes. The technique is demonstrated on a series of small examples of multilevel diversity coding systems. The core contribution of this paper is the collection of a series of techniques from the literature that can be used to determine key characteristics, the fundamental rate region, together with the field size and linear codes to achieve it, for Multilevel Diversity Coding Systems (MDCS) and more broadly network coded networks.