An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
Jianqin ZhouXirong XuPublished in: CoRR (2005)
Keyphrases
- np hard
- optimization algorithm
- segmentation algorithm
- matching algorithm
- k means
- times faster
- dynamic programming
- experimental evaluation
- worst case
- detection algorithm
- path planning
- learning algorithm
- high accuracy
- convex hull
- convergence rate
- preprocessing
- recognition algorithm
- improved algorithm
- simulated annealing
- linear programming
- search space
- computational complexity
- cellular automata
- input data
- cost function
- multi objective
- objective function