Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
スポンサーリンク
概要
- 論文の詳細を見る
This paper investigates the fixed-slope lossy coding of individual sequences and nonstationary sources. We clarify that, for a given individual sequence, the optimal cost attainable by the blockwise lossy encoders is equal to the optimal average cost with respect to the empirical distribution of the given sequence. Moreover, we show that, for a given nonstationary source, the optimal cost attainable by the blockwise encoders is equal to the supremum of the optimal average cost over all the stationary sources in the stationary hull of the given source. In addition, we show that the universal lossy coding algorithm based on Lempel-Ziv 78 code attains the optimal cost for any individual sequence and any nonstationary source.
- （社）電子情報通信学会の論文
- 2008-03-01
著者
-
UYEMATSU Tomohiko
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Uyematsu Tomohiko
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
KUZUOKA Shigeaki
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Kuzuoka Shigeaki
Department Of Computer And Communication Sciences Wakayama University
関連論文
- 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
- 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)
- Slepian-Wolf Coding of Individual Sequences Based on Ensembles of Linear Functions
- A Sufficient Condition for the Existence of a Universal Slepian-Wolf Code
- An Application of Linear Codes to the Problem of Source Coding with Partial Side Information
- Randomness of Individual Sequences
- Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
- On the Suboptimality of Linear Lossy Codes
- A Novel Realization of Threshold Schemes over Binary Field Extensions
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight