Abstract
The existence of blocking sets in (υ, {2, 4}, 1)-designs is examined. We show that for υ ≡ 0, 3, 5, 6, 7, 8, 9, 11 (mod 12>), blocking sets cannot exist. We prove that for each ≡ 1, 2, 4 (mod 12) there is a (υ, {2, 4}, 1)-design with a blocking set with three possible exceptions. The case υ ≡ 10 (mod 12) is still open; we consider the first four values of υ in this situation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. M. Batten, Blocking sets in designs, Congressus Numerantium, Vol. 99 (1994) pp. 139–154.
L. M. Batten, A private key cryptosystem with signature capability based on blocking sets in P G(2, q), preprint.
L. Berardi and F. Eugeni, Blocking sets and game theory, Mitt. Math. Sem. Giessen, Vol. 201 (1991) pp. 1–17.
A. E. Brouwer, Optimal packings of K 4's into a K n , J. Combin. Theory (A), Vol. 26 (1979) pp. 278–297.
A. E. Brouwer, A. Schrijver, and H. Hanani, Group divisible designs with block-size four, Discrete Maths, Vol. 20 (1977) pp. 1–10.
C. J. Colbourn and A. Rosa, Colorings of Block Designs: Contemporary Design Theory (J. H. Dinitz and D. R. Stinson, eds.), (1992) pp. 401–430.
A. J. Hoffman and M. Richardson, Block design games, Canad. J. Math., Vol. 13 (1961) pp. 110–128.
D. G. Hoffman, C. C. Lindner, and K. T. Phelps, Blocking sets in designs with block size four, Europ. J. Comb., Vol. 11 (1990) pp. 451–457.
D. G. Hoffman, C. C. Lindner, and K. T. Phelps, Blocking sets in designs with block size four II, Discrete Maths., Vol. 89 (1991) pp. 221–229.
D. Jungnickel and M. Leclerc, Blocking sets in (r, λ)-designs, Ars Combin., Vol. 22 (1986) pp. 211–219.
A. Y. C. Kuk, Asking sensitive questions indirectly, Biometrika, Vol. 77 (1990) pp. 436–438.
C. C. Lindner, How to construct a block design with block size four admitting a blocking set, Australas. J. Combin., Vol. 1 (1990) pp. 101–125.
D. Raghavarao, private communication.
M. Richardson, On finite projective games, Proc. Amer. Math. Soc., Vol. 7 (1956) pp. 458–465.
A. Rosa, On the chromatic number of Steiner triple systems: Combinatorial Structures and their Applications, Proc. Conf. Calgary (1970) pp. 369–371.
J. Seberry and J. Pieprzyk, Cryptography: An Introduction to Computer Security, Prentice Hall, Sydney, Toronto, London (1989).
D. R. Stinson, The spectrum of nested Steiner triple systems, Graphs and Combinatorics, Vol. 1 (1985) pp. 189–191.
A. P. Street and D. J. Street, Combinatorics of Experimental Design, Clarendon Press, Oxford (1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Batten, L.M., Coolsaet, K. & Street, A.P. Blocking Sets in (υ,{2, 4}, 1)-Designs. Designs, Codes and Cryptography 10, 309–314 (1997). https://doi.org/10.1023/A:1008291502915
Issue Date:
DOI: https://doi.org/10.1023/A:1008291502915