Title :
On a standard convexity argument in multi-user information theory
Author :
Yeung, Raymond W.
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong
fDate :
27 Jun-1 Jul 1994
Abstract :
We clarify a standard convexity argument often invoked in the proof of the converse of a coding theorem in multi-user information theory, and bring out an interesting problem regarding mixing similar polytopes
Keywords :
channel coding; encoding; multi-access systems; telecommunication channels; coding theorem; convex polytopes; convexity argument; discrete memoryless multiple access channel; multi-user information theory; Cellular neural networks; Codes; Entropy; Information theory;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394911
