An application of covering designs: Determining the maximum consistent set of shares in a threshold scheme

Ars Combinatoria

Volumn 53, Issue , 1999, Pages 225-237

  Rees, R S ^a   Stinson, D R ^b   Wei, R ^b   Van Rees, G H J ^c  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039527186     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. D. M. Gordon, G. Kuperberg and O. Patashnik. New constructions for covering designs, J. Combin. Designs 3 (1995), 269-284.
2. W. H. Mills. Covering designs I: coverings by a small number of subsets, Ars Combm. 8 (1979), 199-315.
3. A. F. Sidorenko. Extremal constants and inequalities for distributions of sums of random vectors, (in Russian), PhD Thesis, Moscow State University, 1982.
4. A. F. Sidorenko. Precise values of Turán numbers, Math. Notes 42 (1987), 913-918.
5. A. F. Sidorenko. What we know and what we do not know about Turán numbers, Graphs Combin. 11 (1995), 179-199.
6. D. R. Stinson. Cryptography Theory and Practice, CRC Press, Inc., 1995.
7. D. T. Todorov. On some covering designs. J. Combin. Theory A 39 (1985), 83-101.