bibtype C - Conference Paper (international conference)
ARLID 0085052
utime 20240103184350.6
mtime 20070829235959.9
title (primary) (eng) Infinitely many information inequalities
specification
page_count 4 s.
media_type CD
serial
ARLID cav_un_epca*0085077
ISBN 978-1-4244-1397-3
title Proceedings of ISIT 2007
page_num 41-44
publisher
place Nice
name IEEE
year 2007
title (cze) Nekonečně mnoho informačních nerovností
keyword information inequality
keyword entropy function
keyword matroid
keyword polymatroid
keyword cones
author (primary)
ARLID cav_un_auth*0101161
name1 Matúš
name2 František
institution UTIA-B
full_dept Department of Decision Making Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
cas_special
project
project_id IAA100750603
agency GA AV ČR
ARLID cav_un_auth*0216427
project
project_id GA201/04/0393
agency GA ČR
ARLID cav_un_auth*0001808
research CEZ:AV0Z10750506
abstract (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.
abstract (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.
action
ARLID cav_un_auth*0229581
name IEEE International Symposium on Information Theory 2007
place Nice
dates 24.06.2007-29.06.2007
country FR
reportyear 2010
RIV BA
permalink http://hdl.handle.net/11104/0147642
arlyear 2007
mrcbU63 cav_un_epca*0085077 Proceedings of ISIT 2007 978-1-4244-1397-3 41 44 Nice IEEE 2007