Cover-free families and superimposed codes: constructions, bounds and applications to cryptography and group testing
A.G. D'yachkov, Vladimir S Lebedev, Pavel A. Vilenkin, Sergey Yekhanin · 2002
This paper deals with (s,l)-cover-free families or superimposed (s,l)-codes. They generalize the concept of superimposed s-codes and have several applications for cryptography and group testing. We present a new asymptotic bound on the rate of optimal codes and develop some constructions.