Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Following Frankl and Füredi [1] we say a family, F, of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A ∪ B = C ∪ D. If in addition A ∪ B = A ∪ C implies B = C we say F is strongly union-free. Let f(n) (g(n)) be the maximum size of strongly (weakly) union-free families. In this paper we prove the following new bounds on f and g: 2[0+o(1)]n ≤ f(n) ≤ 2 [0+o(1)]n and g(n) ≤ 2[0+o(1)]n.
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Sankar Basu
Journal of the Franklin Institute
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997