Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we consider fixed-to-fixed length (FF) coding of a general source X with vanishing error probability and define two kinds of optimalities with respect to the coding rate and the redundancy, where the redundancy is defined as the difference between the coding rate and the symbolwise ideal codeword length. We first show that the infimum achievable redundancy coincides with the asymptotic width W(X) of the entropy spectrum. Next, we consider the two sets $\mCH(\bX)$ and $\mCW(\bX)$ and investigate relationships between them, where $\mCH(\bX)$ and $\mCW(\bX)$ denote the sets of all the optimal FF codes with respect to the coding rate and the redundancy, respectively. We give two necessary and sufficient conditions corresponding to $\mCH(\bX) \subseteq \mCW(\bX)$ and $\mCW(\bX) \subseteq \mCH(\bX)$, respectively. We can also show the existence of an FF code that is optimal with respect to both the redundancy and the coding rate.
著者
-
Iwata Ken-ichi
Graduate School Of Engineering Hiroshima University
-
KOGA Hiroki
Graduate School of Engineering, The University of Tokyo
-
ARIMURA Mitsuharu
Department of Applied Computer Sciences, Shonan Institute of Technology
関連論文
- Optimal Synthesis of a Class of 2-D Digital Filters with Minimum L_2-Sensitivity and No Overflow Oscillations(Digital Signal Processing)
- Information-Spectrum Characterization of Multiple-Access Channels with Correlated Sources(Information Theory)
- An Information-Spectrum Approach to Rate-Distortion Function with Side Information
- An Information-Spectrum Approach to Rate-Distortion Function with Side Information
- A Digital Fingerprinting Code Based on a Projective Plane and Its Identifiability of All Malicious Users
- The Optimal (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels
- A relationship between Data Compression using Anti-dictionaries and Burrows-Wheeler Transformation
- Information-Spectrum Characterization of Broadcast Channel with General Source(Information Theory, Information Theory and Its Applications)
- Channel Coding Algorithm Simulating the Random Coding(Information Theory)
- Four Limits in Probability and Their Roles in Source Coding
- Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes