The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain.
Patrick FitzpatrickGraham H. NortonPublished in: Appl. Algebra Eng. Commun. Comput. (1995)
Keyphrases
- dynamic programming
- objective function
- preprocessing
- worst case
- optimal solution
- computational complexity
- linear complexity
- times faster
- detection algorithm
- computational cost
- theoretical analysis
- long sequences
- improved algorithm
- matching algorithm
- high accuracy
- experimental evaluation
- simulated annealing
- computationally efficient
- principal component analysis
- optimization algorithm
- shortest path
- clustering method
- np hard
- hidden markov models
- recognition algorithm
- concept drift
- significant improvement
- k means
- lower bound