{"title":"三节点点对点中继网络的实用网络编码","authors":"S. Fong, M. Fan, R. Yeung","doi":"10.1109/ISIT.2011.6033917","DOIUrl":null,"url":null,"abstract":"We study the three-node point-to-point relay network which consists of two terminal nodes and one relay node between them and investigate practical network coding schemes for the network. The rate region achievable by the practical network coding schemes is obtained, and a procedure for constructing the linear network codes that achieve the rate pairs in the achievable rate region is presented. In addition, we show that the use of network coding rather than routing alone enlarges the achievable rate region, in particular increases the maximum equal-rate throughput.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Practical network coding on three-node point-to-point relay networks\",\"authors\":\"S. Fong, M. Fan, R. Yeung\",\"doi\":\"10.1109/ISIT.2011.6033917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the three-node point-to-point relay network which consists of two terminal nodes and one relay node between them and investigate practical network coding schemes for the network. The rate region achievable by the practical network coding schemes is obtained, and a procedure for constructing the linear network codes that achieve the rate pairs in the achievable rate region is presented. In addition, we show that the use of network coding rather than routing alone enlarges the achievable rate region, in particular increases the maximum equal-rate throughput.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6033917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6033917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Practical network coding on three-node point-to-point relay networks
We study the three-node point-to-point relay network which consists of two terminal nodes and one relay node between them and investigate practical network coding schemes for the network. The rate region achievable by the practical network coding schemes is obtained, and a procedure for constructing the linear network codes that achieve the rate pairs in the achievable rate region is presented. In addition, we show that the use of network coding rather than routing alone enlarges the achievable rate region, in particular increases the maximum equal-rate throughput.