| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0345053 |
| utime |
20240103193625.2 |
| mtime |
20100914235959.9 |
| WOS |
000287512700256 |
| DOI |
10.1109/ISIT.2010.5513700 |
| title
(primary) (eng) |
On colorings of bivariate random sequences |
| specification |
|
| serial |
| ARLID |
cav_un_epca*0347032 |
| ISBN |
978-1-4244-7892-7 |
| title
|
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium |
| page_num |
1272-1276 |
| publisher |
| place |
Piscataway |
| name |
IEEE |
| year |
2010 |
|
|
| keyword |
colorings |
| keyword |
ergodic sequences |
| keyword |
entropy rate |
| keyword |
asymptotic equipartition property |
| author
(primary) |
| ARLID |
cav_un_auth*0101161 |
| name1 |
Matúš |
| name2 |
František |
| full_dept (cz) |
Matematická teorie rozhodování |
| full_dept (eng) |
Department of Decision Making Theory |
| department (cz) |
MTR |
| department (eng) |
MTR |
| institution |
UTIA-B |
| full_dept |
Department of Decision Making Theory |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0219359 |
| name1 |
Kupsa |
| name2 |
Michal |
| full_dept (cz) |
Stochastická informatika |
| full_dept |
Department of Stochastic Informatics |
| department (cz) |
SI |
| department |
SI |
| institution |
UTIA-B |
| full_dept |
Department of Stochastic Informatics |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| cas_special |
| project |
| project_id |
IAA100750603 |
| agency |
GA AV ČR |
| ARLID |
cav_un_auth*0216427 |
|
| project |
| project_id |
KJB100750901 |
| agency |
GA AV ČR |
| ARLID |
cav_un_auth*0253173 |
|
| project |
| project_id |
GA201/08/0539 |
| agency |
GA ČR |
| ARLID |
cav_un_auth*0239648 |
|
| research |
CEZ:AV0Z10750506 |
| abstract
(eng) |
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. |
| action |
| ARLID |
cav_un_auth*0262416 |
| name |
IEEE International Symposium on Information Theory 2010 |
| place |
Austin |
| dates |
13.06.2010-18.06.2010 |
| country |
US |
|
| reportyear |
2011 |
| RIV |
BD |
| permalink |
http://hdl.handle.net/11104/0186418 |
| arlyear |
2010 |
| mrcbU34 |
000287512700256 WOS |
| mrcbU63 |
cav_un_epca*0347032 Information Theory Proceedings (ISIT), 2010 IEEE International Symposium 978-1-4244-7892-7 1272 1276 Piscataway IEEE 2010 |
|