Mutual information, matroids and extremal dependencies

Details Mutual information, matroids and extremal dependencies Mutual information, matroids and extremal dependencies

2010-12-21

arxiv.org/abs/1012.4755v1

Computer Science

Information Theory

Scientific paper

In this paper, it is shown that the rank function of a matroid can be represented by a "mutual information function" if and only if the matroid is binary. The mutual information function considered is the one measuring the amount of information between the inputs (binary uniform) and the output of a multiple access channel (MAC). Moreover, it is shown that a MAC whose mutual information function is integer valued is "equivalent" to a linear deterministic MAC, in the sense that it essentially contains at the output no more information than some linear forms of the inputs. These notes put emphasis on the connection between mutual information functionals and rank functions in matroid theory, without assuming prior knowledge on these two subjects. The first section introduces mutual information functionals, the second section introduces basic notions of matroid theory, and the third section connects these two subjects. It is also shown that entropic matroids studied in the literature correspond to specific cases of MAC matroids.

Affiliated with

Also associated with

No associations

Rating

Mutual information, matroids and extremal dependencies 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 Mutual information, matroids and extremal dependencies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mutual information, matroids and extremal dependencies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96655