An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$
Jianqin ZhouWei XiongPublished in: CoRR (2011)
Keyphrases
- np hard
- experimental evaluation
- learning algorithm
- cost function
- estimation algorithm
- preprocessing
- computationally efficient
- dynamic programming
- computational cost
- clustering method
- detection algorithm
- optimization algorithm
- expectation maximization
- probabilistic model
- k means
- computational complexity
- optimal solution
- neural network
- sequence alignment
- arbitrary length
- selection algorithm
- matching algorithm
- tree structure
- ant colony optimization
- segmentation algorithm
- theoretical analysis
- input data
- simulated annealing
- objective function