{"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}
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.