Abstract
A Kirkman packing design KPD ({3, 5*},v) is a resolvable packing with maximum possible number of parallel classes, each class containing one block of size 5 and all other blocks of size three. Such designs can be used to construct certain threshold schemes in cryptography. In this paper, direct and recursive constructions are discussed for such designs. The existence of a KPD ({3, 5*},v) for \(v \equiv 2{\text{ (mod 3)}}\) is established with a few possible exceptions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Cao and B. Du, Kirkman packing designs KPD ({w, s*}, v) and related threshold schemes, preprint.
A. Cerny, P. Horak and W. D. Wallis, Kirkman's school projects, Discrete Math., Vol. 167/168 (1997) pp. 189–196.
D. Chen and D. R. Stinson, Recent results on combinatorial constructions for threshold schemes, Austral. J. Combin., Vol. 1 (1990) pp. 29–48.
C. J. Colbourn and J. H. Dinitz (eds.), CRC Handbook of Combinatorial Designs, CRC Press Inc., Boca Raton (1996).
C. J. Colbourn and A. C. H. Ling, Kirkman school project designs, Discrete Math., Vol. 203 (1999) pp. 49–60.
N. C. K. Phillips, W. D. Wallis and R. S. Rees, Kirkman packing and covering designs, JCMCC, Vol. 28 (1998) pp. 299–325.
P. J. Schellenberg and D. R. Stinson, Threshold schemes from combinatorial designs, JCMCC, Vol. 5 (1989) pp. 143–160.
D. R. Stinson, Frames for Kirkman triple systems, Discrete Math., Vol. 65 (1987) pp. 289–300.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cao, H., Zhu, L. Kirkman Packing Designs KPD ({3, 5*},v). Designs, Codes and Cryptography 26, 127–138 (2002). https://doi.org/10.1023/A:1016557325930
Issue Date:
DOI: https://doi.org/10.1023/A:1016557325930