{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:16:03Z","timestamp":1726413363537},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T00:00:00Z","timestamp":1467417600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10623-016-0238-z","type":"journal-article","created":{"date-parts":[[2016,7,2]],"date-time":"2016-07-02T03:17:10Z","timestamp":1467429430000},"page":"493-502","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Simple t-designs: a recursive construction for arbitrary t"],"prefix":"10.1007","volume":"83","author":[{"given":"Tran","family":"van Trung","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,2]]},"reference":[{"key":"238_CR1","doi-asserted-by":"crossref","unstructured":"Ajoodani-Namini S.: Extending large sets of $$t$$ t -designs. J. Combin. Theory A 76, 139\u2013144 (1996).","DOI":"10.1006\/jcta.1996.0093"},{"key":"238_CR2","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)."},{"key":"238_CR3","doi-asserted-by":"crossref","unstructured":"Betten A., Kerber A., Kohnert A., Laue R., Wassermann A.: The discovery of simple 7-designs with automorphism group $$P\\Gamma L(2,32)$$ P \u0393 L ( 2 , 32 ) . In: Cohen G., Giusti M., Mora T. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp. 131\u2013145. Springer, New York (1995).","DOI":"10.1007\/3-540-60114-7_10"},{"key":"238_CR4","doi-asserted-by":"crossref","unstructured":"Betten A., Kerber A., Laue R., Wassermann A.: Simple 8-designs with small parameters. Des. Codes Cryptogr. 15, 5\u201327 (1998).","DOI":"10.1023\/A:1008263724078"},{"key":"238_CR5","doi-asserted-by":"crossref","unstructured":"Betten A., Laue R., Wassermann A.: A Steiner 5-design on 36 points. Des. Codes Cryptogr. 17, 181\u2013186 (1999).","DOI":"10.1023\/A:1026427226213"},{"key":"238_CR6","doi-asserted-by":"crossref","unstructured":"Bierbrauer J.: A family of 4-designs with block size 9. Discret. Math. 138, 113\u2013117 (1995).","DOI":"10.1016\/0012-365X(94)00192-L"},{"key":"238_CR7","doi-asserted-by":"crossref","unstructured":"Bierbrauer J.: A family of 4-designs. Graphs Comb. 11, 209\u2013212 (1995).","DOI":"10.1007\/BF01793006"},{"key":"238_CR8","unstructured":"Colbourn C. J., Dinitz J. H., (eds.): Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007)."},{"key":"238_CR9","doi-asserted-by":"crossref","unstructured":"Denniston R.H.F.: Some new 5-designs. Bull. Lond. Math. Soc. 8, 263\u2013267 (1976).","DOI":"10.1112\/blms\/8.3.263"},{"key":"238_CR10","unstructured":"Driessen L.H.M.E.: $$t$$ t -Designs, $$t\\ge 3$$ t \u2265 3 . Technical Report, Department of Mathematics, Technische Hogeschool Eindhoven, The Netherlands (1978)."},{"key":"238_CR11","doi-asserted-by":"crossref","unstructured":"Jimbo M., Kunihara Y., Laue R., Sawa M.: Unifying some infinite families of combinatorial 3-designs. J. Combin. Theory A 118, 1072\u20131085 (2011).","DOI":"10.1016\/j.jcta.2010.10.007"},{"key":"238_CR12","doi-asserted-by":"crossref","unstructured":"Khosrovshahi G.B., Ajoodani-Namini S.: Combining $$t$$ t -designs. J. Combin. Theory Ser. A 58, 26\u201334 (1991).","DOI":"10.1016\/0097-3165(91)90071-N"},{"key":"238_CR13","doi-asserted-by":"crossref","unstructured":"Kramer E.S., Mesner D.M.: $$t$$ t -Designs on hypergraphs. Discret. Math. 15, 263\u2013296 (1976).","DOI":"10.1016\/0012-365X(76)90030-3"},{"key":"238_CR14","unstructured":"Kramer E.S., Magliveras S.S., O\u2019Brien E.A.: Some new large sets of t-designs. Australas. J. Combin. 7, 189\u2013193 (1993)."},{"key":"238_CR15","doi-asserted-by":"crossref","unstructured":"Kreher D.L.: An infinite family of (simple) 6-designs. J. Combin. Des. 1, 277\u2013280 (1993).","DOI":"10.1002\/jcd.3180010403"},{"key":"238_CR16","unstructured":"Magliveras S.S., Leavitt D.M.: Simple 6-(33,8,36)-Designs from $$P\\Gamma L_2(32)$$ P \u0393 L 2 ( 32 ) , Computational Group Theory, pp. 337\u2013352. Academic Press, New York (1984)."},{"key":"238_CR17","doi-asserted-by":"crossref","unstructured":"Magliveras S.S., Plambeck T.E.: New infinite families of simple 5-designs. J. Combin. Theory A 44, 1\u20135 (1987).","DOI":"10.1016\/0097-3165(87)90055-0"},{"key":"238_CR18","doi-asserted-by":"crossref","unstructured":"Sebille M.: There exists a simple non-trivial $$t$$ t -design with an arbitrarily large automorphism group for every $$t$$ t . Des. Codes Cryptogr. 22, 203\u2013206 (2001).","DOI":"10.1023\/A:1008377321928"},{"key":"238_CR19","doi-asserted-by":"crossref","unstructured":"Teirlinck L.: Non-trivial $$t$$ t -designs without repeated blocks exist for all $$t$$ t . Discret. Math. 65, 301\u2013311 (1987).","DOI":"10.1016\/0012-365X(87)90061-6"},{"key":"238_CR20","doi-asserted-by":"crossref","unstructured":"Teirlinck L.: Locally trivial $$t-$$ t - designs and $$t$$ t -designs without repeated blocks. Discret. Math. 77, 345\u2013356 (1989).","DOI":"10.1016\/0012-365X(89)90372-5"},{"key":"238_CR21","doi-asserted-by":"crossref","unstructured":"Tuan N.D.: Simple non-trivial designs with an arbitrary automorphism group. J. Combin. Theory A 100, 403\u2013408 (2002).","DOI":"10.1006\/jcta.2002.3303"},{"key":"238_CR22","doi-asserted-by":"crossref","unstructured":"van Trung T.: The existence of an infinite family of simple 5-designs. Math. Z. 187, 285\u2013287 (1984).","DOI":"10.1007\/BF01161711"},{"key":"238_CR23","doi-asserted-by":"crossref","unstructured":"van Trung T.: On the construction of $$t$$ t -designs and the existence of some new infinite families of simple 5-designs. Arch. Math. 47, 187\u2013192 (1986).","DOI":"10.1007\/BF01193690"},{"key":"238_CR24","doi-asserted-by":"crossref","unstructured":"van Trung T.: Recursive constructions for 3-designs and resolvable 3-designs. J. Stat. Plan. Infer. 95, 341\u2013358 (2001).","DOI":"10.1016\/S0378-3758(00)00308-6"},{"key":"238_CR25","unstructured":"Wu Q.: A note on extending $$t$$ t -designs. Australas. J. Comb. 4, 229\u2013235 (1991)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0238-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0238-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0238-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0238-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:40:28Z","timestamp":1498311628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0238-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,2]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["238"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0238-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,7,2]]}}}