Genetic algorithms in coding theory -- a table for A_ 3(n, d)
From MaRDI portal
(Redirected from Publication:686527)
Genetic algorithms in coding theory -- a table for \(A 3(n, d)\)
Genetic algorithms in coding theory -- a table for \(A 3(n, d)\)
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.
Recommendations
- Minimum distance computation of linear codes via genetic algorithms with permutation encoding
- scientific article; zbMATH DE number 4108180
- Construction of genetic algorithms and techniques of chromosome coding
- scientific article; zbMATH DE number 721896
- Reduced complexity iterative decoding of 3D-product block codes based on genetic algorithms
Cites work
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Error detecting and error correcting codes
- Evolution algorithms in combinatorial optimization
- Generalized Reed - Solomon codes from algebraic geometry
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 4068781 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3485627 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3442081 (Why is no real title available?)
- Maximum distance<tex>q</tex>-nary codes
- New 5-designs
- New upper bounds for the football pool problem for 6, 7, and 8 matches
- Repeated-root cyclic codes
- Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
- Symmetry codes over GF(3) and new five-designs
- The packing problem for projective geometries over GF(3) with dimension greater than five
Cited in
(18)- Local search in coding theory
- Optimal constant weight codes over \(Z_k\) and generalized designs
- \(K_{5}(7,3) \leqslant 100\).
- Construction of genetic algorithms and techniques of chromosome coding
- Slight improvements of the Singleton bound
- A genetic algorithm approach to periodic railway synchronization
- Metaheuristics: A bibliography
- New lower bounds on \(q\)-ary error-correcting codes
- Match fitness landscapes for macromolecular interaction networks: selection for translational accuracy and rate can displace tRNA-binding interfaces of non-cognate aminoacyl-tRNA synthetases
- On Rosenbloom and Tsfasman's generalization of the Hamming space
- New upper bounds on Lee codes
- scientific article; zbMATH DE number 1703854 (Why is no real title available?)
- Fundamentals of coding type problems
- A connection between coding theory and polarized partition relations
- A novel genetic search scheme based on nature-inspired evolutionary algorithms for binary self-dual codes
- The k-distance independence number and 2-distance chromatic number of Cartesian products of cycles
- Jack van Lint (1932--2004): a survey of his scientific work
- Construction of optimal ternary constant weight codes via Bhaskar Rao designs
This page was built for publication: Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686527)
