Talk:Berlekamp–Massey algorithm

Computing Start‑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
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's importance scale.

C0 term

The description of algorithm section has the C(x) polynomial defined with the C0 term always equal to 1. Is this true? Some test calculations don't seem to bear this out. Section 8.1 of the BBC whitepaper on reed solomon has a good example of this calculation. downloads.bbc.co.uk/rd/pubs/whp/whp-pdf-files/WHP031.pdf — Preceding unsigned comment added by 96.236.128.245 (talk) 04:28, 15 June 2014 (UTC)[reply]

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.

However, the key to practical application of Reed Solomon code was establishing a relationship between the coefficients of the error locator polynomial and the syndromes that result in a set of linear equations which can be solved through conventional methods, as described in Peterson_decoder. Berlekamp Massey and other methods like the Euclidean algorithm are just optimized methods used to solve the same set of linear equations.

I recommend simply deleting this statement, or just stating that Berlekamp Massey algorithm optimizes the process of solving the set of linear equations as decribed in Peterson_decoder.

Rcgldr (talk) 03:39, 18 October 2011 (UTC)[reply]