Sciweavers

IEICET
2006

Relationship among Complexities of Individual Sequences over Countable Alphabet

13 years 11 months ago
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.
Shigeaki Kuzuoka, Tomohiko Uyematsu
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where IEICET
Authors Shigeaki Kuzuoka, Tomohiko Uyematsu
Comments (0)