Reverse Berlekamp-Massey Decoding
classification
💻 cs.IT
math.IT
keywords
algorithmberlekamp-masseydecodingcodescomputingdistancegeneralhalf
read the original abstract
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)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.