{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:12Z","timestamp":1740122592397,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:00:00Z","timestamp":1653696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:00:00Z","timestamp":1653696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["6732","5713"],"award-info":[{"award-number":["6732","5713"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10623-022-01059-7","type":"journal-article","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T14:03:32Z","timestamp":1653746612000},"page":"1585-1593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Switching for 2-designs"],"prefix":"10.1007","volume":"90","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6558-5167","authenticated-orcid":false,"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"1059_CR1","doi-asserted-by":"publisher","first-page":"2850","DOI":"10.1016\/j.disc.2018.11.022","volume":"342","author":"A Abiad","year":"2019","unstructured":"Abiad A., Butler S., Haemers W.H.: Graph switching, 2-ranks, and graphical Hadamard matrices. Discret. Math. 342, 2850\u20132855 (2019).","journal-title":"Discret. Math."},{"key":"1059_CR2","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1016\/j.jcta.2012.03.013","volume":"119","author":"M Behbahani","year":"2012","unstructured":"Behbahani M., Lam C., \u00d6sterg\u00e5rd P.R.J.: On triple systems and strongly regular graphs. J. Comb. Theory Ser. A 119, 1414\u20131426 (2012).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1059_CR3","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":"1059_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-1-4613-0245-2_3","volume-title":"Designs 2002: Further Computational and Constructive Design Theory","author":"EJ Billington","year":"2003","unstructured":"Billington E.J.: Combinatorial trades: a survey of recent results. In: Wallis W.D. (ed.) Designs 2002: Further Computational and Constructive Design Theory, pp. 47\u201367. Kluwer, Boston (2003)."},{"key":"1059_CR5","unstructured":"Bosma W., Cannon J.: Handbook of Magma Functions, Department of Mathematics, University of Sydney (1994). http:\/\/magma.maths.usyd.edu.au\/magma."},{"key":"1059_CR6","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1016\/j.ffa.2006.10.001","volume":"13","author":"D Crnkovi\u0107","year":"2007","unstructured":"Crnkovi\u0107 D.: A series of Menon designs and 1-rotational designs. Finite Fields Appl. 13, 1001\u20131005 (2007).","journal-title":"Finite Fields Appl."},{"key":"1059_CR7","first-page":"155","volume":"47","author":"D Crnkovi\u0107","year":"2003","unstructured":"Crnkovi\u0107 D., Held D.: Some new Bush-type Hadamard matrices of order 100 and infinite classes of symmetric designs. J. Comb. Math. Comb. Comput. 47, 155\u2013164 (2003).","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1059_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0012-365X(00)00364-2","volume":"237","author":"D Crnkovi\u0107","year":"2001","unstructured":"Crnkovi\u0107 D., Pav\u010devi\u0107 M.-O.: Some new symmetric designs with parameters (64,28,12). Discret. Math. 237, 109\u2013118 (2001).","journal-title":"Discret. Math."},{"key":"1059_CR9","doi-asserted-by":"crossref","unstructured":"Dillon J.F.: A survey of difference sets in 2-groups. In: Proceedings of the Marshall Hall Memorial Conference, Burlington (1990).","DOI":"10.1090\/conm\/111\/1079738"},{"key":"1059_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1520-6610(1998)6:3<213::AID-JCD3>3.0.CO;2-I","volume":"6","author":"Y Ding","year":"1998","unstructured":"Ding Y., Houghten S., Lam C., Smith S., Thiel L., Tonchev V.D.: Quasi-symmetric 2-(28,12,11) designs with an automorphism of order 7. J. Comb. Des. 6, 213\u2013223 (1998).","journal-title":"J. Comb. Des."},{"key":"1059_CR11","doi-asserted-by":"crossref","unstructured":"Denniston R.H.F.: Enumeration of symmetric designs (25,9,3). In: Algebraic and Geometric Combinatorics. North-Holland Mathematics Studies, vol. 65, pp. 111\u2013127. North-Holland, Amsterdam (1982).","DOI":"10.1016\/S0304-0208(08)73258-4"},{"key":"1059_CR12","unstructured":"Gibbons P.B.: Computing techniques for the construction and analysis of block designs, Techn. Rept. # 92, Department of Computer Science, University of Toronto, vol. 92 (1976)."},{"key":"1059_CR13","first-page":"299","volume-title":"Encyclopaedia of Mathematic, Supplement III","author":"MJ Grannell","year":"2001","unstructured":"Grannell M.J., Griggs T.S.: Pasch configuration. In: Hazewinkel M. (ed.) Encyclopaedia of Mathematic, Supplement III, pp. 299\u2013300. Kluwer Academic Publishers, Amsterdam (2001)."},{"key":"1059_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02189621","volume":"25","author":"CD Godsil","year":"1982","unstructured":"Godsil C.D., McKay B.D.: Constructing cospectral graphs. Aequationes Math. 25, 257\u2013268 (1982).","journal-title":"Aequationes Math."},{"key":"1059_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.32917\/hmj\/1206137446","volume":"3","author":"N Hamada","year":"1973","unstructured":"Hamada N.: On the $$p$$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and it applications to error correcting codes. Hiroshima Math. J. 3, 153\u2013226 (1973).","journal-title":"Hiroshima Math. J."},{"key":"1059_CR16","first-page":"644","volume-title":"Handbook of Combinatorial Designs","author":"AS Hedayat","year":"2007","unstructured":"Hedayat A.S., Khosrovshahi G.B.: Trades. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 644\u2013648. Chapman & Hall, CRC, Boca Raton (2007).","edition":"2"},{"key":"1059_CR17","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jcta.2000.3166","volume":"95","author":"Z Janko","year":"2001","unstructured":"Janko Z.: The existence of a Bush-type Hadamard matrix of order 36 and two new infinite classes of symmetric designs. J. Comb. Theory Ser. A 95, 360\u2013364 (2001).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1059_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1006\/jcta.2001.3231","volume":"98","author":"Z Janko","year":"2002","unstructured":"Janko Z., Kharaghani H.: A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs. J. Comb. Theory Ser. A 98, 118\u2013126 (2002).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1059_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1002\/1520-6610(2001)9:1<72::AID-JCD6>3.0.CO;2-M","volume":"9","author":"Z Janko","year":"2001","unstructured":"Janko Z., Kharaghani H., Tonchev V.D.: Bush-type Hadamard matrices and symmetric designs. J. Comb. Des. 9, 72\u201378 (2001).","journal-title":"J. Comb. Des."},{"key":"1059_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1011212922844","volume":"24","author":"Z Janko","year":"2001","unstructured":"Janko Z., Kharaghani H., Tonchev V.D.: The existence of a Bush-type Hadamard matrix of order 324 and two new infinite classes of symmetric designs. Des. Codes Cryptogr. 24, 225\u2013232 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"1059_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00123764","volume":"1","author":"D Jungnickel","year":"1991","unstructured":"Jungnickel D., Tonchev V.D.: Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound. Des. Codes Cryptogr. 1, 247\u2013253 (1991).","journal-title":"Des. Codes Cryptogr."},{"key":"1059_CR22","first-page":"R1","volume":"7","author":"H Kharaghani","year":"2000","unstructured":"Kharaghani H.: On the twin designs with the Ionin-type parameters. Electron. J. Comb. 7, R1 (2000).","journal-title":"Electron. J. Comb."},{"key":"1059_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(93)90012-W","volume":"63","author":"RG Kraemer","year":"1994","unstructured":"Kraemer R.G.: Proof of a conjecture on Hadamard 2-groups. J. Comb. Theory Ser. A 63, 1\u201310 (1994).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1059_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01388503","volume":"5","author":"C Lam","year":"1995","unstructured":"Lam C., Thiel L., Tonchev V.D.: On Quasi-symmetric 2-(28,12,11) and 2-(36,16,12) designs. Des. Codes Cryptogr. 5, 43\u201355 (1995).","journal-title":"Des. Codes Cryptogr."},{"key":"1059_CR25","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1090\/S0002-9939-06-08229-3","volume":"134","author":"M Muzychuk","year":"2006","unstructured":"Muzychuk M., Xiang Q.: Bush-type Hadamard matrices of order $$4m^4$$ exist for all odd $$m$$. Proc. Am. Math. Soc. 134, 2197\u20132204 (2006).","journal-title":"Proc. Am. Math. Soc."},{"key":"1059_CR26","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1111\/j.1469-1809.1939.tb02214.x","volume":"9","author":"HW Norton","year":"1939","unstructured":"Norton H.W.: The $$7 \\times 7$$ squares. Ann. Eugenics 9, 269\u2013307 (1939).","journal-title":"Ann. Eugenics"},{"key":"1059_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/050641727","volume":"22","author":"WP Orrick","year":"2008","unstructured":"Orrick W.P.: Switching operations for Hadamard matrices. SIAM J. Discret. Math. 22, 31\u201350 (2008).","journal-title":"SIAM J. Discret. Math."},{"key":"1059_CR28","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.disc.2011.05.016","volume":"312","author":"PRJ \u00d6sterg\u00e5rd","year":"2012","unstructured":"\u00d6sterg\u00e5rd P.R.J.: Switching codes and designs. Discret. Math. 312, 621\u2013632 (2012).","journal-title":"Discret. Math."},{"key":"1059_CR29","doi-asserted-by":"crossref","unstructured":"Parker E.T.:Computer investigation of orthogonal Latin squares of order ten. In: Proceedings of the Symposium Applied Mathematics, vol. XV, pp. 73\u201381. American Mathematical Society, Providence (1963).","DOI":"10.1090\/psapm\/015\/0180910"},{"key":"1059_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(94)90002-7","volume":"67","author":"C Parker","year":"1994","unstructured":"Parker C., Spence E., Tonchev V.D.: Designs with the symmetric difference property on 64 points and their groups. J. Comb. Theory Ser. A 67, 23\u201343 (1994).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1059_CR31","unstructured":"Seidel J.J.: Graphs and two-graphs. In: Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic University, Boca Raton, FL, 1974), Congressus Numerantium X, Utilitas Math., Winnipeg, Man., pp. 125\u2013143 (1974)."},{"key":"1059_CR32","doi-asserted-by":"crossref","unstructured":"Wallis W.D., Street A.P., Wallis J.S.: Combinatorics: Room Squares. Hadamard Matrices. Sum-Free Sets. Springer, Berlin (1972).","DOI":"10.1007\/BFb0069907"},{"key":"1059_CR33","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00373-004-0567-7","volume":"20","author":"IM Wanless","year":"2004","unstructured":"Wanless I.M.: Cycle switches in Latin squares. Graphs Comb. 20, 545\u2013570 (2004).","journal-title":"Graphs Comb."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01059-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01059-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01059-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T15:17:09Z","timestamp":1657293429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01059-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,28]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1059"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01059-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,5,28]]},"assertion":[{"value":"22 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}