Partial inverses mod m(x) and reverse berlekamp-massey decoding

Jiun-Hung Yu*, Hans Andrea Loeliger


研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)


This semi-tutorial paper introduces the partial-inverse problem for polynomials and develops its application to decoding Reed-Solomon codes and some related codes. The most natural algorithm to solve the partial-inverse problem is very similar to, but more general than, the Berlekamp-Massey algorithm. Two additional algorithms are obtained as easy variations of the basic algorithm: the first variation is entirely new, while the second variation may be viewed as a version of the Euclidean algorithm. Decoding Reed-Solomon codes (and some related codes) can be reduced to the partial-inverse problem, both via the standard key equation and, more naturally, via an alternative key equation with a new converse. Shortened and singly-extended Reed-Solomon codes are automatically included. Using the properties of the partial-inverse problem, two further key equations with attractive properties are obtained. The paper also points out a variety of options for interpolation.

頁(從 - 到)6737-6756
期刊IEEE Transactions on Information Theory
出版狀態Published - 1 12月 2016


深入研究「Partial inverses mod m(x) and reverse berlekamp-massey decoding」主題。共同形成了獨特的指紋。