.png){kind=icon}
返回
A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2004.838673.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A modification of the Blahut algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. An effective method is offered for the searching of unknown discrepancies needed for analytical continuation of the Berlekamp-Massey algorithm through two additional iterations. This reduces the search time by 2(q - 1)n/((n + t + 1)(n - t)) times, compared with the Blahut algorithm. An architecture of a searcher for unknown discrepancies is given. The coding gain of the proposed algorithm is shown for some practical codes.
Keyword:
Berlekamp-Massey (BM) decoding algorithm
Blahut decoding algorithm
decoding beyond half the minimum distance
decoding Reed-Solomon (RS) codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
.png){kind=icon}
