Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet Tomohiko UYEMATSUFumio KANAYA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/10/01 Vol. E89-ANo. 10 ;
pp. 2459-2465 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Source Coding Keyword: countably infinite alphabet, ergodic source, incremental parsing, Lempel-Ziv code, string matching,
On the Asymptotic Behaviors of the Recurrence Time with Fidelity Criterion for Discrete Memoryless Sources and Memoryless Gaussian Sources Hiroki KOGASuguru ARIMOTO
A Linear Time Pattern Matching Algorithm between a String and a Tree Tatsuya AKUTSU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/03/25 Vol. E77-DNo. 3 ;
pp. 281-287 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: subtree, subgraph isomorphism, string matching, suffix tree, graph algorithms,
