Talk:Berlekamp–Massey algorithm

Computing Stub‑class

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Stub	This article has been rated as Stub-class on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

update history

The link points to error 404. 217.98.142.167 00:14, 22 May 2004 (UTC)[reply]

Yeah, I know. I've replaced it. 4pq1injbok 03:21, 20 September 2005 (UTC)[reply]

Berlekamp Massey algorithm - needs a description

Currently the article only includes two example code fragments with no explanation of why or how the algorithm works. If I get time, I'll add a reasonable explantion to the article. Rcgldr (talk) 03:13, 18 October 2011 (UTC)[reply]

Main article suggested change, Berlekamp Masey was not the key to practical applciation of Reed Solomon

The aricle includes this statement:

The algorithm became the key to practical application of the now ubiquitous Reed–Solomon code.

but the key to practical application was the recognition of the relationship between the error locator polynomial coefficients and syndromes that can be represented as a set of linear equations. There are multiple methods for solving this set of linear equation, and Berlekamp Massey is just one of them, so the statement should be changed or removed. The Reed Solomon article already explains the key set of linear equations in detail, so this statement should be removed.

Other algorithms for soloving the key set of linear equations:

Direct matrix inversion of the set of linear equations composed of error locatort coefficients and syndromes is the easiest to explain why it works. It's solved in the same manner as any set of linear equations.

The Euclidean algorithm is simpler to implement, and the algorithm itself is easier to understand than Berlekamp Massey, but it may be more difficult to explain why it works (I need to research this). Some people prefer the Euclidean over Berlekamp Massey. Rcgldr (talk) 01:28, 18 October 2011 (UTC)[reply]