.png){kind=icon}
返回
Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2024.3358055.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Reed-Solomon (RS) codes are widely used to correcter rors and erasures. This letter proposes a fast error and erasurede coding algorithm for RS codes. It achieves the best-known complexity O(nlog(n-k)+(n-k) log(2)(n-k)), wheren, kare the code length and dimension, respectively. Furthermore, the proposed method is efficient for practical codes. For decoding RS(255,223), compared with the existing method, the newalgorith m saves32%field operations
Keyword:
Reed-Solomon codes
Fast Fourier transforms
decoding algorithm
fast Fourier transform
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Efficient Syndrome Calculation via the Inverse Cyclotomic Discrete Fourier Transform通过反环离散傅立叶变换进行有效的综合症计算
OAAI
.png){kind=icon}
OAAI分享收藏Fast transform for decoding both errors and erasures of Reed-Solomon codes over GF(2m) for 8≤m≤10
PREAI
分享收藏
没有更多内容
没有更多内容