Reverse Berlekamp-Massey Decoding
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).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.