IEICE TRANSACTIONS on Fundamentals
Intrinsic Randomness Problem in the Framework of Slepian-Wolf Separate Coding System
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 nR1, nR2 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 nR3 from two received random messages. The admissible rate region is defined by the set of all the triples (R1,R2,R3) 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.7 pp.1406-1417
- Publication Date
- 2007/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e90-a.7.1406
- Type of Manuscript
- PAPER
- Category
- Information Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yasutada OOHAMA, "Intrinsic Randomness Problem in the Framework of Slepian-Wolf Separate Coding System" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 7, pp. 1406-1417, July 2007, doi: 10.1093/ietfec/e90-a.7.1406.
Abstract: 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 nR1, nR2 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 nR3 from two received random messages. The admissible rate region is defined by the set of all the triples (R1,R2,R3) 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.7.1406/_p
Copy
@ARTICLE{e90-a_7_1406,
author={Yasutada OOHAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Intrinsic Randomness Problem in the Framework of Slepian-Wolf Separate Coding System},
year={2007},
volume={E90-A},
number={7},
pages={1406-1417},
abstract={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 nR1, nR2 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 nR3 from two received random messages. The admissible rate region is defined by the set of all the triples (R1,R2,R3) 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.},
keywords={},
doi={10.1093/ietfec/e90-a.7.1406},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Intrinsic Randomness Problem in the Framework of Slepian-Wolf Separate Coding System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1406
EP - 1417
AU - Yasutada OOHAMA
PY - 2007
DO - 10.1093/ietfec/e90-a.7.1406
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2007
AB - 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 nR1, nR2 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 nR3 from two received random messages. The admissible rate region is defined by the set of all the triples (R1,R2,R3) 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.
ER -
English
