Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids

Details Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids

2010-04-05

arxiv.org/abs/1004.0727v1

Computer Science

Information Theory

5 pages, submitted to IEEE ISIT 2010

Scientific paper

We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the network is a matroidal network associated with a representable matroid over a finite field. It follows that a network is scalar-linearly solvable if and only if the network is a matroidal network associated with a representable matroid over a finite field. We note that this result combined with the construction method due to Dougherty et al. gives a method for generating scalar-linearly solvable networks. Using the converse implicitly, we demonstrate scalar-linear solvability of two classes of matroidal networks: networks constructed from uniform matroids and those constructed from graphic matroids.

Affiliated with

Also associated with

No associations

Rating

Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalar-linear Solvability of Matroidal Networks Associated with Representable Matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56631