A branch and cut algorithm for finding the minimum distance of a linear block code.
Ahmet B. KehaTolga M. DumanPublished in: ISIT (2008)
Keyphrases
- experimental evaluation
- cost function
- linear complexity
- computational complexity
- high accuracy
- significant improvement
- dynamic programming
- optimization algorithm
- times faster
- convergence rate
- preprocessing
- particle swarm optimization
- convex hull
- matching algorithm
- recognition algorithm
- theoretical analysis
- computationally efficient
- simulated annealing
- worst case
- probabilistic model
- k means
- optimal solution
- reinforcement learning
- expectation maximization
- learning algorithm
- clustering method
- least squares
- improved algorithm
- hardware implementation
- piecewise linear