{"title":"线性色散与一般网络码的关系","authors":"Pui-Wing Kwok, Raymond W. Yeung","doi":"10.1109/ITW2.2006.323832","DOIUrl":null,"url":null,"abstract":"Four classes of linear network codes have been introduced in the recent work of Yeung et al., namely linear multicast, linear broadcast, linear dispersion and generic linear network code, where each of these four classes of codes is strictly stronger than the preceding one. In this paper, we establish a nontrivial relation between linear dispersion and generic linear network code","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On the Relation between Linear Dispersion and Generic Network Code\",\"authors\":\"Pui-Wing Kwok, Raymond W. Yeung\",\"doi\":\"10.1109/ITW2.2006.323832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Four classes of linear network codes have been introduced in the recent work of Yeung et al., namely linear multicast, linear broadcast, linear dispersion and generic linear network code, where each of these four classes of codes is strictly stronger than the preceding one. In this paper, we establish a nontrivial relation between linear dispersion and generic linear network code\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW2.2006.323832\",\"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 Chengdu","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW2.2006.323832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Relation between Linear Dispersion and Generic Network Code
Four classes of linear network codes have been introduced in the recent work of Yeung et al., namely linear multicast, linear broadcast, linear dispersion and generic linear network code, where each of these four classes of codes is strictly stronger than the preceding one. In this paper, we establish a nontrivial relation between linear dispersion and generic linear network code