{"title":"实现精细单例界的线性网络码的构造","authors":"Shenghao Yang, C. Ngai, R. Yeung","doi":"10.1109/ISIT.2007.4557139","DOIUrl":null,"url":null,"abstract":"In this paper, we present a refined version of the Singleton bound for network error correction, and propose an algorithm for constructing network codes that achieve this bound.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Construction of Linear Network Codes that Achieve a Refined Singleton Bound\",\"authors\":\"Shenghao Yang, C. Ngai, R. Yeung\",\"doi\":\"10.1109/ISIT.2007.4557139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a refined version of the Singleton bound for network error correction, and propose an algorithm for constructing network codes that achieve this bound.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Construction of Linear Network Codes that Achieve a Refined Singleton Bound
In this paper, we present a refined version of the Singleton bound for network error correction, and propose an algorithm for constructing network codes that achieve this bound.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
