An Analysis of SlepianWolf Coding Problem Based on the Asymptotic Normality
Access this Article
Search this Article
Author(s)
Abstract
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 multiuser 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 SlepianWolf type problem more precisely than the previous result.
Journal

 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 94(11), 22202225, 20111101
The Institute of Electronics, Information and Communication Engineers