Abstract
This paper presents a construction of 2-(2n−1, n,λ) designs and gives the polynomial description of this class of designs. The construction applies to the cases of all integer n≥2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beth, T., Jungnickel, D. and Lenz, H., Design Theory, Bibliographisches Institute, Zürich 1986.
MacWilliams, F.J., and Sloane, N. J. A., The Theory of Error-Correcting Codes, North-Holland, 1977.
Brickell, E., A few results in message authentication, Congressus Numerantium, 1984,43:141–154.
Stinson, D.R., The combinatorics of authentication and secrecy codes, J. Cryptology, 1990,2:23–49.
Lidl, R. and Niederreiter, H., Finite Fields, Cambridge University Press, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chuankun, W., Likuan, Z. Construction of 2-designs. Appl. Math. Chin. Univ. 14, 99–102 (1999). https://doi.org/10.1007/s11766-999-0060-8
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11766-999-0060-8