Computer Science – Information Theory
Scientific paper
2012-04-02
Computer Science
Information Theory
12 pages, 1 figure; Extended version of paper submitted to Information Theory Workshop (ITW), 2012
Scientific paper
In this paper, we study the finite blocklength limits of state-dependent discrete memoryless channels where the discrete memoryless state is known noncausally at the encoder. For the point-to-point case, this is known as the Gel'fand-Pinsker channel model. We define the (n,\epsilon)-capacity of the Gel'fand-Pinsker channel as the maximal rate of transmission of a message subject to the condition that the length of the block-code is n and the average error probability is no larger than \epsilon. This paper provides a lower bound for the (n,\epsilon)-capacity of the Gel'fand-Pinsker channel model, and hence an upper bound on the dispersion, a fundamental second-order quantity in the study of the performance limits of discrete memoryless channels. In addition, we extend the work of Y. Steinberg (2005), in which the (degraded) broadcast channel extension of the Gel'fand-Pinsker model was studied. We provide and inner bound to the (n,\epsilon)-capacity region for this broadcast channel model using a combination of ideas of Gel'fand-Pinsker coding, superposition coding and dispersion (finite blocklength) analysis.
No associations
LandOfFree
On Dispersions of Discrete Memoryless Channels with Noncausal State Information at the Encoder does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Dispersions of Discrete Memoryless Channels with Noncausal State Information at the Encoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Dispersions of Discrete Memoryless Channels with Noncausal State Information at the Encoder will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-509859