{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T21:22:22Z","timestamp":1711574542503},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T00:00:00Z","timestamp":1456704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10623-016-0190-y","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T01:48:40Z","timestamp":1456710520000},"page":"675-693","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Sudoku-like arrays, codes and orthogonality"],"prefix":"10.1007","volume":"82","author":[{"given":"M.","family":"Huggan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. L.","family":"Mullen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Stevens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Thomson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,29]]},"reference":[{"key":"190_CR1","doi-asserted-by":"crossref","unstructured":"Bailey R.A., Cameron P., Connelly R.: Sudoku. Gerechte designs, resolutions, affine space, spreads, reguli and Hamming codes. Am. Math. Monthly 115, 383\u2013404 (2008).","DOI":"10.1080\/00029890.2008.11920542"},{"key":"190_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Yahalom E., Etzion T.: Intersection of isomorphic linear codes. J. Comb. Theory Ser. A 80, 247\u2013256 (1997).","DOI":"10.1006\/jcta.1997.2805"},{"key":"190_CR3","unstructured":"Beutelspacher A., Rosenbaum U.: Projective Geometry: From Foundations to Applications. Cambridge University Press, Cambridge (1998)."},{"key":"190_CR4","unstructured":"Bose R.C.: Mathematical theory of the symmetrical factorial design. Sankhy\u00e4 8, 107\u2013166 (1947)."},{"key":"190_CR5","doi-asserted-by":"crossref","unstructured":"Chao J.M., Kaneta H.: Classical arcs in $$\\text{ PG }(r, q)$$ PG ( r , q ) for $$11 \\le q \\le 19$$ 11 \u2264 q \u2264 19 . Discret. Math. 174, 87\u201394 (1997).","DOI":"10.1016\/S0012-365X(96)00319-6"},{"key":"190_CR6","doi-asserted-by":"crossref","unstructured":"Chao J.M., Kaneta H.: Classical arcs in $$\\text{ PG }(r, q)$$ PG ( r , q ) for $$23 \\le q \\le 29$$ 23 \u2264 q \u2264 29 . Discret. Math. 226, 377\u2013385 (2001).","DOI":"10.1016\/S0012-365X(00)00169-2"},{"key":"190_CR7","doi-asserted-by":"crossref","unstructured":"Donovan D., Haaland B., Nott D.J.: A Simple Approach to Constructing Quasi-Sudoku-based Sliced Space-Filling Designs, p. 15. arXiv:1502.05522 (2015).","DOI":"10.1007\/s10463-016-0565-x"},{"key":"190_CR8","doi-asserted-by":"crossref","unstructured":"Ethier J.T., Mullen G.L., Panario D., Stevens B., Thomson D.: Sets of orthogonal hypercubes of class $$r$$ r . J. Comb. Theory (Ser. A) 119, 430\u2013439 (2012).","DOI":"10.1016\/j.jcta.2011.10.001"},{"key":"190_CR9","unstructured":"Hamner, III J.M.: Taking Sudoku puzzles a step further: an existential problem (research talk). In: Forty-Sixth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL (2015)."},{"key":"190_CR10","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"190_CR11","unstructured":"Kishen K.: On the construction of Latin and hyper-Graeco-Latin cubes and hypercubes. J. Indian Soc. Agric. Stat. 2, 20\u201348 (1950)."},{"key":"190_CR12","doi-asserted-by":"crossref","unstructured":"Lawrence K.M.: A combinatorial characterization of $$(t, m, s)$$ ( t , m , s ) -nets in base $$b$$ b . J. Comb. Des. 4, 275\u2013293 (1996).","DOI":"10.1002\/(SICI)1520-6610(1996)4:4<275::AID-JCD5>3.0.CO;2-C"},{"key":"190_CR13","unstructured":"Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997)."},{"key":"190_CR14","doi-asserted-by":"crossref","unstructured":"Mullen G.L., Panario D. (eds.): Handbook of Finite Fields. CRC Press, Boca Raton (2013).","DOI":"10.1201\/b15006"},{"key":"190_CR15","doi-asserted-by":"crossref","unstructured":"Mullen G.L., Whittle G.: Point sets with uniformity properties and orthogonal hypercubes. Monatsh. Math. 113, 265\u2013273 (1992).","DOI":"10.1007\/BF01301071"},{"key":"190_CR16","doi-asserted-by":"crossref","unstructured":"Niederreiter H.: Random Number Generation and Quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1992).","DOI":"10.1137\/1.9781611970081"},{"key":"190_CR17","unstructured":"Panario D., Thomson D.: Efficient $$p$$ p th root computations in finite fields of characteristic $$p$$ p . Des. Codes Cryptogr. 62, 273\u2013283 (2011)."},{"key":"190_CR18","doi-asserted-by":"crossref","unstructured":"Tovstik T.M.: Calculation of the discrepancy of a finite set of points in the unit $$n$$ n -cube. Vestnik St. Petersb. Univ. Math. 40, 250\u2013252 (2007).","DOI":"10.3103\/S1063454107030120"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0190-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0190-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0190-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0190-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T23:04:12Z","timestamp":1567638252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0190-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,29]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0190-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,29]]}}}