Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$‎, ‎$q \leq 23$

[1] N. Balachandran and D. Ray-Chaudhuri, Simple 3-designs and P S L (2 ; q ) with q  1mo d 4, Des. Codes Cryptogr. ,
44 (2007) 263{274.
[2] T. Beth, D. Jungnickel and H. Lenz, Design Theory , 2nd Edition, Cambridge University Press, Cambridge, 1999.
[3] A. E. Brouwer, Strongly Regular Graphs , in: C. J. Colb ourn, J. H. Dinitz (Eds.), Handb o ok of Combinatorial
Designs, 2 nd ed., Chapman & Hall/CRC, Bo ca Raton, 2007 852{868.
[4] A. E. Brouwer, Parameters of Strongly Regular Graphs , 2017. Available at
http://www.win.tue.nl/ aeb/graphs/srg/srgtab.html .
[5] W. Bosma and J. Cannon, Handbook of Magma Functions , Department of Mathematics, University of Sydney, 1994.
http://magma.maths.usyd.edu.au/magma .
[6] P. J. Cameron, H. R. Maimani, G. R. Omidi and B. Tayfeh-Rezaie, 3-designs from P S L (2 ; q ), Discrete Math. , 306
(2006) 3063{3073.
[7] J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, R. A. Wilson and J. G. Thackray, Atlas of Finite Groups ,
Clarendon Press, Oxford, 1985.
[8] D. Crnkovic and V. Mikulic, On some combinatorial structures constructed from the groups L (3 ; 5), U (5 ; 2) and
S (6 ; 2), Int. J. Comb. , 2011 (2011) 12 pages.
[9] D. Crnkovic and V. Mikulic, Unitals, pro jective planes and other combinatorial structures constructed from the
unitary groups U (3 ; q ) ; q = 3 ; 4 ; 5 ; 7, Ars Combin. , 110 (2013) 3{13.
[10] D. Crnkovic, V. Mikulic Crnkovic and A. Svob, On some transitive combinatorial structures constructed from the
unitary group U (3 ; 3), J. Statist. Plann. Inference , 144 (2014) 19{40.
[11] J. D. Key and J. Mo ori, Co des, Designs and Graphs from the Janko Groups J 1 and J2 , J. Combin. Math. Combin.
Comput. , 40 (2002) 143{159.
[12] J. D. Key and J. Mo ori, Correction to: Co des, designs and graphs from the Janko groups J1 and J 2 , [J. Combin.
Math. Combin. Comput. 40 (2002), 143{159], J. Combin. Math. Combin. Comput. , 64 (2008) 153.
[13] J. D. Key, J. Mo ori and B. G. Ro drigues, On some designs and co des from primitive representations of some nite
simple groups, J. Combin. Math. Combin. Comput. , 45 (2003) 3{19.
[14] G. B. Khosrovshahi, t -Designs with t  3, in: C. J. Colb ourn, J. H. Dinitz (Eds.), Handb o ok of Combinatorial
Designs, 2 nd ed., Chapman & Hall/CRC, Bo ca Raton, 2007 79{102.
[15] D. L. Kreher, t -designs , in: C. J. Colb ourn and J. H. Dinitz (Eds.), Handb o ok of Combinatorial Designs, 1 st ed.,
Chapman & Hall/CRC, Bo ca Raton, 1996 65{84.
[16] R. Mathon and A. Rosa, 2 -( v ; k ;  ) Designs of Smal l Order , in: C. J. Colb ourn, J. H. Dinitz (Eds.), Handb o ok of
Combinatorial Designs, 2 nd ed., Chapman & Hall/CRC, Bo ca Raton, 2007 25{58.
[17] D. Robinson, A Course in the Theory of groups , Springer-Verlag, New York, Berlin, Heidelb erg, 1996.

[18] M. S. Shrikhande, Quasi-Symmetric Designs , in: C. J. Colb ourn, J. H. Dinitz (Eds.), Handb o ok of Combinatorial
Designs, 2 nd ed., Chapman & Hall/CRC, Bo ca Raton, 2007 578{582.
[19] V. D. Tonchev, Combinatorial Congurations: Designs, Codes, Graphs , John Willey & Sons, New York, 1988.
[20] E. Witt, Die 5-Fach transitiven Grupp en von Mathieu, Abh. Math. Sem. Univ. Hamburg , 12 (1938) 256{264.
[21] E. Witt, Ub er Steinersche Systeme, Abh. Math. Sem. Univ. Hamburg , 12 (1938) 265-275.