Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet(Source Coding,<Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
This paper considers the universal coding problem for stationary ergodic sources with countably infinite alphabets. We propose modified versions of LZ77 and LZ78 codes for sources with countably infinite alphabets. Then, we show that for any source μ with Eμ[log X_1]<∞, both codes are asymptotically optimum, i.e. the code length per input symbol approaches its entropy rate with probability one. Further, we show that we can modify LZ77 and LZ78 codes so that both are asymptotically optimal for a family of ergodic sources satisfying Kieffer's condition.
- 2006-10-01
著者
-
Uyematsu Tomohiko
Tokyo Inst. Of Technol. Tokyo Jpn
-
Uyematsu Tomohiko
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Kanaya Fumio
Faculty Department Of Information Science Shonan Institute Of Technology
関連論文
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet(Source Coding,Information Theory and Its Applications)
- FOREWORD
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
- Universal source coding for complementary delivery
- Information-theoretical analysis of index searching : Revised
- Relationship among Complexities of Individual Sequences over Countable Alphabet(Information Theory)
- Multiterminal source coding with complementary delivering(HISC2006)
- Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
- Network Design for Multi-Layered Photonic IP Networks Considering IP Traffic Growth(Internet)
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder(Communication Theory)(Information Theory and Its Applications)
- Randomness of Individual Sequences
- Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
- A Novel Realization of Threshold Schemes over Binary Field Extensions
- AS-2-3 Secret sharing schemes based on linear codes can be precisely characterized by the relative generalized Hamming weight
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight