Local search in coding theory

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

Research output: Contribution to journalArticleScientificpeer-review

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

Coding Theory
Local Search
Covering Problem
Packing Problem
Combinatorial optimization
Combinatorial argument
Combinatorial Optimization Problem
Coding
Local search (optimization)

Cite this

Aarts, E.H.L. ; Laarhoven van, P.J.M. / Local search in coding theory. In: Discrete Mathematics. 1992 ; Vol. 106/107, No. 1. pp. 11-18.
@article{96a9094ca7ef42d3b48c501a7846676a,
title = "Local search in coding theory",
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.",
author = "E.H.L. Aarts and {Laarhoven van}, P.J.M.",
year = "1992",
doi = "10.1016/0012-365X(92)90524-J",
language = "English",
volume = "106/107",
pages = "11--18",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

Local search in coding theory. / Aarts, E.H.L.; Laarhoven van, P.J.M.

In: Discrete Mathematics, Vol. 106/107, No. 1, 1992, p. 11-18.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Local search in coding theory

AU - Aarts, E.H.L.

AU - Laarhoven van, P.J.M.

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

U2 - 10.1016/0012-365X(92)90524-J

DO - 10.1016/0012-365X(92)90524-J

M3 - Article

VL - 106/107

SP - 11

EP - 18

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -