bibtype	C - Conference Paper (international conference)
ARLID	0475977
utime	20240103214232.8
mtime	20170707235959.9
SCOPUS	85034106217
WOS	000430345201103
DOI	10.1109/ISIT.2017.8006769
title (primary) (eng)	Urns and entropies revisited
specification	page_count 4 s. media_type P
serial	ARLID cav_un_epca*0477800 ISBN 978-1-5090-4097-1 ISSN Proceedings of the ISIT 2017 - 2017 IEEE International Symposium on Information Theory title Proceedings of the ISIT 2017 - 2017 IEEE International Symposium on Information Theory page_num 1451-1454 publisher place Piscataway name IEEE year 2017
keyword	urn
keyword	entropy
keyword	bounds
author (primary)	ARLID cav_un_auth*0101161 name1 Matúš name2 František institution UTIA-B full_dept (cz) Matematická teorie rozhodování full_dept (eng) Department of Decision Making Theory department (cz) MTR department (eng) MTR full_dept Department of Decision Making Theory fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source	url http://library.utia.cas.cz/separaty/2017/MTR/matus-0475977.pdf
cas_special	project ARLID cav_un_auth*0332303 project_id GA16-12010S agency GA ČR country CZ abstract (eng) An urn containing colored balls is sampled sequentially without replacement. New lower and upper bounds on the conditional and unconditional mutual information, and multi information are presented. They estimate dependence between drawings in terms of the colored ball configuration. Asymptotics are worked out when the number of balls increases and the proportion of the balls of each color stabilizes. Inequalities by Stam and by Diaconis and Freedman are compared and improved. Distances between the sampling with and without replacement, and between the multinomial and multivariate hypergeometric distributions are discussed. action ARLID cav_un_auth*0347522 name IEEE International Symposium on Information Theory 2017 (ISIT 2017) dates 20170625 mrcbC20-s 20170630 place Aachen country DE RIV BA FORD0 10000 FORD1 10100 FORD2 10101 reportyear 2018 num_of_auth 1 presentation_type PR inst_support RVO:67985556 permalink http://hdl.handle.net/11104/0274020 confidential S mrcbC83 RIV/67985556:_____/17:00475977!RIV18-AV0-67985556 191975655 Doplnění UT WOS mrcbC83 RIV/67985556:_____/17:00475977!RIV18-GA0-67985556 191965007 Doplnění UT WOS mrcbC86 n.a. Proceedings Paper Computer Science Theory Methods|Engineering Electrical Electronic mrcbC86 n.a. Proceedings Paper Computer Science Theory Methods|Engineering Electrical Electronic mrcbC86 n.a. Proceedings Paper Computer Science Theory Methods|Engineering Electrical Electronic arlyear 2017 mrcbU14 85034106217 SCOPUS mrcbU24 PUBMED mrcbU34 000430345201103 WOS mrcbU63 cav_un_epca*0477800 Proceedings of the ISIT 2017 - 2017 IEEE International Symposium on Information Theory 978-1-5090-4097-1 2157-8117 1451 1454 Piscataway IEEE 2017