{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T04:23:48Z","timestamp":1785212628793,"version":"3.55.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T00:00:00Z","timestamp":1678406400000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10623-023-01200-0","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T21:44:36Z","timestamp":1679867076000},"page":"2309-2322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Diagonal cellular factor pair Latin squares"],"prefix":"10.1007","volume":"91","author":[{"given":"James","family":"Hammer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0034-6450","authenticated-orcid":false,"given":"John","family":"Lorch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,10]]},"reference":[{"issue":"5","key":"1200_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1080\/00029890.2008.11920542","volume":"115","author":"R Bailey","year":"2008","unstructured":"Bailey R., Cameron P., Connelly R.: Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes. Am. Math. Mon. 115(5), 383\u2013404 (2008).","journal-title":"Am. Math. Mon."},{"key":"1200_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.laa.2016.02.017","volume":"497","author":"R Bremigan","year":"2016","unstructured":"Bremigan R., Lorch J.: Mutually orthogonal rectangular gerechte designs. Linear Algebra Appl. 497, 44\u201361 (2016).","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"1200_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111762","volume":"343","author":"B Carrigan","year":"2020","unstructured":"Carrigan B., Hammer J., Lorch J.: A regional Kronecker product and multiple-pair Latin squares. Discret. Math. 343(3), 111762 (2020).","journal-title":"Discret. Math."},{"key":"1200_CR4","volume-title":"The Handbook of Combinatorial Designs","year":"2007","unstructured":"Colbourn C., Dinitz J. (eds.): The Handbook of Combinatorial Designs, 2nd edn CRC Press, Boca Raton (2007).","edition":"2"},{"key":"1200_CR5","volume-title":"Latin Squares and Their Applications","author":"J D\u00e9nes","year":"2015","unstructured":"D\u00e9nes J., Keedwell A.D.: Latin Squares and Their Applications, 2nd edn North Holland, Amsterdam (2015).","edition":"2"},{"key":"1200_CR6","volume-title":"Abstract Algebra","author":"D Dummit","year":"1999","unstructured":"Dummit D., Foote R.: Abstract Algebra, 2nd edn Prentice Hall, Upper Saddle River (1999).","edition":"2"},{"key":"1200_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-018-0487-0","volume":"87","author":"J Ethier","year":"2019","unstructured":"Ethier J., Mullen G.: Sets of mutually orthogonal frequency squares. Des. Codes Cryptogr. 87, 57\u201365 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1200_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-022-01097-1","volume":"91","author":"M Gadouleau","year":"2023","unstructured":"Gadouleau M., Mariot L., Picek S.: Bent functions in the partial spread class generated by linear recurring sequences. Des. Codes Cryptogr. 91, 63\u201382 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1200_CR9","first-page":"41","volume":"69","author":"J Hammer","year":"2017","unstructured":"Hammer J., Hoffman D.: Factor pair Latin Squares. Australas. J. Comb. 69, 41\u201357 (2017).","journal-title":"Australas. J. Comb."},{"issue":"9","key":"1200_CR10","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1002\/jcd.21662","volume":"27","author":"J Hammer","year":"2019","unstructured":"Hammer J., Lorch J.: Orthogonal factor-pair Latin squares of prime-power order. J. Comb. Des. 27(9), 552\u2013561 (2019).","journal-title":"J. Comb. Des."},{"key":"1200_CR11","first-page":"52","volume":"50","author":"AD Keedwell","year":"2007","unstructured":"Keedwell A.D.: On sudoku squares. Bull. Inst. Comb. Appl. 50, 52\u201360 (2007).","journal-title":"Bull. Inst. Comb. Appl."},{"key":"1200_CR12","first-page":"227","volume":"47","author":"AD Keedwell","year":"2010","unstructured":"Keedwell A.D.: Constructions of complete sets of orthogonal diagonal Sudoku squares. Australas. J. Comb. 47, 227\u2013238 (2010).","journal-title":"Australas. J. Comb."},{"key":"1200_CR13","first-page":"271","volume":"51","author":"AD Keedwell","year":"2011","unstructured":"Keedwell A.D.: A short note regarding the existence of complete sets of orthogonal diagonal Sudoku squares. Australas. J. Comb. 51, 271\u2013273 (2011).","journal-title":"Australas. J. Comb."},{"key":"1200_CR14","unstructured":"Lidl R., Niederreiter H.: Finite fields. In: Encyclopedia of Mathematics and Its Applications, vol. 20, 2nd edn. Cambridge University Press, Cambridge (1997)."},{"key":"1200_CR15","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10623-019-00689-8","volume":"88","author":"L Mariot","year":"2020","unstructured":"Mariot L., Gadouleau M., Formenti E., Leporati A.: Mutually orthogonal Latin squares based on cellular automata. Des. Codes Cryptogr. 88, 391\u2013411 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1200_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"R McEliece","year":"1987","unstructured":"McEliece R.: Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, Boston (1987)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01200-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01200-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01200-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T16:13:24Z","timestamp":1685031204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01200-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,10]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1200"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01200-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,10]]},"assertion":[{"value":"18 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}