{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:28Z","timestamp":1725936328364},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_23","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T09:35:54Z","timestamp":1513762554000},"page":"289-294","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Small 4-Designs with Nonabelian Automorphism Groups"],"prefix":"10.1007","author":[{"given":"Vedran","family":"Kr\u010dadinac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario Osvin","family":"Pav\u010devi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Araya, M., Harada, M.: Mutually disjoint Steiner systems $$S(5,8,24)$$ S ( 5 , 8 , 24 ) and $$5$$ 5 - $$(24,12,48)$$ ( 24 , 12 , 48 ) designs. Electron. J. Comb. 17, #N1 (2010)","DOI":"10.37236\/450"},{"issue":"4","key":"23_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/jcd.20251","volume":"18","author":"M Araya","year":"2010","unstructured":"Araya, M., Harada, M., Tonchev, V.D., Wassermann, A.: Mutually disjoint designs and new $$5$$ 5 -designs derived from groups and codes. J. Comb. Des. 18(4), 305\u2013317 (2010)","journal-title":"J. Comb. Des."},{"key":"23_CR3","unstructured":"The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.8.7 (2017). http:\/\/www.gap-system.org"},{"key":"23_CR4","unstructured":"Khosrovshahi, G.B., Laue, R.: $$t$$ t -designs with $$t\\ge 3$$ t \u2265 3 . In: Colbourn, C.J., Dinitz, J.F. (eds.) The Handbook of Combinatorial Designs, 2nd edn., pp. 79\u2013101. Chapman & Hall\/CRC, Boca Raton (2007)"},{"issue":"3","key":"23_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0012-365X(76)90030-3","volume":"15","author":"ES Kramer","year":"1976","unstructured":"Kramer, E.S., Mesner, D.M.: $$t$$ t -designs on hypergraphs. Discrete Math. 15(3), 263\u2013296 (1976)","journal-title":"Discrete Math."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Kr\u010dadinac, V.: Some new designs with prescribed automorphism groups. J. Comb. Des. (2017, to appear)","DOI":"10.1002\/jcd.21587"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism II. J. Symbolic Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symbolic Comput."},{"issue":"8","key":"23_CR8","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1016\/j.jcta.2008.04.005","volume":"115","author":"PRJ \u00d6sterg\u00e5rd","year":"2008","unstructured":"\u00d6sterg\u00e5rd, P.R.J., Pottonen, O.: There exists no Steiner system $$S(4,5,17)$$ S ( 4 , 5 , 17 ) . J. Comb. Theory Ser. A 115(8), 1570\u20131573 (2008)","journal-title":"J. Comb. Theory Ser. A"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.disc.2014.02.009","volume":"325","author":"DR Stinson","year":"2014","unstructured":"Stinson, D.R., Swanson, C.M., van Trung, T.: A new look at an old construction: constructing (simple) $$3$$ 3 -designs from resolvable $$2$$ 2 -designs. Discrete Math. 325, 23\u201331 (2014)","journal-title":"Discrete Math."},{"issue":"3","key":"23_CR10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10623-016-0238-z","volume":"83","author":"T Trung van","year":"2017","unstructured":"van Trung, T.: Simple $$t$$ t -designs: a recursive construction for arbitrary $$t$$ t . Des. Codes Cryptogr. 83(3), 493\u2013502 (2017)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"23_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/(SICI)1520-6610(1998)6:2<79::AID-JCD1>3.0.CO;2-S","volume":"6","author":"A Wassermann","year":"1998","unstructured":"Wassermann, A.: Finding simple $$t$$ t -designs with enumeration techniques. J. Comb. Des. 6(2), 79\u201390 (1998)","journal-title":"J. Comb. Des."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T22:38:09Z","timestamp":1719700689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}