Local search in coding theory

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

Research output: Contribution to journalArticleScientificpeer-review

12 Citations (Scopus)

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

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

Cite this