A New Construction Method for Networks from Matroids Conference Paper uri icon

abstract

  • We study the problem of information flow in communication networks with noiseless links in which the dependency relations among the data flowing on the different network edges satisfy matroidal constraints. We present a construction that maps any given matroid to a network that admits vector linear network codes over a certain field if and only if the matroid has a multilinear representation over the same field. This new construction strengthens previous results in the literature and, thus, establishes a deeper connection between network coding and matroid theory. We also explore another, more general, mathematical construct referred to as FD-relation which is more suitable than matroids in capturing the dependency relations in general networks. 2009 IEEE.

name of conference

  • 2009 IEEE International Symposium on Information Theory

published proceedings

  • 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4

author list (cited authors)

  • El Rouayheb, S., Sprintson, A., & Georghiades, C.

citation count

  • 11

complete list of authors

  • El Rouayheb, Salim||Sprintson, Alex||Georghiades, Costas

publication date

  • June 2009