系统喷泉码的度分布设计

2013 19th IEEE International Conference on Networks (ICON) Pub Date : 2013-12-01 DOI:10.1109/ICON.2013.6781999

Liang Chen, L. Meng, Zhijiang Xu, Jiangxing Zhang, Wei Jiang

{"title":"系统喷泉码的度分布设计","authors":"Liang Chen, L. Meng, Zhijiang Xu, Jiangxing Zhang, Wei Jiang","doi":"10.1109/ICON.2013.6781999","DOIUrl":null,"url":null,"abstract":"This paper proposes a new degree distribution for systematic fountain codes by analyzing the property of systematic code. The erasure probabilities are also taken into consideration during the design. The simulation shows that the new distribution needs less encoding packets to recover all the source packets, has rapid constringency speed, and its performance is not very sensitive to the erasure probabilities.","PeriodicalId":219583,"journal":{"name":"2013 19th IEEE International Conference on Networks (ICON)","volume":"166 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A design of degree distribution for systematic fountain codes\",\"authors\":\"Liang Chen, L. Meng, Zhijiang Xu, Jiangxing Zhang, Wei Jiang\",\"doi\":\"10.1109/ICON.2013.6781999\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new degree distribution for systematic fountain codes by analyzing the property of systematic code. The erasure probabilities are also taken into consideration during the design. The simulation shows that the new distribution needs less encoding packets to recover all the source packets, has rapid constringency speed, and its performance is not very sensitive to the erasure probabilities.\",\"PeriodicalId\":219583,\"journal\":{\"name\":\"2013 19th IEEE International Conference on Networks (ICON)\",\"volume\":\"166 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 19th IEEE International Conference on Networks (ICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2013.6781999\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 19th IEEE International Conference on Networks (ICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2013.6781999","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

本文通过分析系统代码的性质，提出了一种新的系统喷泉代码度分布。在设计时也考虑了擦除概率。仿真结果表明，该算法对所有源数据包的恢复需要较少的编码数据包，具有较快的收敛速度，且性能对擦除概率不太敏感。

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

查看原文本刊更多论文

A design of degree distribution for systematic fountain codes

This paper proposes a new degree distribution for systematic fountain codes by analyzing the property of systematic code. The erasure probabilities are also taken into consideration during the design. The simulation shows that the new distribution needs less encoding packets to recover all the source packets, has rapid constringency speed, and its performance is not very sensitive to the erasure probabilities.

求助全文

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

来源期刊

2013 19th IEEE International Conference on Networks (ICON)

自引率

0.00%

发文量