## On Network Coding Capacity- Matroidal Networks and Network Capacity Regions (2010)

Citations: | 1 - 1 self |

### BibTeX

@MISC{Kim10onnetwork,

author = {Anthony Eli Kim},

title = {On Network Coding Capacity- Matroidal Networks and Network Capacity Regions},

year = {2010}

}

### OpenURL

### Abstract

One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity regions. In our matroidal approach, we prove the converse of the theorem which states that, if a network is scalar-linearly solvable then it is a matroidal network associated with a representable matroid over a finite field. As a consequence, we obtain a correspondence between scalar-linearly solvable networks and representable matroids over finite fields in the framework of matroidal networks. We prove a theorem about the scalar-linear solvability of networks and field characteristics. We provide a method for generating scalar-linearly solvable networks that are potentially different from