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.
翻译:我们建议将无药可救设备属性普遍化为字母模糊的离散来源,并证明它具有不可复制的固定的马尔科夫来源,具有任意的区别关系,我们的定义基于最近对香农能力的双重定性中出现的图表参数的有限行为,根据高概率子集引致的易解性图的强力子集进行评估。作为一个特例,我们的结果对这些来源的图表的导引速率进行了信息理论解释。