On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding

DOI10.1109/TIT.2015.2449844zbMATH Open1359.94444arXiv1309.6200OpenAlexW1955169834MaRDI QIDQ2977259FDOQ2977259

Authors: Jonathan Scarlett 

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper studies second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a small fraction of the block to transmit the type of the state sequence. For error probabilities less than 1/2, it is shown that the second-order rate improves on an existing one based on i.i.d. random coding. In the Gaussian case (dirty paper coding) with an almost-sure power constraint, an achievability result is obtained used using random coding over the surface of a sphere, and using a small fraction of the block to transmit a quantized description of the state power. It is shown that the second-order asymptotics are identical to the single-user Gaussian channel of the same input power without a state.

Full work available at URL: https://arxiv.org/abs/1309.6200

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Cited In (4)

• The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels
• Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing
• On the Capacity of the Carbon Copy onto Dirty Paper Channel
• A Novel Double-Time-Scale Evaluation Method for Ethernet Performability

This page was built for publication: On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977259)