Name
Abstract | ||
|---|---|---|
We compare the key equation solving algorithm introduced by Fitzpatrick to the Berlekamp-Massey algorithm. Our main result
is that the two algorithms have the same computational complexity. It follows that in practice Fitzpatricks algorithm improves
on Berlekamp-Massey since it uses less storage and has a simpler control structure. We also give an improved version of Fitzpatricks
algorithm and a new simplified proof of the central inductive step in the argument. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/s002000050103 | Appl. Algebra Eng. Commun. Comput. |
Keywords | Field | DocType |
Key wordsDecoding alternant codes,Berlekamp-Massey algorithm,Key equation. | Equation solving,Combinatorics,Berlekamp–Welch algorithm,Berlekamp's algorithm,Algorithm,Decoding methods,Berlekamp–Massey algorithm,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
9 | 3 | 0938-1279 |
Citations | PageRank | References |
8 | 0.91 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| patrick fitzpatrick | 1 | 81 | 7.18 |
| Sylvia M. Jennings | 2 | 10 | 1.95 |
| london england | 3 | 8 | 0.91 |