The BM Algorithm and the BMS Algorithm
We present a brief overview of the Berlekamp-Massey (BM) algorithm and of the Berlekamp-Massey-Sakata (BMS) algorithm, with an emphasis on a close relationship between them, which can be summarized as follows: BM algorithm + Gröbner basis = BMS algorithm. Furthermore, we describe various forms of these algorithms, all of which are related to fast decoding of algebraic codes including algebraic-geometric (AG) codes. As a byproduct, we obtain a recursive BMS algorithm which is an extension of Blahut’s recursive BM algorithm. Throughout this paper, we recall the assertions of R.E. Blahut on the importance of fast decoding for good codes, particularly as described in his books, which have spurred recent developments of novel decoding algorithms of AG codes.
KeywordsTotal Order Polynomial Vector Linear Feedback Shift Register Linear Recurrence Algebraic Code
Unable to display preview. Download preview PDF.
- —, A vector version of the BMS algorithm for implementing fast erasure-and-error decoding of one-point AG codes, submitted to Appl. Algebra Engrg. Comm. Comput. Google Scholar
- S. Sakata and M. Kurihara, A systolic array architecture for implementing a fast parallel decoding algorithm of one-point AG codes, submitted to IEEE Trans. Inform. Theory. Google Scholar
- S. Sakata, D. Leonard, H. Elbrøn d Jensen, and T. Høholdt, Fast erasure-and-error decoding of AG codes up to the Feng-Rao bound, submitted to IEEE Trans. Inform. Theory. Google Scholar