{"title":"多址擦除网络的组播容量","authors":"K. Gowda, S. Sumei","doi":"10.1109/ISITA.2008.4895510","DOIUrl":null,"url":null,"abstract":"We derive the capacity of multicast transmissions on a class of erasure networks. The network model incorporates interference in the form of a finite-field additive multiple-access channel for the receiver on each node, but there is no broadcast constraint (any node can transmit independent symbols on each of its outgoing edges). Assuming knowledge of erasure locations at destination nodes, we derive the capacity for a network with multiple sources transmitting independent messages, and each destination node decoding all messages from all source nodes. This capacity is achievable using linear codes at each node.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multicast capacity of multiple access erasure networks\",\"authors\":\"K. Gowda, S. Sumei\",\"doi\":\"10.1109/ISITA.2008.4895510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We derive the capacity of multicast transmissions on a class of erasure networks. The network model incorporates interference in the form of a finite-field additive multiple-access channel for the receiver on each node, but there is no broadcast constraint (any node can transmit independent symbols on each of its outgoing edges). Assuming knowledge of erasure locations at destination nodes, we derive the capacity for a network with multiple sources transmitting independent messages, and each destination node decoding all messages from all source nodes. This capacity is achievable using linear codes at each node.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multicast capacity of multiple access erasure networks
We derive the capacity of multicast transmissions on a class of erasure networks. The network model incorporates interference in the form of a finite-field additive multiple-access channel for the receiver on each node, but there is no broadcast constraint (any node can transmit independent symbols on each of its outgoing edges). Assuming knowledge of erasure locations at destination nodes, we derive the capacity for a network with multiple sources transmitting independent messages, and each destination node decoding all messages from all source nodes. This capacity is achievable using linear codes at each node.