A Note on a Sequence Related to the Lempel-Ziv Parsing(Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
The expected lengths of the parsed segments obtained by applying Lempel-Ziv incremental parsing algorithm for i.i.d.source satisfy simple recurrence relations. By extracting a combinatorial essence from the previous proof[5], we obtain a simpler derivation.
- 社団法人電子情報通信学会の論文
- 2000-10-25
著者
-
Kawabata T
Department Of Information And Communication Engineering University Of Elecro-communications
-
KAWABATA Tsutomu
The author is with the Department of Information and Communication Engineering, University of Electr
関連論文
- Theoretical Analysis of Zero-redundancy Estimator with a Finite Window for a Memoryless Source
- Broadcasting for Dirty Printers
- Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source(Information Theory, Information Theory and Its Applications)
- On Muroga's Method for Channel Capacity
- An Analysis of Two-Stage Multi-Dimensional Quantizer with Geodesic Compander
- Enumerating the Uniform Switching System by K-Sets (Special Section on Discrete Mathematics and Its Applications)
- A Note on a Sequence Related to the Lempel-Ziv Parsing(Special Section on Information Theory and Its Applications)
- A Context Tree Weighting Algorithm with an Incremental Context Set(Special Section on Information Theory and Its Applications)
- Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code (Special Section on Information Theory and Its Applications)
- A Note on Lempel-Ziv-Yokoo Algorithm (Special Section on Information Theory and Its Applications)
- First Passage Time Intervals of Gaussian Processes