Minimal polynomial algorithms for finite sequences

Authors:
Graham H. Norton
Affiliations:
Department of Mathematics, University of Queensland, Brisbane, Qld., Australia
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 0

On the minimal realizations of a finite sequence

Journal of Symbolic Computation
On shortest linear recurrences

Journal of Symbolic Computation
On the Key Equation Over a Commutative Ring

Designs, Codes and Cryptography
Some Decoding Applications of Minimal Realization

Proceedings of the 5th IMA Conference on Cryptography and Coding
An algorithm for computing minimal bidirectional linear recurrence relations

IEEE Transactions on Information Theory
Modified Berlekamp-Massey algorithm for approximating the k-error linear complexity of binary sequences

Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding

Quantified Score

Hi-index	754.84

Visualization

Abstract

In this paper, we show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of an algorithm in a recent paper of A. Salagean.