Institute of Information Theory and Automation

You are here

Bibliography

Conference Paper (international conference)

Infinitely many information inequalities

Matúš František

: Proceedings of ISIT 2007, p. 41-44

: IEEE International Symposium on Information Theory 2007, (Nice, FR, 24.06.2007-29.06.2007)

: CEZ:AV0Z10750506

: IAA100750603, GA AV ČR, GA201/04/0393, GA ČR

: information inequality, entropy function, matroid, polymatroid, cones

(eng): When finite, Shannon entropies of all subvectors of a random vector are considered for the coordinates of an entropic point in Euclidean space. A linear combination of the coordinates gives rise to an unconstrained information inequality if it is nonnegative for all entropic points. With at least four variables no finite set of linear combinations generates all such inequalities. This is proved by constructing explicitly an infinite sequence of new linear information inequalities and a curve in a special geometric position to the half/-spaces defined by the inequalities. The inequalities are constructed recurrently by adhesive pasting of restrictions of polymatroids and the curve ranges in the closure of a set of the entropic points.

(cze): Byly nalezeny nekonečné posloupnosti nových infomačních nerovností mezi čtyřmi náhodnými veličinami a dokázáno, že kužel limit entropických funkcí není konečně generovaný, pro nejméně čtyřy veličiny.

: BA

2019-01-07 08:39