Lexicographic codes: Error-correcting codes from game theory
IEEE Transactions on Information Theory
A simple heuristic based genetic algorithm for the maximum clique problem
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique
Journal of Heuristics
Lamarckian Evolution, The Baldwin Effect and Function Optimization
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Using genetic programming to approximate maximum clique
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Clique detection via genetic programming
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
A comparison of evolutionary algorithms for finding optimal error-correcting codes
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Ring optimization of edit metric codes in DNA
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Hi-index | 0.00 |
Error-correcting codes allow for reliable transmission of data over mediums subject to interference. They guarantee detection and recovery from a level of transmission corruption. Larger error-correcting codes increase the maximum sizes of messages transmittable, which improves communication efficiency. However, discovering optimal error-correcting codes for different code specifications is equivalent to the NP-Hard problem of determining maximum cliques of a graph. In this research, three different binary error correcting code problems are considered. Both genetic algorithms and genetic programming are examined for generating optimal error correcting codes for these problems. A new chromosome representation of the GA system is examined, which shows some benefits in certain conditions. The use of GP is novel in this problem domain, and in combination with the Baldwin effect, it is shown to be a promising new approach for code discovery.