Dual Quantity of the Distortion-Complexity and a Universal Data-Base for Fixed-Rate Data Compression with Distortion (Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we define the distortion at a certain complexity level, which is the dual quantity of the distortion-complexity. We prove a theorem dual to the theorem which we have given of the asymptotic property of the distortion-complexity. We also give a universal data-base for fixed-rate data compression with distortion and prove its asymptotic optimality.
- 社団法人電子情報通信学会の論文
- 1996-09-25
著者
関連論文
- Secret Key Capacity and Advantage Distillation Capacity(Cryptography,Information Theory and Its Applications)
- Secret Key Agreement under Sampling Attack
- Secret Key Capacity and Advantage Distillation Capacity
- A Construction of Lossy Source Code Using LDPC Matrices
- A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels Using Sparse Matrices
- An Almost Sure Recurrence Theorem with Distortion for Stationary Ergodic Sources
- Source Coding Algorithms Using the Randomness of a Past Sequence(Information Theory)
- Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check Matrices(Information Theory)
- A Universal Data-Base for Data Compression
- An Information-Spectrum Approach to Rate-Distortion Function with Side Information
- An Information-Spectrum Approach to Rate-Distortion Function with Side Information
- On the Problem of Generating Mutually Independent Random Sequences
- Dual Quantity of the Distortion-Complexity and a Universal Data-Base for Fixed-Rate Data Compression with Distortion (Special Section on Information Theory and Its Applications)
- Simulated Random Coding Algorithm for Correlated Sources with Ensemble of Linear Matrices(Information Theory)
- Channel Coding Algorithm Simulating the Random Coding(Information Theory)