An algorithm for the k-error linear complexity of binary sequences with period 2n.
Mark StampClyde F. MartinPublished in: IEEE Trans. Inf. Theory (1993)
Keyphrases
- learning algorithm
- times faster
- detection algorithm
- experimental evaluation
- improved algorithm
- preprocessing
- np hard
- optimal solution
- selection algorithm
- computational complexity
- segmentation algorithm
- high accuracy
- matching algorithm
- particle swarm optimization
- probabilistic model
- dynamic programming
- hidden markov models
- neural network
- simulated annealing
- computationally efficient
- theoretical analysis
- clustering method
- cost function
- k means
- recognition algorithm
- video sequences
- similarity measure
- long sequences