Elsevier

Discrete Mathematics

Volumes 106–107, 1 September 1992, Pages 11-18
Discrete Mathematics

Local search in coding theory

https://doi.org/10.1016/0012-365X(92)90524-JGet rights and content
Under an Elsevier user license
open archive

Abstract

We briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of deep combinatorial arguments. However, the required computation times can be quite large.

Cited by (0)