Lower bounds for cover-free families (Q2629487): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1502.03578 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Learning a Hidden Subgraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4745752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on the rate of disjunctive codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On \(r\)-cover-free families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonrandom binary superimposed codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a bound of cover-free families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the upper bound of the size of the \(r\)-cover-free families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some new bounds for cover-free families / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:17, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds for cover-free families |
scientific article |
Statements
Lower bounds for cover-free families (English)
0 references
6 July 2016
0 references
Summary: Let \(\mathcal F\) be a set of blocks of a \(t\)-set \(X\). A pair \((X,\mathcal F)\) is called an \((w,r)\)-cover-free family (\((w,r)\)-CFF) provided that, the intersection of any \(w\) blocks in \(\mathcal F\) is not contained in the union of any other \(r\) blocks in \(\mathcal F\).{ }We give new asymptotic lower bounds for the number of minimum points \(t\) in a \((w,r)\)-CFF when \(w\leq r=|\mathcal F|^\epsilon\) for some constant \(\epsilon\geq 1/2\).
0 references
lower bound
0 references
cover-free family
0 references