A generalization of (2,w;d)-cover free families.
From MaRDI portal
Publication:4568167
zbMATH Open1474.05044arXiv1410.4361MaRDI QIDQ4568167FDOQ4568167
Authors: Mehdi Azadi Motlagh, Farokhlagha Moazami 
Publication date: 15 June 2018
Abstract: An (r;w; d) -cover-free family (CFF) is a family of subsets of a finite set such that the intersection of any r members of the family contains at least d elements that are not in the union of any other w members. The minimum number of elements for which there exists an (r;w; d)-CFF with t blocks is denoted by N((r;w; d); t). In this paper, we determine the exact value of N((r;w; d); t) for some special parameters. Also, we present two constructions for (2; 1; d)- CFF and (2; 2; d)-CFF which improve the existing constructions. Moreover, we introduce a generalization of cover-free families which is motivated by an application of CFF in the key predistribution schemes. Also, we investigate some properties and bounds on the parameters of this generalization.
Full work available at URL: https://arxiv.org/abs/1410.4361
Recommendations
Cited In (8)
- Lower bounds for cover-free families
- A note on cover-free families
- Biclique cover and local clique cover of graphs
- Generalized cover-free families.
- Cover-free families and topology-transparent communication
- Constructions of 2-cover-free families and related separating hash families
- Some new bounds for cover-free families through biclique covers
- Almost optimal cover-free families
This page was built for publication: A generalization of \((2,w;d)\)-cover free families.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568167)
