abstract
In the present paper we consider a q-analog of t−(v,k,λ)-designs. It is canonic since it arises by replacing sets by vector spaces over GF(q), and their orders by dimensions. These generalizations were introduced by Thomas [Geom.Dedicata vol. 63, pp. 247–253 (1996)] they are called t −(v,k,λ;q)- designs. A few of such q-analogs are known today, they were constructed using sophisticated geometric arguments and case-by-case methods. It is our aim now to present a general method that allows systematically to construct such designs, and to give complete catalogs (for small parameters, of course) using an implemented software package. In order to attack the (highly complex) construction, we prepare them for an enormous data reduction by embedding their definition into the theory of group actions on posets, so that we can derive and use a generalization of the Kramer-Mesner matrix for their definition, together with an improved version of the LLL-algorithm. By doing so we generalize the methods developed in a research project on t −(v,k,λ)-designs on sets, obtaining this way new results on the existence of t−(v,k,λ;q)-designs on spaces for further quintuples (t,v,k,λ;q) of parameters. We present several 2−(6,3,λ;2)-designs, 2−(7,3,λ;2)-designs and, as far as we know, the very first 3-designs over GF(q).
Similar content being viewed by others
References
T. Abe S. Yoshiara (1993) ArticleTitleOn Suzuki’s construction of 2-designs over GF(q) Sci. Rep. Hirosaki Univ. 10 119–122
A. Betten, A. Kerber, A. Kohnert, R. Laue and A. Wassermann, The discovery of simple 7-designs with automorphism group PΓL(2,32),Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Paris, 1995), 131–145, Lecture Notes in Computer Sci., Vol. 948, Springer, Berlin (1995).
A. Betten R. Laue A. Wassermann (1999) ArticleTitleSimple 7-designs with small parameters J. Comb Designs 7 79–94
A. Betten, E. Haberberger, R. Laue and A. Wassermann,DISCRETA – A Program System for the Construction of t-Designs, Lehrstuhl II für Mathematik, Universität Bayreuth, http://www.mathe2.uni-bayreuth.de/~discreta, 1999.
M. Braun,Die Konstruktion von q-Analoga Kombinatorischer Designs.Diplomarbeit, Universität Bayreuth (2001).
E. Haberberger A. Betten R. Laue (2000) ArticleTitleIsomorphism classification of t-designs with grouptheoretical localisation techniques applied to some steiner quadrupel systems on 20 points Congressus Numerantium 142 75–96
T. Itoh (1998) ArticleTitleA new family of 2-designs over GF(q) admitting SL m (ql) Geom. Dedicata 69 261–286
A. Kerber (1999) Applied Finite Group Actions Springer-Verlag Berlin Heidelberg New York
A. Kerber R. Laue (1998) ArticleTitleGroup actions, double cosets, and homomorphisms: Unifying concepts for the constructive theory of discrete structures Acta Appl Math. 52 63–90
E. S. Kramer D. M. Mesner (1976) ArticleTitlet-Designs on Hypergraphs Discrete Math. 15 IssueID3 263–296
R. Laue (1993) ArticleTitleConstruction of Combinatorial Objects –- a Tutorial Bayreuther Math Schriften, Heft 43 53–96
R. Laue, Constructing objects up to isomorphism, simple 9-designs with small parameters, Algebraic Combinatorics and Applications, Springer, Berlin Heidelberg New York pp. 232–260 (2001), NOTE = presented at ALCOMA, Sept. (1999).
M. Miyakawa, The Existence of new 2-(7,3,3;2) Designs, Master’s Thesis, Hirosaki Universität (1993).
B. Schmalz,Computerunterstützte Konstruktion von Doppelnebenklassenrepr\”asentanten mit Anwendung auf das Isomorphieproblem der Graphentheorie, Diplomarbeit, Universitát Bayreuth, (1989).
B. Schmalz, t-Designs zu vorgebener automorphismengruppe,Bayreuther Mathe. Schriften, HeftVol. 41 (1992).
B. Schmalz (1993) ArticleTitleThe t-designs with prescribed automorphism group, new simple 6-designs J. Combin. Des. 1 125–170
H. Suzuki (1992) ArticleTitle2-Designs over GF(q) Graphs Combinatorics 8 381–389
S. Thomas (1987) ArticleTitleDesigns over Finite Fields Geom. Dedicata 24 237–242
S. Thomas (1996) ArticleTitleDesigns and partial geometries over finite fields Geom. Dedicata 63 247–253
A. Wassermann (1998) ArticleTitleFinding simple t-designs with enumeration techniques J. Combinatorial Designs 6 79–90
S. Weinrich, Konstruktionsalgorithmen für diskrete Strukturen und ihre Implementierung, Diplomarbeit, Universität Bayreuth (1993).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicaterd by C. J. Colbourn
classification 05B05
Rights and permissions
About this article
Cite this article
Braun, M., Kerber, A. & Laue, R. Systematic Construction of q-Analogs of t−(v,k,λ)-Designs. Des Codes Crypt 34, 55–70 (2005). https://doi.org/10.1007/s10623-003-4194-z
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-003-4194-z