{"title":"多用户信息论中的一个标准凸性论证","authors":"Raymond W. Yeung","doi":"10.1109/ISIT.1994.394911","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On a standard convexity argument in multi-user information theory\",\"authors\":\"Raymond W. Yeung\",\"doi\":\"10.1109/ISIT.1994.394911\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1994.394911\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1994.394911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On a standard convexity argument in multi-user information theory
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.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
