×

Construction of 2-designs. (English) Zbl 0996.05011

Summary: This paper presents a construction of \(2\)-\((2^n- 1,n,\lambda)\) designs and gives the polynomial description of this class of designs. The construction applies to the cases of all integers \(n\geq 2\).

MSC:

05B05 Combinatorial aspects of block designs
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Beth, T., Jungnickel, D. and Lenz, H., Design Theory, Bibliographisches Institute, Zürich 1986.
[2] MacWilliams, F.J., and Sloane, N. J. A., The Theory of Error-Correcting Codes, North-Holland, 1977. · Zbl 0369.94008
[3] Brickell, E., A few results in message authentication, Congressus Numerantium, 1984,43:141–154. · Zbl 0561.05042
[4] Stinson, D.R., The combinatorics of authentication and secrecy codes, J. Cryptology, 1990,2:23–49. · Zbl 0701.94006 · doi:10.1007/BF02252868
[5] Lidl, R. and Niederreiter, H., Finite Fields, Cambridge University Press, 1984. · Zbl 1139.11053
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.