{"title":"无线网络代码设计的分层方法","authors":"M. Effros, T. Ho, Sukwon Kim","doi":"10.1109/ITW.2006.1633782","DOIUrl":null,"url":null,"abstract":"We describe a new tiling approach for network code design. The proposed method applies dynamic programming to find the best strategy among a restricted collection of network codes. We demonstrate the proposed strategy as a method for efficiently accommodating multiple unicasts in a wireless coding environment on a triangular lattice and discuss its generalization.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"72","resultStr":"{\"title\":\"A Tiling Approach to Network Code Design for Wireless Networks\",\"authors\":\"M. Effros, T. Ho, Sukwon Kim\",\"doi\":\"10.1109/ITW.2006.1633782\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe a new tiling approach for network code design. The proposed method applies dynamic programming to find the best strategy among a restricted collection of network codes. We demonstrate the proposed strategy as a method for efficiently accommodating multiple unicasts in a wireless coding environment on a triangular lattice and discuss its generalization.\",\"PeriodicalId\":293144,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"72\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2006.1633782\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Tiling Approach to Network Code Design for Wireless Networks
We describe a new tiling approach for network code design. The proposed method applies dynamic programming to find the best strategy among a restricted collection of network codes. We demonstrate the proposed strategy as a method for efficiently accommodating multiple unicasts in a wireless coding environment on a triangular lattice and discuss its generalization.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
