Abstract
In this paper, it is described one of the most important open problem in the area of the Error Correcting Codes: the search of optimal codes. It is explained why and how the Genetic Algorithm can be used for this problem. Some promising results of computations are presented.
The first author is now with the Université de Technologie de Belfort-Montbéliard, Rue du château - Sévenans F-90010 BELFORT Cedex
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
McWilliams, F.J., Sloane N.J.A, The Theory of Error-Correcting Codes, North Holland, 1983.
Goppa V.D., Algebraico-geometrical Codes, Math. USSR Izvesiya, 21, pp. 75–91, 1983.
EIDMA, Linear Code Bounds, http://www.win.tue.nl/math/dw/voorlincod.html.
Goldberg D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lacan, J., Chatonnay, P. (1999). Search of Optimal Error Correcting Codes with Genetic Algorithms. In: Reusch, B. (eds) Computational Intelligence. Fuzzy Days 1999. Lecture Notes in Computer Science, vol 1625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48774-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-48774-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66050-7
Online ISBN: 978-3-540-48774-6
eBook Packages: Springer Book Archive