Relationship among complexities of individual sequences over countable alphabet

作     者：Kuzuoka, Shigeaki Uyematsu, Tomohiko 

作者机构：Tokyo Inst Technol Dept Commun & Integrated Syst Tokyo 1528550 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (电子信息通信学会汇刊：电子学、通信及计算机科学基础)

年 卷 期：2006年第E89A卷第7期

页      面：2047-2055页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：empirical entropy individual sequence Lempel-Ziv algorithm universal source coding 

摘      要：This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy rate regarding a Markov source are asymptotically equal and lower bounded by the maximum number of phrases in distinct parsing of the sequence. Some connections with source coding theorems are also investigated.