Asymptotic equipartition property for a Markov source having ambiguous alphabet

07/27/2022
by   Tamás Tasnádi, et al.
0

We propose a generalization of the asymptotic equipartition property to discrete sources with an ambiguous alphabet, and prove that it holds for irreducible stationary Markov sources with an arbitrary distinguishability relation. Our definition is based on the limiting behavior of graph parameters appearing in a recent dual characterization of the Shannon capacity, evaluated at subgraphs of strong powers of the confusability graph induced on high-probability subsets. As a special case, our results give an information-theoretic interpretation of the graph entropy rate of such sources.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2022

Renyi Entropy Rate of Stationary Ergodic Processes

In this paper, we examine the Renyi entropy rate of stationary ergodic p...
research
06/06/2019

On typical encodings of multivariate ergodic sources

We show that the typical coordinate-wise encoding of multivariate ergodi...
research
03/20/2018

Packing and covering induced subdivisions

A graph class F has the induced Erdős-Pósa property if there exists a fu...
research
02/18/2021

Entropy under disintegrations

We consider the differential entropy of probability measures absolutely ...
research
03/05/2019

Probabilistic refinement of the asymptotic spectrum of graphs

The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.001...
research
05/10/2019

Robustness: a New Form of Heredity Motivated by Dynamic Networks

We investigate a special case of hereditary property in graphs, referred...

Please sign up or login with your details

Forgot password? Click here to reset