Locally thin set families Combinatorics, Prob. Computing, vol.6, pp.481-488, 2000. ,
Information Theory : Coding Theorems for Discrete Memoryless Systems, 1982. ,
DOI : 10.1017/CBO9780511921889
A Better Bound for Locally Thin Set Families, Journal of Combinatorial Theory, Series A, vol.95, issue.2, pp.209-218, 2001. ,
DOI : 10.1006/jcta.2000.3162
Union-free Hypergraphs and Probability Theory, European Journal of Combinatorics, vol.5, issue.2, pp.127-131, 1984. ,
DOI : 10.1016/S0195-6698(84)80025-6
URL : http://doi.org/10.1016/s0195-6698(84)80025-6
Onr-Cover-free Families, Journal of Combinatorial Theory, Series A, vol.73, issue.1, pp.172-173, 1996. ,
DOI : 10.1006/jcta.1996.0012
Extremal Combinatorics With Applications in Computer Science, 2000. ,
New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback, IEEE Transactions on Information Theory, vol.46, issue.3, pp.1043-1046, 2000. ,
DOI : 10.1109/18.841182