Reverse Berlekamp-Massey Decoding
Jiun-Hung Yu, Hans-Andrea Loeliger
TL;DR
This paper introduces a novel decoding algorithm for Reed-Solomon codes and polynomial inverses that generalizes the Berlekamp-Massey algorithm to work with arbitrary polynomials.
Contribution
The paper presents a new algorithm extending Berlekamp-Massey for decoding Reed-Solomon codes and polynomial inversion in a more general setting.
Findings
Efficient decoding of Reed-Solomon codes up to half the minimum distance
Generalization of Berlekamp-Massey algorithm to arbitrary polynomials
Applicable to polynomial inversion in quotient rings
Abstract
We propose a new algorithm for decoding Reed-Solomon codes (up to half the minimum distance) and for computing inverses in . The proposed algorithm is similar in spirit and structure to the Berlekamp-Massey algorithm, but it works naturally for general .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Residue Arithmetic · Cellular Automata and Applications