Paper Info
Title
Solving the error correcting code problem with parallel hybrid heuristics
Abstract
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat "corrected" by the receiver. In these cases an error correcting code is suitable. The problem of finding an error correcting code of n bits and M codewords that corrects a given maximum number of errors is NP-hard. For this reason the problem has been solved in the literature with heuristic techniques such as Simulated Annealing and Genetic Algorithms. In this paper we present a new local search algorithm for the problem: the Repulsion Algorithm. We further use a hybrid between Parallel Genetic Algorithm and this new algorithm to solve the problem, and we compare it against a pure Parallel Genetic Algorithm. The results show that an important improvement is achieved with the inclusion of the Repulsion Algorithm and the parallelism.
Year
DOI
Venue
2004
10.1145/967900.968101
SAC
Keywords
Field
DocType
parallel hybrid heuristics,genetic algorithms,heuristic technique,code problem,simulated annealing,new algorithm,new local search algorithm,repulsion algorithm,pure parallel genetic algorithm,parallel genetic algorithm,corrupted message,m codewords,heuristics,information theory,local search algorithm,local search,genetic algorithm,error correction code
Ramer–Douglas–Peucker algorithm,Search algorithm,Parallel algorithm,Computer science,Algorithm,Error detection and correction,FSA-Red Algorithm,Local search (optimization),Population-based incremental learning,Difference-map algorithm
Conference
ISBN
Citations 
PageRank 
1-58113-812-1
6
0.57
References 
Authors
6
2
Name
Order
Citations
PageRank
Enrique Alba13796242.34
J. Francisco Chicano21329.27