Strong converse for Gel'fand-Pinsker channel

Authors:
Pierre Moulin
Affiliations:
Beckman Inst., Coord. Sci. Lab and ECE Department, University of Illinois at Urbana-Champaign
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 2
Cited 0

Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Channel Coding in the Presence of Side Information

Foundations and Trends in Communications and Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A strong converse for the Gel'fand-Pinsker channel is established in this paper. The method is then extended to a multiuser scenario. A strong converse is established for the multiple-access Gel'fand-Pinsker channel under the maximum error criterion, and the capacity region is determined.