The Lovász Local Lemma and its applications to some combinatorial arrays

Designs, Codes, and Cryptography

Volumn 32, Issue 1-3, 2004, Pages 121-134

  Deng, D ^a   Stinson, D R ^a   Wei, R ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b LAKEHEAD UNIVERSITY   (Canada)

Author keywords

Combinatorial array; Lov sz local lemma; Probabilistic method

Indexed keywords

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; PROBABILITY; THEOREM PROVING;

COMBINATORIAL ARRAYS; LOCAL LEMMA; PROBABILISTIC METHOD; SPLITTING SYSTEM;

CRYPTOGRAPHY;

EID: 3543079233     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DESI.0000029217.97956.26     Document Type: Conference Paper

References (15)

1. N. Alon, G. Cohen, M. Krivelevich and S. Litsyn, Generalized hashing and parent-identifying codes, Journal of Combinatorial Theory A, Vol. 104 (2003) pp. 207-215.
2. N. Alon and J. H. Spencer, The Probabilistic Method, second edition, John Wiley & Sons (2002).
3. A. Barg, G. R. Blakley and G. A. Kabatiansky, Digital fingerprinting codes: Problem statements, constructions, identification of traitors, IEEE Trans. Inform. Theory, Vol. 49 (2003) pp. 852-865.
4. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky and G. Zémor, A hypergraph approach to the identifying parent property: The case of multiple parents, SIAM J. Discrete Math., Vol. 14 (2001) pp. 423-431.
5. S. R. Blackburn, Perfect hash families: Probabilistic methods and explicit constructions, Journal of Combinatorial Theory A, Vol. 92 (2000) pp. 54-60.
6. W. A. Deuber, D. S. Gunderson, A. V. Kostochka and A. G. Meyer, Intersection statements for systems of sets, Journal of Combinatorial Theory A, Vol. 79 (1997) pp. 118-132.
7. P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related quesitons. In A. Hajnal et al. (eds.), Infinite and Finite Sets, North-Holland, Amsterdam (1975) pp. 609-628.
8. P. Erdös and E. Szemerédi, Combinatorial properties of systems of sets, Journal of Combinatorial Theory A, Vol. 24 (1978) pp. 308-313.
9. H. D. L. Hollmann, J. H. van Lint, J. P. Linnartz and L. M. G. M. Tolhuizen, On codes with the identifiable parent property, Journal of Combinatorial Theory A, Vol. 82 (1998) pp. 121-133.
10. W. H. Kautz and R. C. Singleton, Nonrandom binary superimposed codes, IEEE Trans. Inform. Theory, Vol. 10 (1964) pp. 363-377.
11. A. C. H. Ling, P. C. Li and G. H. J. van Rees, Splitting systems and separating systems, Discrete Mathematics, Vol. 279 (2004) pp. 355-368.
12. K. Mehlhorn, On the program size of perfect and universal hash functions. In Proceedings of 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 170-175.
13. D. R. Stinson, T. van Trung and R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, Journal of Statistical Planning and Inference, Vol. 86 (2000) pp. 595-617.
14. D. R. Stinson, Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem, Mathematics of Computation, Vol. 71 (2001) pp. 379-391.
15. D. R. Stinson and R. Wei, Generalized cover-free families, Discrete Mathematics, Vol. 279 (2004) pp. 463-477.