{"title":"多单播网络编码方法","authors":"N. Ratnakar, D. Traskov, Ralf Koetter","doi":"10.1109/IZS.2006.1649081","DOIUrl":null,"url":null,"abstract":"In this paper, we survey the application of linear network coding to a multiple unicasts scenario in directed graphs. We discuss related work concerning the complexity of the construction of capacity-achieving linear network codes. We briefly review the algebraic formulation of the problem and in the remainder of the paper, we investigate two approaches to construct network codes. One is based on state-space realizations and the other is a suboptimal, yet simpler approach based on linear optimization","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Approaches to Network Coding for Multiple Unicasts\",\"authors\":\"N. Ratnakar, D. Traskov, Ralf Koetter\",\"doi\":\"10.1109/IZS.2006.1649081\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we survey the application of linear network coding to a multiple unicasts scenario in directed graphs. We discuss related work concerning the complexity of the construction of capacity-achieving linear network codes. We briefly review the algebraic formulation of the problem and in the remainder of the paper, we investigate two approaches to construct network codes. One is based on state-space realizations and the other is a suboptimal, yet simpler approach based on linear optimization\",\"PeriodicalId\":405389,\"journal\":{\"name\":\"2006 International Zurich Seminar on Communications\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Zurich Seminar on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IZS.2006.1649081\",\"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 International Zurich Seminar on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IZS.2006.1649081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approaches to Network Coding for Multiple Unicasts
In this paper, we survey the application of linear network coding to a multiple unicasts scenario in directed graphs. We discuss related work concerning the complexity of the construction of capacity-achieving linear network codes. We briefly review the algebraic formulation of the problem and in the remainder of the paper, we investigate two approaches to construct network codes. One is based on state-space realizations and the other is a suboptimal, yet simpler approach based on linear optimization
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
