An efficient algorithm for constructing minimal trellises for codes over finite abelian groups.
Vijay V. VaziraniHuzur SaranB. Sundar RajanPublished in: IEEE Trans. Inf. Theory (1996)
Keyphrases
- experimental evaluation
- dynamic programming
- computationally efficient
- detection algorithm
- learning algorithm
- theoretical analysis
- memory efficient
- estimation algorithm
- selection algorithm
- matching algorithm
- computational complexity
- computational cost
- image compression
- single pass
- highly efficient
- times faster
- cost function
- ant colony optimization
- np hard
- optimization algorithm
- np complete
- particle swarm optimization
- classification algorithm
- high accuracy
- recognition algorithm
- significant improvement
- improved algorithm
- error correction
- simulated annealing
- optimal solution