Comparison of Two Algorithms for Decoding Alternant Codes.
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...
| 发表在: | Applicable algebra in engineering, communication and computing. 9, 3 (1998). |
|---|---|
| 主要作者: | |
| 其他作者: | |
| 格式: | 文件 |
| 语言: | 英语 |
| 主题: |