Reverse Berlekamp-Massey decoding

Information Theory Proceedings(2013)

引用 4|浏览7
暂无评分
摘要
We propose a new algorithm for decoding Reed-Solomon codes (up to half the minimum distance) and for computing inverses in F[x]/m(x). The proposed algorithm is similar in spirit and structure to the Berlekamp-Massey algorithm, but it works naturally for general m(x).
更多
查看译文
关键词
reed-solomon codes,inverse computation,reverse berlekamp-massey decoding,reed-solomon code,decoding,polynomials,reed solomon code,hamming weight
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要