An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m.
Jianqin ZhouWei XiongPublished in: Int. J. Netw. Secur. (2013)
Keyphrases
- path planning
- mobile robot
- matching algorithm
- linear programming
- improved algorithm
- memory requirements
- convex hull
- detection algorithm
- optimization algorithm
- computationally efficient
- particle swarm optimization
- data structure
- high accuracy
- computational cost
- dynamic programming
- hidden markov models
- cost function
- evolutionary algorithm
- computational complexity
- search algorithm