Local search in coding theory

DOI10.1016/0012-365X(92)90524-JMaRDI QIDQ1199575zbMATH OpenFDO

Authors E. Aarts, Peter J. M. Van Laarhoven

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(92)90524-J

zbMATH Keywords

coveringlocal searchpackingsimulated annealing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

This paper gives a brief survey of simulated annealing and genetic local search algorithms applied to covering and packing problems in coding theory.

Cites work

• Evolution algorithms in combinatorial optimization
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• scientific article; zbMATH DE number 3916170 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3763833 (Why is no real title available?)
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Optimization by simulated annealing

Cited in

(7)

• \(K_{5}(7,3) \leqslant 100\).
• Coding for locality in reconstructing permutations
• Two new optimal ternary two-weight codes and strongly regular graphs
• Metaheuristics: A bibliography
• Local asymptotic coding and the minimum description length
• The communication complexity of local search
• Local languages and the Berry-Sethi algorithm

This page was built for publication: Local search in coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199575)