{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:58:44Z","timestamp":1726041524919},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268305"},{"type":"electronic","value":"9783030268312"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26831-2_21","type":"book-chapter","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:07:07Z","timestamp":1565824027000},"page":"315-329","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PAF Reconstruction with the Orbits Method"],"prefix":"10.1007","author":[{"given":"Ilias S.","family":"Kotsireas","sequence":"first","affiliation":[]},{"given":"Youtong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"21_CR1","first-page":"70","volume":"71","author":"G Barba","year":"1933","unstructured":"Barba, G.: Intorno al teorema di hadamard sui determinanti a valore massimo. Giorn. Mat. Battaglini 71, 70\u201386 (1933)","journal-title":"Giorn. Mat. Battaglini"},{"key":"21_CR2","unstructured":"Craigen, R., Kharaghani, H.: Hadamard matrices and hadamard designs. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, Discrete Mathematics and its Applications (Boca Raton), 2nd edn. pp. 273\u2013280. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01111249","volume":"83","author":"H Ehlich","year":"1964","unstructured":"Ehlich, H.: Determinantenabssch\u00e4tzungen f\u00fcr bin\u00e4re matrizen. Math. Z. 83, 123\u2013132 (1964)","journal-title":"Math. Z."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/BF01109911","volume":"84","author":"H Ehlich","year":"1964","unstructured":"Ehlich, H.: Determinantenabssch\u00e4tzungen f\u00fcr bin\u00e4re matrizen mit n3 mod 4. Math. Z. 84, 438\u2013447 (1964)","journal-title":"Math. Z."},{"key":"21_CR5","unstructured":"Gysin, M.: Combinatorial Designs, Sequences and Cryptography. Ph.D. thesis, University of Wollongong (1997)"},{"key":"21_CR6","first-page":"247","volume":"15","author":"M Gysin","year":"1997","unstructured":"Gysin, M.: New D-optimal designs via cyclotomy and generalised cyclotomy. Australas. J. Comb. 15, 247\u2013256 (1997)","journal-title":"Australas. J. Comb."},{"key":"21_CR7","first-page":"143","volume":"27","author":"M Gysin","year":"1997","unstructured":"Gysin, M., Seberry, J.: An experimental search and new combinatorial designs via a generalisation of cyclotomy. J. Comb. Math. Comb. Comput. 27, 143\u2013160 (1997)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"21_CR8","first-page":"240","volume":"17","author":"J Hadamard","year":"1893","unstructured":"Hadamard, J.: R\u00e9solution d\u00f9ne question relative aux d\u00e9terminants. Bulletin des Sciences Math\u00e9matiques 17, 240\u2013246 (1893)","journal-title":"Bulletin des Sciences Math\u00e9matiques"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-011-9173-3","volume":"19","author":"I Kotsireas","year":"2013","unstructured":"Kotsireas, I., Pardalos, P.: D-optimal matrices via quadratic integer optimization. J. Heuristics 19, 617\u2013627 (2013)","journal-title":"J. Heuristics"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-99957-9_13","volume-title":"Artificial Intelligence and Symbolic Computation","author":"IS Kotsireas","year":"2018","unstructured":"Kotsireas, I.S., Yang, J.: Autocorrelation via runs. In: Fleuriot, J., Wang, D., Calmet, J. (eds.) AISC 2018. LNCS (LNAI), vol. 11110, pp. 195\u2013205. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-99957-9_13"},{"key":"21_CR11","volume-title":"Combinatorial Algorithms, Generation, Enumeration and Search (CAGES)","author":"DL Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms, Generation, Enumeration and Search (CAGES), 1st edn. CRC Press, Boca Raton (1999)","edition":"1"},{"issue":"18","key":"21_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1088\/0305-4470\/29\/18\/005","volume":"29","author":"S Mertens","year":"1996","unstructured":"Mertens, S.: Exhaustive search for low-autocorrelation binary sequences. J. Phys. A: Math. Gen. 29(18), 473\u2013481 (1996)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"2","key":"21_CR13","first-page":"371","volume":"7","author":"D \u0110okovi\u0107","year":"1991","unstructured":"\u0110okovi\u0107, D.: On maximal \n                    \n                      \n                    \n                    $$(1,-1)$$\n                  -matrices of order \n                    \n                      \n                    \n                    $$2n$$\n                  , \n                    \n                      \n                    \n                    $$n$$\n                   odd. Rad. Mat. 7(2), 371\u2013378 (1991)","journal-title":"Rad. Mat."},{"key":"21_CR14","first-page":"221","volume":"15","author":"D \u0110okovi\u0107","year":"1997","unstructured":"\u0110okovi\u0107, D.: Some new D-optimal designs. Australas. J. Comb. 15, 221\u2013231 (1997)","journal-title":"Australas. J. Comb."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-17729-8_6","volume-title":"Algebraic Design Theory and Hadamard Matrices","author":"D \u0110okovi\u0107","year":"2015","unstructured":"\u0110okovi\u0107, D., Kotsireas, I.S.: D-optimal matrices of orders 118, 138, 150, 154 and 174. In: Colbourn, C.J. (ed.) Algebraic Design Theory and Hadamard Matrices, vol. 133, pp. 71\u201382. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-17729-8_6"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1002\/jcd.21302","volume":"20","author":"D \u0110okovi\u0107","year":"2012","unstructured":"\u0110okovi\u0107, D., Kotsireas, I.: New results on D-optimal matrices. J. Comb. Des. 20, 278\u2013289 (2012)","journal-title":"J. Comb. Des."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4064\/cm-12-1-73-83","volume":"712","author":"M Wojtas","year":"1964","unstructured":"Wojtas, M.: On Hadamard\u2019s inequality for the determinants of order non-divisible by 4. Colloq. Math. 712, 73\u201383 (1964)","journal-title":"Colloq. Math."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26831-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:08:34Z","timestamp":1565824114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26831-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268305","9783030268312"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26831-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.casc.cs.uni-bonn.de\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}