网络纠错的改进编码边界

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks Pub Date : 2007-07-01 DOI:10.1109/ITWITWN.2007.4318046

Shenghao Yang, R. Yeung

{"title":"网络纠错的改进编码边界","authors":"Shenghao Yang, R. Yeung","doi":"10.1109/ITWITWN.2007.4318046","DOIUrl":null,"url":null,"abstract":"With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network error correction are proved by the weight properties of network codes. This refined Singleton bound is also proved to be tight for linear message sets.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Refined Coding Bounds for Network Error Correction\",\"authors\":\"Shenghao Yang, R. Yeung\",\"doi\":\"10.1109/ITWITWN.2007.4318046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network error correction are proved by the weight properties of network codes. This refined Singleton bound is also proved to be tight for linear message sets.\",\"PeriodicalId\":257392,\"journal\":{\"name\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWITWN.2007.4318046\",\"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 Information Theory Workshop on Information Theory for Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWITWN.2007.4318046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 28

摘要

针对给定的一组定义线性网络码的局部编码核，利用网络码的权值性质，证明了用于网络纠错的Hamming界、Singleton界和Gilbert-Varshamov界的改进版本。这种改进的单例边界对于线性消息集也证明是紧的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Refined Coding Bounds for Network Error Correction

With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network error correction are proved by the weight properties of network codes. This refined Singleton bound is also proved to be tight for linear message sets.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks

自引率

0.00%

发文量