2000 character limit reached
Reverse Berlekamp-Massey Decoding
Published 30 Jan 2013 in cs.IT and math.IT | (1301.7236v2)
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)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.