Improvement of Upper Bound to the Optimal Average Cost of the Variable Length Binary Code (Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
We consider the optimal average cost of variable length source code averaged with a given probability distribution over source messages. The problem was argued in Csiszar and Korner's book [1]. In a special case of binary alphabet, we find an upper bound to the optimal cost minus an ideal cost, where the ideal cost is the entropy of the source divided by a unique scalar that makes negative costs logarithmic probabilities. Our bound is better than the one given in the book.
- 社団法人電子情報通信学会の論文
- 1999-10-25
著者
-
Kawabata T
Department Of Information And Communication Engineering University Of Elecro-communications
-
Kawabata Tsutomu
Department Of Information And Communication Engineering University Of Electro-communications
-
Kawabata Tsutomu
Department Of Communications And Systems Engineering University Of Electro-communications
関連論文
- Videothoracoscopic Surgery for Thoracic Neurogenic Tumors : A 7-Year Experience
- Endobronchial Metastasis from Renal Cell Carcinoma : Report of a Case
- 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
- On Complexity of Computing the Permanent of a Rectangular Matrix (Special Section on Discrete Mathematics and Its Applications)
- Novel Approach for a Pulmonary Bronchogenic Cyst : A Report of a Case
- Level-Crossing Problem of a Gaussian Process Having Gaussian Power Spectrum Density
- On the distribution densities of capacity fade and inter-fade time intervals over SISO Rayleigh mobile fading channels
- A Post-Processing for the Enumerative Code Implementation of Ziv-Lempel Incremental Parsing(Fundamental Theories for Communications)
- A Capacity Formula for Multi-Input Erasure Channel(Information Theory and Its Applications)