{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:49Z","timestamp":1742914069927,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_38","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"544-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Backtrack Search for Parallelisms of Projective Spaces"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3821-4672","authenticated-orcid":false,"given":"Svetlana","family":"Topalova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9669-6916","authenticated-orcid":false,"given":"Stela","family":"Zhelezova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"38_CR1","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. Discrete Math. 15, 205\u2013211 (1976). https:\/\/doi.org\/10.1016\/0012-365X(76)90025-X","journal-title":"Discrete Math."},{"key":"38_CR2","doi-asserted-by":"publisher","unstructured":"Betten, A.: The packings of PG(3,3). Des. Codes Cryptogr. 79 (3), 583\u2013595 (2016). https:\/\/doi.org\/10.1007\/s10623-015-0074-6.","DOI":"10.1007\/s10623-015-0074-6."},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-030-21363-3_8","volume-title":"Algebraic Informatics","author":"A Betten","year":"2019","unstructured":"Betten, A., Topalova, S., Zhelezova, S.: Parallelisms of $$\\rm PG(3,4)$$ invariant under cyclic groups of order 4. In: \u0106iri\u0107, M., Droste, M., Pin, J.\u00c9. (eds.) CAI 2019. LNCS, vol. 11545, pp. 88\u201399. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21363-3_8"},{"key":"38_CR4","doi-asserted-by":"publisher","unstructured":"Betten, A., Topalova, S., Zhelezova, S.: New uniform subregular parallelisms of PG(3,4) invariant under an automorphism of order 2. Cybern. Inf. Technol. 20(6), 18\u201327 (2020). https:\/\/doi.org\/10.2478\/cait-2020-0057","DOI":"10.2478\/cait-2020-0057"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF00181359","volume":"3","author":"A Beutelspacher","year":"1974","unstructured":"Beutelspacher, A.: On parallelisms in finite projective spaces. Geom. Dedicata. 3(1), 35\u201340 (1974). https:\/\/doi.org\/10.1007\/BF00181359","journal-title":"Geom. Dedicata."},{"issue":"1","key":"38_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.2140\/iig.2006.3.33","volume":"3","author":"M Braun","year":"2006","unstructured":"Braun, M.: Construction of a point-cyclic resolution in $$PG(9,2)$$. Innov. Incid. Geom. Algebr. Topol. Comb. 3(1), 33\u201350 (2006). https:\/\/doi.org\/10.2140\/iig.2006.3.33","journal-title":"Innov. Incid. Geom. Algebr. Topol. Comb."},{"key":"38_CR7","unstructured":"Denniston, R. H. F.: Some packings of projective spaces. Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. 52(8), 36\u201340 (1972)"},{"issue":"2","key":"38_CR8","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1109\/ISIT.2011.6033969","volume":"59","author":"T Etzion","year":"2013","unstructured":"Etzion, T., Silberstein, N.: Codes and designs related to lifted MRD codes. IEEE Trans. Inform. Theory 59(2), 1004\u20131017 (2013). https:\/\/doi.org\/10.1109\/ISIT.2011.6033969","journal-title":"IEEE Trans. Inform. Theory"},{"key":"38_CR9","first-page":"163","volume":"21","author":"R Fuji-Hara","year":"1986","unstructured":"Fuji-Hara, R.: Mutually 2-orthogonal resolutions of finite projective space. Ars Combin. 21, 163\u2013166 (1986)","journal-title":"Ars Combin."},{"key":"38_CR10","unstructured":"Farad\u017eev, I. A.: Constructive enumeration of combinatorial objects. In Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, (Universit\u00e9 d\u2019Orsay, July 9\u201313, 1977). Colloq. Internat. du C.N.R.S., vol. 260, pp. 131\u2013135, CNRS, Paris (1978)"},{"issue":"9","key":"38_CR11","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":"38_CR12","doi-asserted-by":"publisher","unstructured":"Johnson, N.L.: Some new classes of finite parallelisms, Note Mat. 20(2), 77\u201388 (2000). https:\/\/doi.org\/10.1285\/i15900932v20n2p77","DOI":"10.1285\/i15900932v20n2p77"},{"key":"38_CR13","series-title":"Pure and Applied MathematicsPure and Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1201\/EBK1439819463","volume-title":"Combinatorics of Spreads and Parallelisms","author":"NL Johnson","year":"2010","unstructured":"Johnson, N.L.: Combinatorics of Spreads and Parallelisms. Pure and Applied MathematicsPure and Applied Mathematics, Chapman & Hall. CRC Press, Boca Raton (2010)"},{"key":"38_CR14","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28991-7","volume-title":"Classification algorithms for codes and designs","author":"P Kaski","year":"2006","unstructured":"Kaski, P., \u00d6sterg\u00e5rd, P.: Classification algorithms for codes and designs. Algorithms and Computation in Mathematics, vol. 15. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-28991-7"},{"issue":"6","key":"38_CR15","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1006\/eujc.1998.0239","volume":"19","author":"T Penttila","year":"1998","unstructured":"Penttila, T., Williams, B.: Regular packings of $$PG(3, q)$$. Eur. J. Comb. 19(6), 713\u2013720 (1998)","journal-title":"Eur. J. Comb."},{"key":"38_CR16","series-title":"Lecture Notes in Pure and Applied Mathematics","first-page":"383","volume-title":"Mostly Finite Geometries","author":"AR Prince","year":"1997","unstructured":"Prince, A.R.: Parallelisms of $$PG(3,3)$$ invariant under a collineation of order 5. In: Johnson, N.L. (ed.) Mostly Finite Geometries. Lecture Notes in Pure and Applied Mathematics, vol. 190, pp. 383\u2013390. Marcel Dekker, New York (1997)"},{"key":"38_CR17","doi-asserted-by":"publisher","unstructured":"Prince, A.R.: Uniform parallelisms of PG(3,3). In: Hirschfeld, J., Magliveras, S., Resmini, M. (eds.) Geometry, Combinatorial Designs and Related Structures, London Mathematical Society Lecture Note Series, vol. 245, pp. 193\u2013200. Cambridge University Press, Cambridge (1997). https:\/\/doi.org\/10.1017\/CBO9780511526114.017","DOI":"10.1017\/CBO9780511526114.017"},{"issue":"5","key":"38_CR18","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1006\/eujc.1997.0204","volume":"19","author":"AR Prince","year":"1998","unstructured":"Prince, A.R.: The cyclic parallelisms of $$PG(3,5)$$. Eur. J. Comb. 19(5), 613\u2013616 (1998)","journal-title":"Eur. J. Comb."},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"RC Read","year":"1978","unstructured":"Read, R.C.: Every one a winner; or, how to avoid isomorphism search when cataloguing combinatorial configurations. Ann. Discrete Math. 2, 107\u2013120 (1978). https:\/\/doi.org\/10.1016\/S0167-5060(08)70325-X","journal-title":"Ann. Discrete Math."},{"key":"38_CR20","doi-asserted-by":"publisher","unstructured":"Sarmiento, J.: Resolutions of $$PG(5,2)$$ with point-cyclic automorphism group. J. Comb. Des. 8(1), 2\u201314 (2000). https:\/\/doi.org\/10.1002\/(SICI)1520-6610(2000)8:1<2::AID-JCD2>3.0.CO;2-H","DOI":"10.1002\/(SICI)1520-6610(2000)8:1<2::AID-JCD2>3.0.CO;2-H"},{"key":"38_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/b97564","volume-title":"Combinatorial Designs: Constructions and Analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson, D.R.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2004). https:\/\/doi.org\/10.1007\/b97564"},{"issue":"1","key":"38_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02188184","volume":"31","author":"DR Stinson","year":"1986","unstructured":"Stinson, D.R., Vanstone, S.A.: Orthogonal packings in $$PG(5,2)$$. Aequationes Math. 31(1), 159\u2013168 (1986). https:\/\/doi.org\/10.1007\/BF02188184","journal-title":"Aequationes Math."},{"key":"38_CR23","unstructured":"Storme, L.: Finite Geometry. In: Colbourn, C., Dinitz, J. (eds.) Handbook of Combinatorial Designs. 2nd edn. Rosen, K. (eds.) Discrete mathematics and its applications, pp. 702\u2013729. CRC Press, Boca Raton (2007)"},{"issue":"3\u20134","key":"38_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00200-013-0194-z","volume":"24","author":"S Topalova","year":"2013","unstructured":"Topalova, S., Zhelezova, S.: On transitive parallelisms of $$PG(3,4)$$. Appl. Algebra Engrg. Comm. Comput. 24(3\u20134), 159\u2013164 (2013). https:\/\/doi.org\/10.1007\/s00200-013-0194-z","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"1","key":"38_CR25","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10623-013-9887-3","volume":"75","author":"S Topalova","year":"2013","unstructured":"Topalova, S., Zhelezova, S.: On point-transitive and transitive deficiency one parallelisms of  PG$$(3,4)$$. Designs, Codes Cryptogr. 75(1), 9\u201319 (2013). https:\/\/doi.org\/10.1007\/s10623-013-9887-3","journal-title":"Designs, Codes Cryptogr."},{"key":"38_CR26","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jcd.21526","volume":"24","author":"S Topalova","year":"2016","unstructured":"Topalova, S., Zhelezova, S.: New Regular Parallelisms of $$PG(3,5)$$. J. Comb. Des. 24, 473\u2013482 (2016). https:\/\/doi.org\/10.1002\/jcd.21526","journal-title":"J. Comb. Des."},{"key":"38_CR27","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.endm.2017.02.032","volume":"57","author":"S Topalova","year":"2017","unstructured":"Topalova, S., Zhelezova, S.: New parallelisms of $$PG(3,4)$$. Electron. Notes Discrete Math. 57, 193\u2013198 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.02.032","journal-title":"Electron. Notes Discrete Math."},{"key":"38_CR28","doi-asserted-by":"publisher","unstructured":"Topalova, S., Zhelezova, S.: Types of spreads and duality of the parallelisms of PG(3,5) with automorphisms of order 13. Des. Codes Cryptogr. 87 (2\u20133), 495\u2013507 (2019). https:\/\/doi.org\/10.1007\/s10623-018-0558-2","DOI":"10.1007\/s10623-018-0558-2"},{"key":"38_CR29","doi-asserted-by":"publisher","unstructured":"Topalova, S., Zhelezova, S.: Isomorphism and invariants of parallelisms of projective spaces. In: Bigatti, A., Carette, J., Davenport, J., Joswig, M., De Wolff, T. (eds.), Mathematical Software - ICMS 2020, Lecture Notes in Computer Science, vol. 12097, pp. 162\u2013172, Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52200-1_16","DOI":"10.1007\/978-3-030-52200-1_16"},{"key":"38_CR30","doi-asserted-by":"publisher","unstructured":"Topalova, S., Zhelezova, S.: Some parallelisms of PG(3,5) involving a definite type of spread. In: 2020 Algebraic and Combinatorial Coding Theory (ACCT), pp. 135\u2013139 (2020). https:\/\/doi.org\/10.1109\/ACCT51235.2020.9383404","DOI":"10.1109\/ACCT51235.2020.9383404"},{"key":"38_CR31","unstructured":"Zaicev, G., Zinoviev, V., Semakov, N.: Interrelation of Preparata and Hamming codes and extension of Hamming codes to new double-error-correcting codes. In: Proceedings of Second International Symposium on Information Theory, (Armenia, USSR, 1971), Budapest, Academiai Kiado, pp. 257\u2013263 (1973)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:15:10Z","timestamp":1625008510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}