Abstract
A construction is described that yields improved lower bounds for the numbers of 2-designs and resolvable 2-designs with the parameters of AG d (n, q).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clark D., Jungnickel D., Tonchev V.D.: Exponential bounds on the number of designs with affine parameters. J. Combin. Des 18, 475–487 (2010)
Colbourn, C.J., Dinitz, J.H. (eds): The Handbook of Combinatorial Designs (2nd edn). CRC Press, Boca Raton (2007)
Donovan D.M., Grannell M.J.: Designs having the parameters of projective and affine spaces. Des. Codes Cryptogr 60, 225–240 (2011)
Jungnickel D.: The number of designs with classical parameters grows exponentially. Geom. Dedicata 16, 167–178 (1984)
Jungnickel D., Tonchev V.D.: The number of designs with geometric parameters grows exponentially. Des. Codes Cryptogr 55, 131–140 (2010)
Kantor W.M.: Automorphisms and isomorphisms of symmetric and affine designs. J. Algebraic Combin 3, 307–338 (1994)
Kocay W., van Rees G.H.J.: Some nonisomorphic (4t + 4, 8t + 6, 4t + 3, 2t + 2, 2t + 1)-BIBDs. Discrete Math 92, 159–172 (1991)
Lam C., Lam S., Tonchev V.D.: Bounds on the number of affine, symmetric, and Hadamard designs and matrices. J. Combin. Theory Ser. A 92, 186–196 (2000)
Lam C., Tonchev V.D.: A new bound on the number of designs with classical affine parameters. Des. Codes Cryptogr 27, 111–117 (2002)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. D. Tonchev.
Rights and permissions
About this article
Cite this article
Donovan, D.M., Grannell, M.J. On the number of designs with affine parameters. Des. Codes Cryptogr. 63, 15–27 (2012). https://doi.org/10.1007/s10623-011-9528-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-011-9528-7