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)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)m(x).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.