{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T01:52:47Z","timestamp":1725155567977},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:00:00Z","timestamp":1560988800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:00:00Z","timestamp":1560988800000},"content-version":"vor","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":[[2019,12]]},"DOI":"10.1007\/s10623-019-00653-6","type":"journal-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T11:02:43Z","timestamp":1561028563000},"page":"2835-2845","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Recursive constructions for s-resolvable t-designs"],"prefix":"10.1007","volume":"87","author":[{"given":"Tran","family":"van Trung","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,20]]},"reference":[{"key":"653_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcta.1996.0093","volume":"76","author":"S Ajoodani-Namini","year":"1996","unstructured":"Ajoodani-Namini S.: Extending large sets of $$t$$-designs. J. Comb. Theory A 76, 139\u2013144 (1996).","journal-title":"J. Comb. Theory A"},{"key":"653_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/S0021-9800(69)80096-7","volume":"6","author":"WO Alltop","year":"1969","unstructured":"Alltop W.O.: An infinite class of 4-designs. J. Comb. Theory A 6, 320\u2013322 (1969).","journal-title":"J. Comb. Theory A"},{"key":"653_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(76)90025-X","volume":"15","author":"RD Baker","year":"1976","unstructured":"Baker R.D.: Partitioning the planes of $$AG_{2m}(2)$$ into 2-designs. Discret. Math. 15, 205\u2013211 (1976).","journal-title":"Discret. Math."},{"key":"653_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999).","edition":"2"},{"key":"653_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF01220295","volume":"67","author":"A Betten","year":"2000","unstructured":"Betten A., Laue R., Molodtsov S., Wassermann A.: Steiner systems with automorphism groups $${PSL}(2,71)$$, $${PSL}(2,83)$$, and $${P\\Sigma L}(2,3^5)$$. J. Geom. 67, 35\u201341 (2000).","journal-title":"J. Geom."},{"key":"653_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01793006","volume":"11","author":"J Bierbrauer","year":"1995","unstructured":"Bierbrauer J.: A new family of 4-designs. Graphs Comb. 11, 209\u2013211 (1995).","journal-title":"Graphs Comb."},{"key":"653_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(94)00192-L","volume":"138","author":"J Bierbrauer","year":"1995","unstructured":"Bierbrauer J.: A family of 4-designs with block size 9. Discret. Math. 138, 113\u2013117 (1995).","journal-title":"Discret. Math."},{"key":"653_CR8","first-page":"43","volume":"36","author":"J Bierbrauer","year":"2001","unstructured":"Bierbrauer J.: Some friends of Alltop\u2019s designs $$4$$-$$(2^f+1,5,5)$$. J. Comb. Math. Comb. Comput. 36, 43\u201353 (2001).","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"653_CR9","unstructured":"Bierbrauer J., van Trung T.: Shadow and shade of designs $$4$$-$$(2^f+1,6,10)$$ (unpublished). \n                    https:\/\/www.uni-due.de\/~hx0026\/ShadowAndShade.pdf\n                    \n                  ."},{"key":"653_CR10","volume-title":"Handbook of Combinatorial Designs","year":"2007","unstructured":"Colbourn C.J., Dinitz J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. CRC Press, Boca Raton (2007).","edition":"2"},{"key":"653_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1008381018661","volume":"18","author":"CA Cusack","year":"1999","unstructured":"Cusack C.A., Magliveras S.S.: Semiregular large sets. Des. Codes Cryptogr. 18, 81\u201387 (1999).","journal-title":"Des. Codes Cryptogr."},{"key":"653_CR12","first-page":"41","volume":"10","author":"S Dautovi\u0107","year":"1999","unstructured":"Dautovi\u0107 S., Acketa D.M., Mudrinski V.: Non-isomorphic $$4$$-$$(48,5,\\lambda )$$ designs from $$\\text{ PSL }(2,47)$$. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 10, 41\u201346 (1999).","journal-title":"Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat."},{"key":"653_CR13","first-page":"207","volume":"34","author":"A Hartman","year":"1987","unstructured":"Hartman A.: Halving the complete design. Ann. Discret. Math. 34, 207\u2013224 (1987).","journal-title":"Ann. Discret. Math."},{"key":"653_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0097-3165(91)90071-N","volume":"58","author":"GB Khosrovshahi","year":"1991","unstructured":"Khosrovshahi G.B., Ajoodani-Namini S.: Combining $$t$$-designs. J. Comb. Theory A 58, 26\u201334 (1991).","journal-title":"J. Comb. Theory A"},{"key":"653_CR15","first-page":"79","volume-title":"The CRC Handbook of Combinatorial Designs","author":"GB Khosrovshahi","year":"2007","unstructured":"Khosrovshahi G.B., Laue R.: $$t$$-Designs with $$t \\ge 3$$. In: Colbourn C.J., Dinitz J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn, pp. 79\u2013101. CRC Press, Boca Raton (2007).","edition":"2"},{"key":"653_CR16","first-page":"189","volume":"7","author":"ES Kramer","year":"1993","unstructured":"Kramer E.S., Magliveras S.S., O\u2019Brien E.A.: Some new large sets of $$t$$-designs. Australas. J. Comb. 7, 189\u2013193 (1993).","journal-title":"Australas. J. Comb."},{"key":"653_CR17","first-page":"47","volume-title":"The CRC Handbook of Combinatorial Designs","author":"DL Kreher","year":"1996","unstructured":"Kreher D.L.: $$t$$-Designs, $$t \\ge 3$$. In: Colbourn C.J., Dinitz J.H. (eds.) The CRC Handbook of Combinatorial Designs, 1st edn, pp. 47\u201366. CRC Press, Boca Raton (1996).","edition":"1"},{"key":"653_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1002\/1520-6610(2001)9:1<40::AID-JCD4>3.0.CO;2-0","volume":"9","author":"R Laue","year":"2001","unstructured":"Laue R., Magliveras S.S., Wassermann A.: New large sets of $$t$$-designs. J. Comb. Des. 9, 40\u201359 (2001).","journal-title":"J. Comb. Des."},{"key":"653_CR19","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1002\/jcd.20128","volume":"15","author":"R Laue","year":"2007","unstructured":"Laue R., Omidi G.R., Tayfeh-Rezaie B., Wassermann A.: New large sets of $$t$$-designs with prescribed groups of automorphisms. J. Comb. Des. 15, 210\u2013220 (2007).","journal-title":"J. Comb. Des."},{"key":"653_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(87)90055-0","volume":"44","author":"SS Magliveras","year":"1987","unstructured":"Magliveras S.S., Plambeck T.E.: New infinite families of simple $$5$$-designs. J. Comb. Theory A 44, 1\u20135 (1987).","journal-title":"J. Comb. Theory A"},{"key":"653_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0012-365X(87)90061-6","volume":"65","author":"L Teirlinck","year":"1987","unstructured":"Teirlinck L.: Non-trivial $$t$$-designs without repeated blocks exist for all $$t$$. Discret. Math. 65, 301\u2013311 (1987).","journal-title":"Discret. Math."},{"key":"653_CR22","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0012-365X(89)90372-5","volume":"77","author":"L Teirlinck","year":"1989","unstructured":"Teirlinck L.: Locally trivial $$t$$-designs and $$t$$-designs without repeated blocks. Discret. Math. 77, 345\u2013356 (1989).","journal-title":"Discret. Math."},{"key":"653_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01388556","volume":"4","author":"L Teirlinck","year":"1994","unstructured":"Teirlinck L.: Some new 2-resolvable Steiner quadruple systems. Des. Codes Cryptogr. 4, 5\u201310 (1994).","journal-title":"Des. Codes Cryptogr."},{"key":"653_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01161711","volume":"187","author":"T van Trung","year":"1984","unstructured":"van Trung T.: On the existence of an infinite family of simple 5-designs. Math. Z. 187, 285\u2013287 (1984).","journal-title":"Math. Z."},{"key":"653_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01193690","volume":"47","author":"T van Trung","year":"1986","unstructured":"van Trung T.: On the construction of $$t$$-designs and the existence of some new infinite families of simple $$5$$-designs. Arch. Math. 47, 187\u2013192 (1986).","journal-title":"Arch. Math."},{"key":"653_CR26","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10623-016-0238-z","volume":"83","author":"T van Trung","year":"2017","unstructured":"van Trung T.: Simple $$t$$-designs: a recursive construction for arbitrary $$t$$. Des. Codes Cryptogr. 83, 493\u2013502 (2017). \n                    https:\/\/doi.org\/10.1007\/s10623-016-0238-z\n                    \n                  .","journal-title":"Des. Codes Cryptogr."},{"key":"653_CR27","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s10623-017-0389-6","volume":"86","author":"T van Trung","year":"2018","unstructured":"van Trung T.: A recursive construction for simple $$t$$-designs using resolutions. Des. Codes Cryptogr. 86, 1185\u20131200 (2018). \n                    https:\/\/doi.org\/10.1007\/s10623-017-0389-6\n                    \n                  .","journal-title":"Des. Codes Cryptogr."},{"key":"653_CR28","first-page":"229","volume":"4","author":"Q Wu","year":"1991","unstructured":"Wu Q.: A note on extending $$t$$-designs. Australas. J. Comb. 4, 229\u2013235 (1991).","journal-title":"Australas. J. Comb."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00653-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00653-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00653-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T23:15:52Z","timestamp":1592522152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00653-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,20]]},"references-count":28,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["653"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00653-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,20]]},"assertion":[{"value":"2 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}