Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (Q686527): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Emile H. L. Aarts / rank | |||
| Property / author | |||
| Property / author: J. H. van Lint / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: J. H. van Lint / rank | |||
Revision as of 21:47, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) |
scientific article |
Statements
Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) (English)
0 references
2 December 1993
0 references
In 1975 Holland introduced the concept of Genetic Algorithms (Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975; Zbl 0317.68006). The paper describes a genetic local search algorithm designed to find \((n,M,d)\)-codes with large \(M\). The main result is an improved table for \(A_ 3(n,d)\), i.e. the maximal size of a ternary code of length \(n\) and minimum distance \(d\). The lower bounds are based on the search algorithm and on some constructions.
0 references
maximal code size
0 references
genetic local search algorithm
0 references
ternary code
0 references
lower bounds
0 references
