Number of the records: 1  

On colorings of bivariate random sequences

  1. 1.
    SYSNO ASEP0345053
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleOn colorings of bivariate random sequences
    Author(s) Matúš, František (UTIA-B) RID
    Kupsa, Michal (UTIA-B) RID, ORCID
    Source TitleInformation Theory Proceedings (ISIT), 2010 IEEE International Symposium. - Piscataway : IEEE, 2010 - ISBN 978-1-4244-7892-7
    Pagess. 1272-1276
    Number of pages5 s.
    ActionIEEE International Symposium on Information Theory 2010
    Event date13.06.2010-18.06.2010
    VEvent locationAustin
    CountryUS - United States
    Event typeWRD
    Languageeng - English
    CountryUS - United States
    Keywordscolorings ; ergodic sequences ; entropy rate ; asymptotic equipartition property
    Subject RIVBD - Theory of Information
    R&D ProjectsIAA100750603 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    KJB100750901 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    GA201/08/0539 GA ČR - Czech Science Foundation (CSF)
    CEZAV0Z10750506 - UTIA-B (2005-2011)
    UT WOS000287512700256
    DOI10.1109/ISIT.2010.5513700
    AnnotationThe 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.
    WorkplaceInstitute of Information Theory and Automation
    ContactMarkéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201.
    Year of Publishing2011
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.