A NOTE ON THE EXISTENCE OF NON-SIMPLE DESIGNS OVER FINITE FIELDS
___
- [1] Braun, M. Designs over Finite Fields. In ALCOMA’05 — Proceedings of the Conference on
Algebraic Combinatorics and Applications, Designs and Codes, April 3-10, 2005, Thurnau, Germany.
Bayreuther Mathematische Schriften 74:58–68, 2005.
- [2] Braun, M., Kerber, A. and Laue, R. Systematic Construction of q-Analogs of Designs. De- signs,
Codes and Cryptography, 34(1):55–70, 2005.
- [3] Etzion, T. and Vardy, A. On q-Analogs of Steiner Systems and Covering Designs. Advances in the
Mathematics of Communications, Special Issue on ALCOMA’10 — Algebraic Com-
binatorics and Applications, April 11-18, 2010, Thurnau, Germany, 5(2):161–176, 2011.
- [4] Itoh, T. A New Family of 2-Designs over GF (q) Admitting SLm(ql). Geometriae Dedicata,
69:261–286, 1998.
- [5] Kramer, E. and Mesner, D. t-Designs on Hypergraphs. Discrete Mathematics, 15(3):263–296, 1976.
- [6] Miyakawa, M., Munemasa, A. and Yoshiara, S. On a Class of Small 2-Designs over GF (q).
Journal of Combinatorial Designs, 3:61–77, 1995.
- [7] Mnukhin, V.B. and Siemons I.J. On the Livingstone-Wagner Theorem. The Electronic Jour- nal of
Combinatorics, 11(R29):1–8, 2004.
- [8] Ray-Chaudhuri, D.K. and Schram, E.J. Designs on Vectorspaces Constructed Using Qua- dratic
Forms. Geometriae Dedicata, 42:1–42, 1992.
- [9] Schwartz, M. and Etzion, T. Codes and Anticodes in the Grassman Graph. Journal of Com-
binatorial Theory, Series A, 97:27–42, 2002.
- [10] Stanley, R.P. Some Aspects of Groups Acting on Finite Posets. Journal of Combinatorial Theory,
Series A, 32:132–161, 1982.
- [11] Suzuki, H. 2-Designs over GF (2m). Graphs and Combinatorics, 6:293–296, 1990.
- [12] Suzuki, H. 2-Designs over GF (q). Graphs and Combinatorics, 8:381–389, 1992. [13] Thomas, S.
Designs over Finite Fields. Geometriae Dedicata, 24:237–242, 1987.
- [14] Thomas, S. Designs and Partial Geometries over Finite Fields. Geometriae Dedicata, 63:247–
253, 1996.