{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T23:04:40Z","timestamp":1783897480963,"version":"3.55.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032222206","type":"print"},{"value":"9783032222213","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22221-3_48","type":"book-chapter","created":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:24:07Z","timestamp":1783895047000},"page":"435-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Kirkman Triple Systems of\u00a0Order 45"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3821-4672","authenticated-orcid":false,"given":"Svetlana","family":"Topalova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9669-6916","authenticated-orcid":false,"given":"Stela","family":"Zhelezova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"issue":"1\u20132","key":"48_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(99)00228-0","volume":"102","author":"YM Chee","year":"2000","unstructured":"Chee, Y.M., Colbourn, C.J., Ling, A.C.H.: Asymptotically optimal erasure-resilient codes for large disk arrays. Discrete Appl. Math. 102(1\u20132), 3\u201336 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00228-0","journal-title":"Discrete Appl. Math."},{"key":"48_CR2","volume-title":"Handbook of Combinatorial Designs","year":"2007","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall\/CRC, Boca Raton (2007)","edition":"2"},{"key":"48_CR3","doi-asserted-by":"publisher","unstructured":"Colbourn, M. J., Mathon, R. A.: On cyclic steiner 2-designs. In: Lindner, C.C., Rosa, A. (eds.), Annals of Discrete Math., vol. 7, Topics on Steiner Systems, pp. 215-253. Elsevier, Amsterdam (1980). https:\/\/doi.org\/10.1016\/S0167-5060(08)70182-1","DOI":"10.1016\/S0167-5060(08)70182-1"},{"issue":"197","key":"48_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.2307\/2153046","volume":"58","author":"CJ Colbourn","year":"1992","unstructured":"Colbourn, C.J., Magliveras, S.S., Mathon, R.A.: Transitive Steiner and Kirkman triple systems of order 27. Math. Comput. 58(197), 441\u2013449 (1992). https:\/\/doi.org\/10.2307\/2153046","journal-title":"Math. Comput."},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02986668","volume":"10","author":"CJ Colbourn","year":"1994","unstructured":"Colbourn, C.J., Mendelsohn, E., Rosa, A., Siran, J.: Anti-Mitre Steiner Triple Systems. Graph. Combinator. 10, 215\u2013224 (1994). https:\/\/doi.org\/10.1007\/BF02986668","journal-title":"Graph. Combinator."},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1090\/S0002-9904-1922-03599-9","volume":"28","author":"FN Cole","year":"1922","unstructured":"Cole, F.N.: Kirkman Parades. Bull. Amer. Math. Soc. 28, 435\u2013437 (1922). https:\/\/doi.org\/10.1090\/S0002-9904-1922-03599-9","journal-title":"Bull. Amer. Math. Soc."},{"issue":"8","key":"48_CR7","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1002\/jcd.21844","volume":"30","author":"PJ Dukes","year":"2022","unstructured":"Dukes, P.J., Lamken, E.R.: An update on the existence of Kirkman triple systems with Steiner triple systems as subdesigns. J. Comb. Des. 30(8), 581\u2013608 (2022). https:\/\/doi.org\/10.1002\/jcd.21844","journal-title":"J. Comb. Des."},{"issue":"9","key":"48_CR8","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1109\/TCOMM.2012.070912.110164","volume":"60","author":"A Gruner","year":"2012","unstructured":"Gruner, A., Huber, M.: New combinatorial construction techniques for low-density parity-check codes and systematic repeat-accumulate codes. IEEE Trans. Commun. 60(9), 2387\u20132395 (2012). https:\/\/doi.org\/10.1109\/TCOMM.2012.070912.110164","journal-title":"IEEE Trans. Commun."},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, N.L.: Combinatorics of Spreads and Parallelisms. Series: Chapman & Hall Pure and Applied Mathematics. CRC Press (2010)","DOI":"10.1201\/EBK1439819463"},{"issue":"9","key":"48_CR10","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1109\/LWC.2022.3190026","volume":"11","author":"J Kim","year":"2022","unstructured":"Kim, J., Kim, C., Park, H., No, J.-S.: Design of Protograph LDPC codes using resolvable block designs for block fading channel. IEEE Wireless Commun. Lett. 11(9), 1970\u20131974 (2022). https:\/\/doi.org\/10.1109\/LWC.2022.3190026","journal-title":"IEEE Wireless Commun. Lett."},{"key":"48_CR11","doi-asserted-by":"publisher","unstructured":"Kokkala, J. I., \u00d6sterg\u00e5rd, P. R.J.: Kirkman triple systems with subsystems. Dis. Math. 343(9), article: 1111960 (2020). https:\/\/doi.org\/10.1016\/j.disc.2020.111960","DOI":"10.1016\/j.disc.2020.111960"},{"issue":"1\u20133","key":"48_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0012-365X(99)00374-X","volume":"219","author":"CWH Lam","year":"2000","unstructured":"Lam, C.W.H., Miao, Y.: Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. Discrete Math. 219(1\u20133), 173\u2013185 (2000). https:\/\/doi.org\/10.1016\/S0012-365X(99)00374-X","journal-title":"Discrete Math."},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.2307\/2007514","volume":"37","author":"RA Mathon","year":"1981","unstructured":"Mathon, R.A., Phelps, K.T., Rosa, A.: A class of Steiner triple systems of order 21 and associated Kirkman systems. Math. Comput. 37, 209\u2013222 (1981). https:\/\/doi.org\/10.2307\/2007514","journal-title":"Math. Comput."},{"key":"48_CR14","doi-asserted-by":"publisher","unstructured":"Ray-Chaudhuri, D. K., Wilson, R. M.: Solution of Kirkman\u2019s school-girl problem. In: Motzkin, T. S. (eds.) Proc. Sympos. Pure Math., vol. 19, pp. 187\u2013203. Amer. Math. Soc., Providence, R.I. (1971). https:\/\/doi.org\/10.1090\/pspum\/019","DOI":"10.1090\/pspum\/019"},{"key":"48_CR15","unstructured":"Semakov, N. V., Zinovev, V. A.: Equidistant q-ary codes with maximal distance and resolvable balanced incomplete block designs (in Russian). Problemy Peredachi Informatsii 4, 3\u201310 (1968). English translation in Problems Inform. Transmission 4, 1\u20137 (1968). https:\/\/www.mathnet.ru\/eng\/ppi1845"},{"issue":"1\u20133","key":"48_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0012-365X(91)90294-C","volume":"92","author":"DR Stinson","year":"1991","unstructured":"Stinson, D.R.: A survey of Kirkman triple systems and related designs. Discrete Math. 92(1\u20133), 371\u2013393 (1991). https:\/\/doi.org\/10.1016\/0012-365X(91)90294-C","journal-title":"Discrete Math."},{"issue":"107","key":"48_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0012-365X(92)90581-Y","volume":"106","author":"VD Tonchev","year":"1992","unstructured":"Tonchev, V.D., Vanstone, S.A.: On Kirkman triple systems of order 33. Dis. Math. 106(107), 493\u2013496 (1992). https:\/\/doi.org\/10.1016\/0012-365X(92)90581-Y","journal-title":"Dis. Math."},{"key":"48_CR18","doi-asserted-by":"publisher","unstructured":"Topalova, S., Zhelezova, S.: Point-cyclic KTS(45). In: Lilkova, E., Datcheva, M., Alexandrova, T. (eds.) Advanced Computing in Industrial Mathematics. Springer, Berlin (2023). https:\/\/doi.org\/10.1007\/978-3-031-96311-7_22","DOI":"10.1007\/978-3-031-96311-7_22"},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/TIT.2004.828066","volume":"50","author":"B Vasic","year":"2004","unstructured":"Vasic, B., Milenkovic, O.: Combinatorial constructions of low-density parity-check codes for iterative decoding. IEEE Trans. Inform. Theory 50, 1156\u20131176 (2004). https:\/\/doi.org\/10.1109\/TIT.2004.828066","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22221-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:24:08Z","timestamp":1783895048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22221-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032222206","9783032222213"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22221-3_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"3 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"LSSC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Large-Scale Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sozopol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lssc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parallel.bas.bg\/Conferences\/SciCom25\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}