{"title":"随机线性网络码的极限行为","authors":"Huseyin Balli, Zhen Zhang","doi":"10.1109/NETCOD.2009.5191385","DOIUrl":null,"url":null,"abstract":"The performance analysis of Random Linear Network Codes is important both theoretically and for its applications. In this paper, we derive improved upper bounds for the failure probability of random linear network codes and analyze the limiting behavior as the field size goes to infinity. Unlike the previously reported bounds, the new bound is shown to be tight as the field size |F| goes to infinity.","PeriodicalId":251096,"journal":{"name":"2009 Workshop on Network Coding, Theory, and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On the limiting behavior of Random Linear Network Codes\",\"authors\":\"Huseyin Balli, Zhen Zhang\",\"doi\":\"10.1109/NETCOD.2009.5191385\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance analysis of Random Linear Network Codes is important both theoretically and for its applications. In this paper, we derive improved upper bounds for the failure probability of random linear network codes and analyze the limiting behavior as the field size goes to infinity. Unlike the previously reported bounds, the new bound is shown to be tight as the field size |F| goes to infinity.\",\"PeriodicalId\":251096,\"journal\":{\"name\":\"2009 Workshop on Network Coding, Theory, and Applications\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"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.5191385\",\"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.5191385","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the limiting behavior of Random Linear Network Codes
The performance analysis of Random Linear Network Codes is important both theoretically and for its applications. In this paper, we derive improved upper bounds for the failure probability of random linear network codes and analyze the limiting behavior as the field size goes to infinity. Unlike the previously reported bounds, the new bound is shown to be tight as the field size |F| goes to infinity.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
