A new bound on the number of designs with classical affine parameters

Authors

Clement Lam, Concordia University, Montreal
Vladimir Tonchev, Michigan Technological UniversityFollow

Document Type

Article

Publication Date

10-2002

Publisher's Statement

© Kluwer Academic Publishers 2002. Publisher’s version of record: https://doi.org/10.1023/A:1016502619995

Publication Title

Designs, Codes and Cryptography

Recommended Citation

Lam, C., & Tonchev, V. (2002). A new bound on the number of designs with classical affine parameters. Designs, Codes and Cryptography, 27(1-2), 111-117. http://doi.org/10.1023/A:1016502619995
Retrieved from: https://digitalcommons.mtu.edu/math-fp/174