A survey is given that comprises the known classification results on non-mixed and mixed optimal covering codes. Several new, so far unpublished results of the author are declared and proved as well. The generality of the specified classification results are quite different. The proof of the more or less general new results are mostly combinatorial. In contrast with the latter, computer-aided proofs are given for numerous individual cases. The individual (old and new) classification results are merged and summarized in a set of tables
In the article the problem of finding optimal classifications on a finite set is investigated. It is...
An indirect genetic algorithm for the non-unicost set covering problem is presented. The algorithm i...
Covering methods constitute a broad class of algorithms for solving multivariate Global Optimization...
We derive lower bounds onR-coverings and upper bounds one-packings of . These bounds are generalizat...
According to the experiences, it is a known fact that some essential features of normal codes are qu...
AbstractWe derive lower bounds onR-coverings and upper bounds one-packings of F3tF2b. These bounds a...
Let (n,M)R denote any binary code with length n, cardinality M and covering radius R. The classifica...
In a recent paper by the same author general improvements on the sphere covering bound for binary co...
In this paper we investigate the problem of computing optimal lottery schemes. From a computational...
AbstractWe develop two methods for obtaining new lower bounds for the cardinality of covering codes....
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
AbstractIn a recent paper by the same author general improvements on the sphere covering bound for b...
We briefly review the application of local search to a special class of coding problems: covering an...
Covering arrays are combinatorial objects that have been successfully applied in the design of test ...
AbstractWe briefly review the application of local search to a special class of coding problems: cov...
In the article the problem of finding optimal classifications on a finite set is investigated. It is...
An indirect genetic algorithm for the non-unicost set covering problem is presented. The algorithm i...
Covering methods constitute a broad class of algorithms for solving multivariate Global Optimization...
We derive lower bounds onR-coverings and upper bounds one-packings of . These bounds are generalizat...
According to the experiences, it is a known fact that some essential features of normal codes are qu...
AbstractWe derive lower bounds onR-coverings and upper bounds one-packings of F3tF2b. These bounds a...
Let (n,M)R denote any binary code with length n, cardinality M and covering radius R. The classifica...
In a recent paper by the same author general improvements on the sphere covering bound for binary co...
In this paper we investigate the problem of computing optimal lottery schemes. From a computational...
AbstractWe develop two methods for obtaining new lower bounds for the cardinality of covering codes....
It is shown that every optimal binary code with covering radius R=1 is normal. This (parity) proves ...
AbstractIn a recent paper by the same author general improvements on the sphere covering bound for b...
We briefly review the application of local search to a special class of coding problems: covering an...
Covering arrays are combinatorial objects that have been successfully applied in the design of test ...
AbstractWe briefly review the application of local search to a special class of coding problems: cov...
In the article the problem of finding optimal classifications on a finite set is investigated. It is...
An indirect genetic algorithm for the non-unicost set covering problem is presented. The algorithm i...
Covering methods constitute a broad class of algorithms for solving multivariate Global Optimization...