Second-Order Coding Rates for Channels With State
From MaRDI portal
Publication:2986193
DOI10.1109/TIT.2014.2324555zbMATH Open1360.94218DBLPjournals/tit/TomamichelT14arXiv1305.6789OpenAlexW3103394423WikidataQ60026395 ScholiaQ60026395MaRDI QIDQ2986193FDOQ2986193
Authors: Marco Tomamichel, Vincent Y. F. Tan 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the strong converse property for such channels when the sequence of channel states is not necessarily stationary, memoryless or ergodic. We then seek a finer characterization of these capacities in terms of second-order coding rates. The general results are supplemented by several examples including i.i.d. and Markov states and mixed channels.
Full work available at URL: https://arxiv.org/abs/1305.6789
Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)
Cited In (2)
This page was built for publication: Second-Order Coding Rates for Channels With State
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986193)
