优先编码传输的喷泉码方法

M. Nekoui, N. Ranjkesh, F. Lahouti
{"title":"优先编码传输的喷泉码方法","authors":"M. Nekoui, N. Ranjkesh, F. Lahouti","doi":"10.1109/ITW2.2006.323745","DOIUrl":null,"url":null,"abstract":"We introduce a new method of engaging Limited Randomness LT codes [5], a practical realization of the original LT codes by Luby [3] to transmit prioritized data-which is of great importance for multimedia applications-over lossy packet-based networks. We obtained increased number of decoded packets for higher priorities and also the total number of decoded packets-over all priorities-was augmented.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Fountain Code Approach towards Priority Encoding Transmission\",\"authors\":\"M. Nekoui, N. Ranjkesh, F. Lahouti\",\"doi\":\"10.1109/ITW2.2006.323745\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new method of engaging Limited Randomness LT codes [5], a practical realization of the original LT codes by Luby [3] to transmit prioritized data-which is of great importance for multimedia applications-over lossy packet-based networks. We obtained increased number of decoded packets for higher priorities and also the total number of decoded packets-over all priorities-was augmented.\",\"PeriodicalId\":299513,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Chengdu\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"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.323745\",\"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.323745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

我们引入了一种使用有限随机性LT码[5]的新方法,这是Luby[3]对原始LT码的实际实现,用于在基于有损分组的网络上传输优先级数据,这对多媒体应用非常重要。我们获得了更高优先级的解码数据包数量的增加,并且所有优先级的解码数据包总数也增加了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Fountain Code Approach towards Priority Encoding Transmission
We introduce a new method of engaging Limited Randomness LT codes [5], a practical realization of the original LT codes by Luby [3] to transmit prioritized data-which is of great importance for multimedia applications-over lossy packet-based networks. We obtained increased number of decoded packets for higher priorities and also the total number of decoded packets-over all priorities-was augmented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信