{"title":"线性网络码的统一框架","authors":"Min Tan, R. Yeung, S. Ho","doi":"10.1109/NETCOD.2008.4476192","DOIUrl":null,"url":null,"abstract":"In this paper we prove the equivalence of several definitions of generic network code. Based on these results we present a unified framework for linear network codes. This unified framework enables us to show that generic network code is the best possible in terms of linear independence. It also enables the simplification of the proofs of several existing results.","PeriodicalId":186056,"journal":{"name":"2008 Fourth Workshop on Network Coding, Theory and Applications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A Unified Framework For Linear Network Codes\",\"authors\":\"Min Tan, R. Yeung, S. Ho\",\"doi\":\"10.1109/NETCOD.2008.4476192\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we prove the equivalence of several definitions of generic network code. Based on these results we present a unified framework for linear network codes. This unified framework enables us to show that generic network code is the best possible in terms of linear independence. It also enables the simplification of the proofs of several existing results.\",\"PeriodicalId\":186056,\"journal\":{\"name\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fourth Workshop on Network Coding, Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETCOD.2008.4476192\",\"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 Fourth Workshop on Network Coding, Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2008.4476192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we prove the equivalence of several definitions of generic network code. Based on these results we present a unified framework for linear network codes. This unified framework enables us to show that generic network code is the best possible in terms of linear independence. It also enables the simplification of the proofs of several existing results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
