{"title":"无存储器多址信道中的多速率可达性","authors":"R. Cheng","doi":"10.1109/ISIT.1994.394912","DOIUrl":null,"url":null,"abstract":"The capacity region of a discrete memoryless multiaccess channel (MAC) is defined as the set of all achievable rate tuples, and a rate tuple is achievable if there exists coders and decoder with those rates and average error probability approaching zero asymptotically in the codeword length. Notice that this definition allows different rate tuples to be achieved by different coders-decoder pairs. A theorem giving the necessary and sufficient condition for a vector rate tuple to be multirate achievable is included.<<ETX>>","PeriodicalId":331390,"journal":{"name":"Proceedings of 1994 IEEE International Symposium on Information Theory","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multirate achievability in memoryless multiaccess channel\",\"authors\":\"R. Cheng\",\"doi\":\"10.1109/ISIT.1994.394912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The capacity region of a discrete memoryless multiaccess channel (MAC) is defined as the set of all achievable rate tuples, and a rate tuple is achievable if there exists coders and decoder with those rates and average error probability approaching zero asymptotically in the codeword length. Notice that this definition allows different rate tuples to be achieved by different coders-decoder pairs. A theorem giving the necessary and sufficient condition for a vector rate tuple to be multirate achievable is included.<<ETX>>\",\"PeriodicalId\":331390,\"journal\":{\"name\":\"Proceedings of 1994 IEEE International Symposium on Information Theory\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"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.394912\",\"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.394912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multirate achievability in memoryless multiaccess channel
The capacity region of a discrete memoryless multiaccess channel (MAC) is defined as the set of all achievable rate tuples, and a rate tuple is achievable if there exists coders and decoder with those rates and average error probability approaching zero asymptotically in the codeword length. Notice that this definition allows different rate tuples to be achieved by different coders-decoder pairs. A theorem giving the necessary and sufficient condition for a vector rate tuple to be multirate achievable is included.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
