Relationship among Complexities of Individual Sequences over Countable Alphabet

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 regarding a finite state source are asymptotically equal and lower bounded by the muximun number of phrases in distinct parsing of the sequence. Some connections with source coding theorems are also investigated. Further, we consider the empirical entropies with fidelity criterion.

• Type: Journal
• Year: 2006
• Where: IEICET
• Authors: Shigeaki Kuzuoka, Tomohiko Uyematsu
• Keywords: Empirical Entropies, Finite State Source, IEICET 2006, Infinite Alphabet