An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
スポンサーリンク
概要
- 論文の詳細を見る
Source coding theorem reveals the minimum achievable code length under the condition that the error probability is smaller than or equal to some small constant. In the single user communication system, the source coding theorem was proved for general sources. The class of general source is quite large and it is important result since the result can be applied for a wide class of sources. On the other hand there are several studies to evaluate the achievable code length more precisely for the restricted class of sources by using the restriction. In the multi-user communication system, although the source coding theorem was proved for general correlated sources, there is no study to evaluate the achievable code length more precisely. In this study, we consider the stationary memoryless correlated sources and show the coding theorem for Slepian-Wolf type problem more precisely than the previous result.
- （社）電子情報通信学会の論文
- 2011-11-01
著者
-
Matsushima Toshiyasu
School Of Fundamental Science And Eng. Waseda University
-
Nomura Ryo
School Of Network And Information Senshu Univ.
関連論文
- 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