{"title":"多用户网络中容量区域的性质","authors":"J. Thomas","doi":"10.1109/ISIT.1998.708814","DOIUrl":null,"url":null,"abstract":"Motivated by work by Yeung (1994) on the convexity of capacity regions for a multi-user channel, we formulate the general properties of the capacity region for any network of users. In particular, in addition to the usual properties of dominance and convexity, we also consider the bit masking property that a message could be sent to a larger number of receivers than necessary. We derive a general inner bound on the capacity region of a multiuser network without feedback using these properties.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"489 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the properties of capacity regions in multi-user networks\",\"authors\":\"J. Thomas\",\"doi\":\"10.1109/ISIT.1998.708814\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by work by Yeung (1994) on the convexity of capacity regions for a multi-user channel, we formulate the general properties of the capacity region for any network of users. In particular, in addition to the usual properties of dominance and convexity, we also consider the bit masking property that a message could be sent to a larger number of receivers than necessary. We derive a general inner bound on the capacity region of a multiuser network without feedback using these properties.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"489 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708814\",\"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. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708814","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the properties of capacity regions in multi-user networks
Motivated by work by Yeung (1994) on the convexity of capacity regions for a multi-user channel, we formulate the general properties of the capacity region for any network of users. In particular, in addition to the usual properties of dominance and convexity, we also consider the bit masking property that a message could be sent to a larger number of receivers than necessary. We derive a general inner bound on the capacity region of a multiuser network without feedback using these properties.