Local search in coding theory

E.H.L. Aarts, P.J.M. Laarhoven, van

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)11-18
Number of pages8
JournalDiscrete Mathematics
Issue number1
Publication statusPublished - 1992


Dive into the research topics of 'Local search in coding theory'. Together they form a unique fingerprint.

Cite this