English

Reverse Berlekamp-Massey Decoding

Information Theory 2013-05-20 v2 math.IT

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).

Keywords

Cite

@article{arxiv.1301.7236,
  title  = {Reverse Berlekamp-Massey Decoding},
  author = {Jiun-Hung Yu and Hans-Andrea Loeliger},
  journal= {arXiv preprint arXiv:1301.7236},
  year   = {2013}
}

Comments

Updated version

R2 v1 2026-06-21T23:17:48.913Z