Application of Uniformly Deployed Sets

Abstract

Uniformly deployed sets (UDS) are combinatorial objects that contain n-bit binary words of weight $p$ and each pair of words from such a set has a prescribed minimal Hamming distance. In our previous works, we used UDS in heuristics for a p-median problem. In this contribution, we introduce a more effective algorithm for the construction of UDS with given parameters. We also show their application in a covering problem and two special problems from reliability analysis and artificial neural networks that involve work with n-bit binary words of various weights.