Revision as of 14:00, 29 June 2018 edit JCW-CleanerBot (talk \| contribs) Bots 136,797 edits m task, replaced: IEEE Trans. Information Theory → IEEE Trans. Inf. Theory using AWB ← Previous edit		Revision as of 01:55, 14 August 2018 edit undo Eric Rowland (talk \| contribs) Extended confirmed users 805 edits →Description of algorithm: update link Next edit →
Line 41: ==Description of algorithm== The Berlekamp–Massey algorithm is an ~~alternate method~~alternative to ~~solve~~ the ~~set of linear equations described in~~ [[Reed–Solomon error correction#~~Peterson~~Peterson–Gorenstein–Zierler decoder\|Reed–Solomon Peterson decoder]], ~~which~~for solving the set of linear equations. It can be summarized as: :<math> S_{i + \nu} + \Lambda_1 S_{i+\nu-1} + \cdots + \Lambda_{\nu-1} S_{i+1} + \Lambda_{\nu} S_i = 0. </math>

Berlekamp–Massey algorithm: Difference between revisions