
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Intrinsic Randomness Problem in the Framework of SlepianWolf Separate Coding System
Yasutada OOHAMA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E90A
No.7
pp.14061417 Publication Date: 2007/07/01 Online ISSN: 17451337
DOI: 10.1093/ietfec/e90a.7.1406 Print ISSN: 09168508 Type of Manuscript: PAPER Category: Information Theory Keyword: random number generation, SlepianWolf separate coding, error exponent, universal coding,
Full Text: PDF>>
Summary:
This paper deals with the random number generation problem under the framework of a separate coding system for correlated memoryless sources posed and investigated by Slepian and Wolf. Two correlated data sequences with length n are separately encoded to nR_{1}, nR_{2} bit messages at each location and those are sent to the information processing center where the encoder wish to generate an approximation of the sequence of independent uniformly distributed random variables with length nR_{3} from two received random messages. The admissible rate region is defined by the set of all the triples (R_{1},R_{2},R_{3}) for which the approximation error goes to zero as n tends to infinity. In this paper we examine the asymptotic behavior of the approximation error inside and outside the admissible rate region. We derive an explicit lower bound of the optimal exponent for the approximation error to vanish and show that it can be attained by the universal codes. Furthermore, we derive an explicit lower bound of the optimal exponent for the approximation error to tend to 2 as n goes to infinity outside the admissible rate region.

