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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: June 6, 1997
Rights and permissions
About this article
Cite this article
Fitzpatrick, P., Jennings, S. Comparison of Two Algorithms for Decoding Alternant Codes. AAECC 9, 211–220 (1998). https://doi.org/10.1007/s002000050103
Issue Date:
DOI: https://doi.org/10.1007/s002000050103