Greedy and heuristic algorithms for codes and colorings
Copyright policy )Greedy and heuristic algorithms for codes and colorings
This paper deals with specific problems of coding theory. The problem of constructing a code with given minimum Hamming distance is formulated as the task to construct, in a metric space with discrete metric, such a set in which the distance between elements is not smaller than a given value. The problem is formulated, some approaches to its solution are heuristically described and discussed, and the general theory is completed by numerical values solving a special case of the searched partition of the metric space.
- Technion – Israel Institute of Technology Israel
- University of Helsinki Finland
Other types of codes, constant weight code, evolution algorithms, Search theory, Approximation methods and heuristics in mathematical programming, discrete metric, minimum Hamming distance, Bounds on codes, greedy algorithms, tabu search, asymptotic code, coloring
Other types of codes, constant weight code, evolution algorithms, Search theory, Approximation methods and heuristics in mathematical programming, discrete metric, minimum Hamming distance, Bounds on codes, greedy algorithms, tabu search, asymptotic code, coloring
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).31 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!