{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T23:54:35Z","timestamp":1778630075567,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T00:00:00Z","timestamp":1518393600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2014-59179-C2-1-P"],"award-info":[{"award-number":["MTM2014-59179-C2-1-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["RTG2088"],"award-info":[{"award-number":["RTG2088"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["BES-2015-073360"],"award-info":[{"award-number":["BES-2015-073360"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["RYC-2013-13327"],"award-info":[{"award-number":["RYC-2013-13327"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","award":["MTM2014-59179-C2-1-P"],"award-info":[{"award-number":["MTM2014-59179-C2-1-P"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","award":["RYC-2013-13327"],"award-info":[{"award-number":["RYC-2013-13327"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"crossref","award":["BES-2015-073360"],"award-info":[{"award-number":["BES-2015-073360"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10878-018-0250-5","type":"journal-article","created":{"date-parts":[[2018,2,11]],"date-time":"2018-02-11T22:55:51Z","timestamp":1518389751000},"page":"1061-1085","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A feasibility approach for constructing combinatorial designs of circulant type"],"prefix":"10.1007","volume":"35","author":[{"given":"Francisco J.","family":"Arag\u00f3n Artacho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rub\u00e9n","family":"Campoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilias","family":"Kotsireas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew K.","family":"Tam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,12]]},"reference":[{"key":"250_CR1","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n Artacho FJ, Borwein JM, Tam MK (2014a) Recent results on Douglas-Rachford methods for combinatorial optimization problems. J Optim Theory Appl 163(1):1\u201330","DOI":"10.1007\/s10957-013-0488-0"},{"key":"250_CR2","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n Artacho FJ, Borwein JM, Tam MK (2014b) Douglas-Rachford feasibility methods for matrix completion problems. ANZIAM J 55(4):299\u2013326","DOI":"10.1017\/S1446181114000145"},{"issue":"2","key":"250_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10898-015-0380-6","volume":"65","author":"FJ Arag\u00f3n Artacho","year":"2016","unstructured":"Arag\u00f3n Artacho FJ, Borwein JM, Tam MK (2016) Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem. J Glob Optim 65(2):309\u2013327","journal-title":"J Glob Optim"},{"key":"250_CR4","doi-asserted-by":"publisher","unstructured":"Arag\u00f3n Artacho FJ, Campoy R (accepted Nov. 2017) Solving graph coloring problems with the Douglas\u2013Rachford algorithm. Set-Valued Var. Anal., p 27. \n                    https:\/\/doi.org\/10.1007\/s11228-017-0461-4","DOI":"10.1007\/s11228-017-0461-4"},{"key":"250_CR5","first-page":"1","volume-title":"Perfect ternary arrays","author":"KT Arasu","year":"1999","unstructured":"Arasu KT, Dillon JF (1999) Difference sets. Sequences and their correlation properties. In: Pott A, Kumar PV, Helleseth T, Jungnickel D (eds) Perfect ternary arrays. Springer, Dordrecht, pp 1\u201315"},{"issue":"5","key":"250_CR6","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1109\/18.930940","volume":"47","author":"KT Arasu","year":"2001","unstructured":"Arasu KT, Gulliver TA (2001) Self-dual codes over \n                    \n                      \n                    \n                    $${\\mathbb{F}}_p$$\n                    \n                      \n                        \n                          F\n                          p\n                        \n                      \n                    \n                   and weighing matrices. IEEE Trans Inf Theory 47(5):2051\u20132055","journal-title":"IEEE Trans Inf Theory"},{"key":"250_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s12095-010-0025-z","volume":"2","author":"KT Arasu","year":"2010","unstructured":"Arasu KT, Gutman AJ (2010) Circulant weighing matrices. Cryptogr Commun 2:155\u2013171","journal-title":"Circulant weighing matrices. Cryptogr Commun"},{"key":"250_CR8","first-page":"43","volume":"48","author":"KT Arasu","year":"2010","unstructured":"Arasu KT, Kotsireas IS, Koukouvinos C, Seberry J (2010) On circulant and two-circulant weighing matrices. Australas J Combin 48:43\u201351","journal-title":"Australas J Combin"},{"key":"250_CR9","doi-asserted-by":"crossref","unstructured":"Arasu KT, Leung KH, Ma SL, Nabavi A, Ray-Chaudhuri DK (2006a) Circulant weighing matrices of weight \n                    \n                      \n                    \n                    $$2^{2t}$$\n                    \n                      \n                        \n                          2\n                          \n                            2\n                            t\n                          \n                        \n                      \n                    \n                  . Des Codes Cryptogr 41(1):111\u2013123","DOI":"10.1007\/s10623-006-0026-2"},{"key":"250_CR10","doi-asserted-by":"crossref","unstructured":"Arasu KT, Leung KH, Ma SL, Nabavi A, Ray-Chaudhuri DK (2006b) Determination of all possible orders of weight 16 circulant weighing matrices. Finite Fields Appl 12(4):498\u2013538","DOI":"10.1016\/j.ffa.2005.06.009"},{"key":"250_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke HH, Combettes PL (2011) Convex analysis and monotone operator theory in hilbert spaces. Springer, New York"},{"issue":"2","key":"250_CR12","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jat.2004.02.006","volume":"127","author":"HH Bauschke","year":"2004","unstructured":"Bauschke HH, Combettes PL, Luke DR (2004) Finding best approximation pairs relative to two closed convex sets in Hilbert space. J Approx Theory 127(2):178\u2013192","journal-title":"J Approx Theory"},{"key":"250_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/16M1071079","volume":"27","author":"HH Bauschke","year":"2017","unstructured":"Bauschke HH, Dao MN (2017) On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces. SIAM J Optim 27:207\u2013537","journal-title":"SIAM J Optim"},{"key":"250_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex analysis and nonlinear optimization","author":"JM Borwein","year":"2006","unstructured":"Borwein JM, Lewis AS (2006) Convex analysis and nonlinear optimization. Springer, New York"},{"key":"250_CR15","first-page":"15","volume":"55","author":"RP Brent","year":"2013","unstructured":"Brent RP (2013) Finding D-optimal design by randomised decomposition and switching. Australas J Combin 55:15\u201330","journal-title":"Australas J Combin"},{"key":"250_CR16","volume-title":"DFT","author":"WL Briggs","year":"1995","unstructured":"Briggs WL, Henson VE (1995) DFT. An owner\u2019s manual for the discrete Fourier transform, SIAM, Philadelphia"},{"issue":"1","key":"250_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1112\/blms\/21.1.36","volume":"21","author":"JHE Cohn","year":"1989","unstructured":"Cohn JHE (1989) On determinants with elements \n                    \n                      \n                    \n                    $$\\pm $$\n                    \n                      \n                        \u00b1\n                      \n                    \n                  1. Bull Lond Math Soc 21(1):36\u201342","journal-title":"Bull Lond Math Soc"},{"key":"250_CR18","volume-title":"Handbook of combinatorial designs","author":"CJ Colbourn","year":"2007","unstructured":"Colbourn CJ, Dinitz JH (2007) Handbook of combinatorial designs, 2nd edn. Chapman & Hall, Boca Raton","edition":"2"},{"key":"250_CR19","doi-asserted-by":"crossref","unstructured":"\u0110okovi\u0107 DZ\u0306, Kotsireas IS (2012) New results on D-pptimal matrices. J Combin Des 20(6):278\u2013289","DOI":"10.1002\/jcd.21302"},{"key":"250_CR20","doi-asserted-by":"crossref","unstructured":"\u0110okovi\u0107 DZ\u0306, Kotsireas IS (2015a) Compression of periodic complementary sequences and applications. Des Codes Cryptogr 74(2):365\u2013377","DOI":"10.1007\/s10623-013-9862-z"},{"key":"250_CR21","doi-asserted-by":"crossref","unstructured":"\u0110okovi\u0107 DZ\u0306, Kotsireas IS (2015b) D-optimal matrices of orders 118, 138, 150, 154 and 174. In: Colbourn CJ (ed) Algebraic design theory and Hadamard matrices. Springer, Basel, pp 71\u201382","DOI":"10.1007\/978-3-319-17729-8_6"},{"key":"250_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01111249","volume":"83","author":"H Ehlich","year":"1964","unstructured":"Ehlich H (1964) Determinantenabsch\u00e4tzungen f\u00fcr bin\u00e4re Matrizen. Math Zeitschr 83:123\u2013132","journal-title":"Determinantenabsch\u00e4tzungen f\u00fcr bin\u00e4re Matrizen. Math Zeitschr"},{"issue":"2","key":"250_CR23","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1073\/pnas.0606359104","volume":"104","author":"V Elser","year":"2007","unstructured":"Elser V, Rankenburg I, Thibault P (2007) Searching with iterated maps. Proc Natl Acad Sci 104(2):418\u2013426","journal-title":"Proc Natl Acad Sci"},{"issue":"6","key":"250_CR24","doi-asserted-by":"publisher","first-page":"065302","DOI":"10.1088\/1751-8113\/42\/6\/065302","volume":"42","author":"ST Flammia","year":"2009","unstructured":"Flammia ST, Severini S (2009) Weighing matrices and optical quantum computing. J Phys A 42(6):065302","journal-title":"J Phys A"},{"key":"250_CR25","volume-title":"Signal design for good correlation","author":"SW Golomb","year":"2004","unstructured":"Golomb SW, Gong G (2004) Signal design for good correlation. Cambridge University Press, New York"},{"issue":"3","key":"250_CR26","doi-asserted-by":"publisher","first-page":"036706","DOI":"10.1103\/PhysRevE.78.036706","volume":"78","author":"S Gravel","year":"2008","unstructured":"Gravel S, Elser V (2008) Divide and concur: a general approach to constraint satisfaction. Phys Rev E 78(3):036706","journal-title":"Phys Rev E"},{"key":"250_CR27","unstructured":"Gutman AJ (2009) Circulant weighing matrices. Master\u2019s Thesis, Wright State University. \n                    http:\/\/rave.ohiolink.edu\/etdc\/view?acc_num=wright1244468669"},{"key":"250_CR28","unstructured":"Hesse R (2014) Fixed point algorithms for nonconvex feasibility with applications. Ph.D. thesis, University of G\u00f6ttingen. \n                    http:\/\/hdl.handle.net\/11858\/00-1735-0000-0022-5F3F-E"},{"key":"250_CR29","volume-title":"Hadamard matrices and their applications","author":"KJ Horadam","year":"2012","unstructured":"Horadam KJ (2012) Hadamard matrices and their applications. Princeton University Press, New Jersey"},{"key":"250_CR30","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-1-4419-7997-1_13","volume-title":"Handbook of combinatorial optimization","author":"IS Kotsireas","year":"2013","unstructured":"Kotsireas IS (2013) Algorithms and metaheuristics for combinatorial matrices. In: Pardalos PM, Du D-Z, Graham RL (eds) Handbook of combinatorial optimization. Springer, New York, pp 283\u2013309"},{"issue":"5","key":"250_CR31","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejc.2005.03.004","volume":"27","author":"IS Kotsireas","year":"2006","unstructured":"Kotsireas IS, Koukouvinos C, Seberry J (2006) Hadamard ideals and Hadamard matrices with two circulant cores. Eur J Combin 27(5):658\u2013668","journal-title":"Eur J Combin"},{"key":"250_CR32","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra G (1984) Decomposition through formalization in a product space. Math Program 28:96\u2013115","journal-title":"Math Program"},{"key":"250_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93806-4","volume-title":"Gr\u00f6bner bases, coding, and cryptography","author":"M Sala","year":"2009","unstructured":"Sala M, Sakata S, Mora T, Traverso C, Perret L (2009) Gr\u00f6bner bases, coding, and cryptography. Springer, Berlin"},{"key":"250_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59032-5","volume-title":"Orthogonal designs: hadamard matrices, quadratic forms and algebras","author":"JR Seberry","year":"2017","unstructured":"Seberry JR (2017) Orthogonal designs: hadamard matrices, quadratic forms and algebras. Springer, Berlin"},{"key":"250_CR35","first-page":"431","volume-title":"Contemporary design theory: a collection of surveys","author":"J Seberry","year":"1992","unstructured":"Seberry J, Yamada M (1992) Hadamard matrices, sequences, and block designs. In: Dintz JH, Stinson DR (eds) Contemporary design theory: a collection of surveys. Wiley, Hoboken, pp 431\u2013560"},{"key":"250_CR36","unstructured":"Strassler Y (1997) The Classification of Circulant Weighing Matrices of Weight 9. Ph.D. thesis, Bar-Ilan University (Israel)"},{"key":"250_CR37","volume-title":"Combinatorial designs. Constructions and analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson DR (2004) Combinatorial designs. Constructions and analysis. Springer, New York"},{"key":"250_CR38","volume-title":"Algorithms in Invariant theory","author":"B Sturmfels","year":"2008","unstructured":"Sturmfels B (2008) Algorithms in Invariant theory. Springer, Vienna"},{"key":"250_CR39","unstructured":"Tan MM (2016) Group invariant weighing matrices. \n                    arXiv:1610.01914"},{"key":"250_CR40","unstructured":"Tan MM (2014) Relative difference sets and circulant weighing matrices. Ph.D. thesis, Nanyang Technological University. \n                    https:\/\/repository.ntu.edu.sg\/handle\/10356\/62325"},{"issue":"4","key":"250_CR41","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00453-002-0975-4","volume":"34","author":"W Dam van","year":"2002","unstructured":"van Dam W (2002) Quantum algorithms for weighing matrices and quadratic residues. Algorithmica 34(4):413\u2013428","journal-title":"Algorithmica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0250-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0250-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0250-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T20:30:24Z","timestamp":1549917024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0250-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,12]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["250"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0250-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,12]]},"assertion":[{"value":"12 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}