0345053 20240103193625.220100914235959.9 000287512700256 10.1109/ISIT.2010.5513700 5 s. cav_un_epca*0347032978-1-4244-7892-71272-1276PiscatawayIEEE2010 colorings ergodic sequences entropy rate asymptotic equipartition property cav_un_auth*0101161 Matúš František Matematická teorie rozhodování Department of Decision Making Theory MTR MTR UTIA-B Department of Decision Making Theory Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0219359 Kupsa Michal Stochastická informatika Department of Stochastic Informatics SI SI UTIA-B Department of Stochastic Informatics Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2010/MTR/matus-on colorings of bivariate random sequences.pdf IAA100750603 GA AV ČR cav_un_auth*0216427 KJB100750901 GA AV ČR cav_un_auth*0253173 GA201/08/0539 GA ČR cav_un_auth*0239648 CEZ:AV0Z10750506 The ergodic sequences consisting of vectors (X_n,Y_n), over a finite alphabet AxB are colored with exp(na) colors for A_n and xp(nb) colors for B_n. Generic behavior of the colorings in terms of probabilities of monochromatic rectangles intersected with typical sets is examined. When n increases a big majority of pairs of colorings produces rectangles whose probabilities are bounded uniformly from above. Limiting rates of bounds are worked out in all regimes of the rates a and b of colorings. As a consequence, generic behavior of the colorings in terms of Shannon entropies of the partitions into rectangles is described. cav_un_auth*0262416 IEEE International Symposium on Information Theory 2010 Austin 13.06.2010-18.06.2010 US 2011 BD http://hdl.handle.net/11104/0186418 2010 000287512700256 WOS cav_un_epca*0347032 Information Theory Proceedings (ISIT), 2010 IEEE International Symposium 978-1-4244-7892-7 1272 1276 Piscataway IEEE 2010