{"title":"广播信道的自适应网络编码","authors":"P. Sadeghi, D. Traskov, R. Koetter","doi":"10.1109/NETCOD.2009.5191398","DOIUrl":null,"url":null,"abstract":"We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"118","resultStr":"{\"title\":\"Adaptive network coding for broadcast channels\",\"authors\":\"P. Sadeghi, D. Traskov, R. Koetter\",\"doi\":\"10.1109/NETCOD.2009.5191398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.\",\"PeriodicalId\":251096,\"journal\":{\"name\":\"2009 Workshop on Network Coding, Theory, and Applications\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"118\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Workshop on Network Coding, Theory, and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETCOD.2009.5191398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Workshop on Network Coding, Theory, and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2009.5191398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
