Local search in coding theory
β Scribed by Emile H.L. Aarts; Peter J.M. van Laarhoven
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 563 KB
- Volume
- 106-107
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
Some spectral techniques in coding theory, Discrete Mathematics 87 (1991) 181-186. Let f be a real-valued function on the n-dimensional linear space F" over F = (0, 1) and let A be a linear transformation of F" into F". The Walsh spectrum of the composite f 0 A is obtained. In particular, the Walsh
This article addresses a basic problem in search theory concerning the future distribution of a target's location. Given an initial distribution of a target's location and a distribution for its constant velocity, what will its future distribution be? Asymptotics are used to obtain closed-form solut
Sullivan (1970 Sullivan ( , 1974) ) pointed out the availability and applicability of localization methods in homotopy theory. We shall apply the method to dimension theory and analyze covering dimension and cohomological dimension from the viewpoint. The notion of localized dimension with respe