.png){kind=icon}
返回
A simplified step-by-step decoding algorithm for parallel decoding of Reed-Solomon codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2007.898703.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A simplified parallel step-by-step decoding algorithm is proposed for decoding Reed-Solomon (RS) codes. It uses new method to calculate the determinants of the temporarily changed syndrome matrices, based on the property of these matrices determined in this paper. By using the proposed method, the calculations of the determinants of the temporarily changed syndrome matrices become much simpler and thus the computational complexity of the step-by-step decoding algorithm is significantly reduced.
Keyword:
CHAUDHURI-HOCQUENGHEM CODES
BINARY BCH CODES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容