On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information
スポンサーリンク
概要
- 論文の詳細を見る
The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. In the single source coding problem, there were many researches on the overflow probability. Recently, the source coding problem for correlated sources, such as Slepian-Wolf coding problem or source coding problem with side information, is one of main topics in information theory. In this paper, we consider the source coding problem with side information. In particular, we consider the FV code in the case that the encoder and the decoder can see side information. In this case, several codes were proposed and their mean code lengths were analyzed. However, there was no research about the overflow probability. We shall show two lemmas about the overflow probability. Then we obtain the condition that there exists a FV code under the condition that the overflow probability is smaller than or equal to some constant.
- 2011-11-01
著者
-
Matsushima Toshiyasu
School Of Fundamental Science And Eng. Waseda University
-
Nomura Ryo
School Of Network And Information Senshu Univ.
-
Nomura Ryo
School Of Network And Information Senshu University
関連論文
- Improved MACs from Differentially-Uniform Permutations(Information Security)
- A Note on the ε-Overflow Probability of Lossless Codes(Information Theory)
- Parallel Architecture for Generalized LFSR in LSI Built-In Self Testing
- The generalization of Bayesian Network's deductive method
- On the Condition of ε-Transmissible Joint Source-Channel Coding for General Sources and General Channels
- Fingerprinting Codes for Multimedia Data against Averaging Attack
- Density Evolution Analysis of Robustness for LDPC Codes over the Gilbert-Elliott Channel
- A Generalization of the Parallel Error Correcting Codes by Allowing Some Random Errors(Information Theory and Its Applications)
- On the Generalized Viterbi Algorithm using Likelihood Ratio Testing
- Parallel Encoder and Decoder Architecture for Cyclic Codes (Special Section on Information Theory and Its Applications)
- An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
- On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information