{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:57:31Z","timestamp":1772809051486,"version":"3.50.1"},"reference-count":17,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2016]]},"DOI":"10.3934\/amc.2016022","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T11:14:28Z","timestamp":1471000468000},"page":"511-524","source":"Crossref","is-referenced-by-count":1,"title":["Construction of 3-designs using $(1,\\sigma)$-resolution"],"prefix":"10.3934","volume":"10","author":[{"given":"Tran van","family":"Trung","sequence":"first","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2016022-1","doi-asserted-by":"crossref","unstructured":"R. D. Baker, Partitioning the planes of $AG_{2m}(2)$ into 2-designs, <em>Discr. Math.<\/em>, <strong>15<\/strong> (1976) 205-211.","DOI":"10.1016\/0012-365X(76)90025-X"},{"key":"key-10.3934\/amc.2016022-2","unstructured":"Z. Baranyai, On the factorization of the complete uniform hypergraph, in <em>Proc. Erd\u00f6s-Colloquium Keszthely<\/em>, North-Holland, Amsterdam, 1973, 91-108."},{"key":"key-10.3934\/amc.2016022-3","unstructured":"T. Beth, D. Jungnickel and H. Lenz, <em>Design Theory<\/em>, Cambridge Univ. Press, Cambridge, 1986."},{"key":"key-10.3934\/amc.2016022-4","unstructured":"J. Bierbrauer, Some friends of Alltop's designs $4-(2^f+1,5,5)$, <em>J. Combin. Math. Combin. Comput.<\/em>, <strong>36<\/strong> (2001), 43-53."},{"key":"key-10.3934\/amc.2016022-5","unstructured":"J. Bierbrauer and T. van Trung, Shadow and shade of designs $4-(2^f+1,6,10)$, unpublished manuscript, 1994."},{"key":"key-10.3934\/amc.2016022-6","unstructured":"R. C. Bose, A note on the resolvability of balanced incomplete block designs, <em>Sankhy\u0101<\/em>, <strong>6<\/strong> (1942), 105-110."},{"key":"key-10.3934\/amc.2016022-7","doi-asserted-by":"publisher","unstructured":"C. J. Colbourn and J. H. Dinitz, <em>The CRC Handbook of Combinatorial Designs<\/em>, CRC Press, 1996.","DOI":"10.1201\/9781420049954"},{"key":"key-10.3934\/amc.2016022-8","unstructured":"L. H. M. E. Driessen, <em>$t$-designs, $t\\geq 3$<\/em>, Technical Report, Dep. Math., Technische Hogeschool Eindhoven, The Netherlands, 1978."},{"key":"key-10.3934\/amc.2016022-9","doi-asserted-by":"publisher","unstructured":"M. Jimbo, Y. Kunihara, R. Laue and M. Sawa, Unifying some known infinite families of combinatorial 3-designs, <em>J. Combin. Theory Ser. A<\/em>, <strong>118<\/strong> (2011), 1072-1085.","DOI":"10.1016\/j.jcta.2010.10.007"},{"key":"key-10.3934\/amc.2016022-10","doi-asserted-by":"publisher","unstructured":"D. Jungnickel and S. A. Vanstone, On resolvable designs $S_3(3;4,v)$, <em>J. Combin. Theory A<\/em>, <strong>43<\/strong> (1986), 334-337.","DOI":"10.1016\/0097-3165(86)90073-7"},{"key":"key-10.3934\/amc.2016022-11","doi-asserted-by":"publisher","unstructured":"R. Laue, Resolvable $t$-designs, <em>Des. Codes Cryptogr.<\/em>, <strong>32<\/strong> (2004), 277-301.","DOI":"10.1023\/B:DESI.0000029230.50742.8f"},{"key":"key-10.3934\/amc.2016022-12","doi-asserted-by":"publisher","unstructured":"K. T. Phelps, D. R. Stinson and S. A. Vanstone, The existence of simple $S_3(3,4,v)$, <em>Discrete Math.<\/em>, <strong>77<\/strong> (1989), 255-258.","DOI":"10.1016\/0012-365X(89)90364-6"},{"key":"key-10.3934\/amc.2016022-13","unstructured":"S. S. Shrikhande and D. Raghavarao, A method of construction of incomplete block designs, <em>Sankhy\u0101 A<\/em>, <strong>25<\/strong> (1963), 399-402."},{"key":"key-10.3934\/amc.2016022-14","doi-asserted-by":"crossref","unstructured":"S. S. Shrikhande and D. Raghavarao, Affine $\\alpha$-resolvable incomplete block designs, in <em>Contributions to Statistics<\/em>, Pergamon Press, 1963, 471-480.","DOI":"10.1016\/B978-1-4832-3160-0.50034-8"},{"key":"key-10.3934\/amc.2016022-15","doi-asserted-by":"publisher","unstructured":"D. R. Stinson, C. M. Swanson and T. van Trung, A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs, <em>Discrete Math.<\/em>, <strong>325<\/strong> (2014), 23-31.","DOI":"10.1016\/j.disc.2014.02.009"},{"key":"key-10.3934\/amc.2016022-16","doi-asserted-by":"publisher","unstructured":"T. van Trung, Recursive constructions for 3-designs and resolvable 3-designs, <em>J. Statist. Plann. Inference<\/em>, <strong>95<\/strong> (2001), 341-358.","DOI":"10.1016\/S0378-3758(00)00308-6"},{"key":"key-10.3934\/amc.2016022-17","doi-asserted-by":"publisher","unstructured":"T. van Trung, Construction of 3-designs using parallelism, <em>J. Geom.<\/em>, <strong>67<\/strong> (2000), 223-235.","DOI":"10.1007\/BF01220313"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=12780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:07:07Z","timestamp":1772791627000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2016022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016022","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}