用等效矩阵去除短长度LT分组编码弱点的改进

S. Hosseini, M. Akbari, A. Falahati
{"title":"用等效矩阵去除短长度LT分组编码弱点的改进","authors":"S. Hosseini, M. Akbari, A. Falahati","doi":"10.1109/ISTEL.2010.5734052","DOIUrl":null,"url":null,"abstract":"It is known that the Luby Transform codes provide an efficient scheme to transfer information over erasure channels. These codes are also rate-less and robust against packet losses in a jamming environment. In this paper overcome many weaknesses that this coding technique apprehends. Three weaknesses are observed in three different categories when the equivalent matrix is employed. In fact, such codes have these similar weaknesses due to their randomized nature. When this code. Also, the occurrence probability concerning two of them weaknesses categories which can be briefly described as all zero columns and the same digits in many rows are obtained analytically. Identifying these weaknesses, an efficient encoding algorithm is proposed which can improve the successful decoding probability for short length LT block codes. Simulation results justify the effectiveness of the proposed algorithm.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Modification of short length LT block coding technique by removing LT weaknesses with an equivalent matrix\",\"authors\":\"S. Hosseini, M. Akbari, A. Falahati\",\"doi\":\"10.1109/ISTEL.2010.5734052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is known that the Luby Transform codes provide an efficient scheme to transfer information over erasure channels. These codes are also rate-less and robust against packet losses in a jamming environment. In this paper overcome many weaknesses that this coding technique apprehends. Three weaknesses are observed in three different categories when the equivalent matrix is employed. In fact, such codes have these similar weaknesses due to their randomized nature. When this code. Also, the occurrence probability concerning two of them weaknesses categories which can be briefly described as all zero columns and the same digits in many rows are obtained analytically. Identifying these weaknesses, an efficient encoding algorithm is proposed which can improve the successful decoding probability for short length LT block codes. Simulation results justify the effectiveness of the proposed algorithm.\",\"PeriodicalId\":306663,\"journal\":{\"name\":\"2010 5th International Symposium on Telecommunications\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 5th International Symposium on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTEL.2010.5734052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2010.5734052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

众所周知,Luby变换代码提供了一种有效的方案来通过擦除信道传输信息。这些代码在干扰环境中也具有低速率和抗数据包丢失的鲁棒性。本文克服了这种编码技术的许多弱点。当采用等效矩阵时,在三个不同的类别中观察到三个弱点。事实上,由于它们的随机性,这些代码也有类似的弱点。当这个代码。并对其中两种弱点类别(即列均为零和多行相同数字)的发生概率进行了分析。针对这些缺点,提出了一种有效的编码算法,提高了短长度LT分组码的译码成功率。仿真结果验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Modification of short length LT block coding technique by removing LT weaknesses with an equivalent matrix
It is known that the Luby Transform codes provide an efficient scheme to transfer information over erasure channels. These codes are also rate-less and robust against packet losses in a jamming environment. In this paper overcome many weaknesses that this coding technique apprehends. Three weaknesses are observed in three different categories when the equivalent matrix is employed. In fact, such codes have these similar weaknesses due to their randomized nature. When this code. Also, the occurrence probability concerning two of them weaknesses categories which can be briefly described as all zero columns and the same digits in many rows are obtained analytically. Identifying these weaknesses, an efficient encoding algorithm is proposed which can improve the successful decoding probability for short length LT block codes. Simulation results justify the effectiveness of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信