The Gelfand-Pinsker channel: strong converse and upper bound for the reliability function

Authors:
Himanshu Tyagi;Prakash Narayan
Affiliations:
Dept. of Electrical and Computer Engineering, and Institute for Systems Research, University of Maryland, College Park, MD;Dept. of Electrical and Computer Engineering, and Institute for Systems Research, University of Maryland, College Park, MD
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 2
Cited 1

Coding Theorems of Information Theory

Coding Theorems of Information Theory
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems

Capacity region of a state dependent degraded broadcast channel with noncausal transmitter CSI

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new technical lemma which provides an upper bound for the rate of codes with codewords that are conditionally typical over large message dependent subsets of a typical set of state sequences. This technical result is a nonstraightforward analog of a known result for a DMC without states that provides an upper bound on the rate of a good code with codewords of a fixed type (to be found in, for instance, the Csiszár-Körner book).