On a standard convexity argument in multi-user information theory
Refereed conference paper presented and published in conference proceedings

Full Text

Times Cited

Other information
AbstractWe 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.
All Author(s) ListYeung Raymond W.
Name of ConferenceProceedings of the 1994 IEEE International Symposium on Information Theory
Start Date of Conference27/06/1994
End Date of Conference01/07/1994
Place of ConferenceTrodheim, Norw
Country/Region of ConferenceNorway
LanguagesEnglish-United Kingdom

Last updated on 2021-26-11 at 23:06