Solving the error correcting code problem with parallel hybrid heuristics

Authors:
Enrique Alba;J. Francisco Chicano
Affiliations:
Universidad de Málaga, Spain;Universidad de Málaga, Spain
Venue:
Proceedings of the 2004 ACM symposium on Applied computing
Year:
2004

Citing 6
Cited 6

Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm

IEEE Transactions on Parallel and Distributed Systems
A survey of parallel distributed genetic algorithms

Complexity
Handbook of Evolutionary Computation

Handbook of Evolutionary Computation
Biological Symbiosis as a Metaphor for Computational Hybridization

Proceedings of the 6th International Conference on Genetic Algorithms
Utilizing Dynastically Optimal Forma Recombination in Hybrid Genetic Algorithms

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A table of upper bounds for binary codes

IEEE Transactions on Information Theory

Metaheuristics for optimization problems in computer communications

Computer Communications
Iterated local search and constructive heuristics for error correcting code design

International Journal of Innovative Computing and Applications
Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents

IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
Parallelizations of the Error Correcting Code Problem

Large-Scale Scientific Computing
Accelerating floating-point fitness functions in evolutionary algorithms: a FPGA-CPU-GPU performance comparison

Genetic Programming and Evolvable Machines
High-Speed Reconfigurable Parallel System to Design Good Error Correcting Codes in Communications

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

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.