{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:00Z","timestamp":1740122580203,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T00:00:00Z","timestamp":1543536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["339109"],"award-info":[{"award-number":["339109"]}],"id":[{"id":"10.13039\/501100000781","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":[[2019,8]]},"DOI":"10.1007\/s10623-018-0589-8","type":"journal-article","created":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T08:29:15Z","timestamp":1543566555000},"page":"1881-1895","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uniqueness of codes using semidefinite programming"],"prefix":"10.1007","volume":"87","author":[{"given":"Andries E.","family":"Brouwer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven C.","family":"Polak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,30]]},"reference":[{"unstructured":"Brouwer A.E.: Tables with bounds on\u00a0\n                    \n                      \n                    \n                    $$A(n,d,w)$$\n                    \n                      \n                        \n                          A\n                          (\n                          n\n                          ,\n                          d\n                          ,\n                          w\n                          )\n                        \n                      \n                    \n                  . \n                    http:\/\/www.win.tue.nl\/~aeb\/codes\/Andw.html\n                    \n                  .","key":"589_CR1"},{"key":"589_CR2","first-page":"693","volume-title":"Handbook of Combinatorics","author":"AE Brouwer","year":"1995","unstructured":"Brouwer A.E.: Block designs. In: Graham R., Groetschel M., Lov\u00e1sz L. (eds.) Handbook of Combinatorics, pp. 693\u2013745. Elsevier, New York (1995)."},{"unstructured":"Brouwer A.E.: Tables with bounds on\u00a0\n                    \n                      \n                    \n                    $$A(n,d)$$\n                    \n                      \n                        \n                          A\n                          (\n                          n\n                          ,\n                          d\n                          )\n                        \n                      \n                    \n                  . \n                    http:\/\/www.win.tue.nl\/~aeb\/codes\/binary-1.html\n                    \n                  .","key":"589_CR3"},{"unstructured":"Brouwer A.E., Polak S.C.: Computer programs. \n                    https:\/\/github.com\/codeuniqueness\/code_uniqueness\n                    \n                  .","key":"589_CR4"},{"unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Repts. Suppl. No. 10 (1973).","key":"589_CR5"},{"key":"589_CR6","first-page":"45","volume":"29","author":"SM Dodunekov","year":"1993","unstructured":"Dodunekov S.M., Encheva S.B.: Uniqueness of some linear subcodes of the extended binary Golay code. Probl. Peredachi Inf. 29, 45\u201351 (1993).","journal-title":"Probl. Peredachi Inf."},{"key":"589_CR7","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1109\/TIT.2012.2184845","volume":"58","author":"DC Gijswijt","year":"2012","unstructured":"Gijswijt D.C., Mittelmann H.D., Schrijver A.: Semidefinite code bounds based on quadruple distances. IEEE Trans. Inf. Theory 58, 2697\u20132705 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"589_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-016-0216-5","volume":"84","author":"BM Litjens","year":"2017","unstructured":"Litjens B.M., Polak S.C., Schrijver A.: Semidefinite bounds for nonbinary codes based on quadruples. Des. Codes Cryptogr. 84, 87\u2013100 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"589_CR9","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1983","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. Elsevier, North-Holland (1983)."},{"key":"589_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2013","unstructured":"McKay B.D., Piperno A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2013).","journal-title":"J. Symb. Comput."},{"unstructured":"Nakata M.: A numerical evaluation of highly accuratemultiple-precision arithmetic version of semidefinite programmingsolver: SDPA-GMP, -QD and -DD. In: The proceedings of 2010 IEEE Multi-Conference on Systems and Control, pp. 29\u201334 (2010).","key":"589_CR11"},{"key":"589_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","volume":"3","author":"V Pless","year":"1972","unstructured":"Pless V.: A classification of self-orthogonal codes over \n                    \n                      \n                    \n                    $$\\text{ GF }(2)$$\n                    \n                      \n                        \n                          \n                          GF\n                          \n                          (\n                          2\n                          )\n                        \n                      \n                    \n                  . Discret. Math. 3, 209\u2013246 (1972).","journal-title":"Discret. Math."},{"key":"589_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0097-3165(75)90042-4","volume":"18","author":"V Pless","year":"1975","unstructured":"Pless V., Sloane N.J.A.: On the classification and enumeration of self-dual codes. J. Comb. Theory (A) 18, 313\u2013335 (1975).","journal-title":"J. Comb. Theory (A)"},{"doi-asserted-by":"publisher","unstructured":"Polak S.C.: Semidefinite programming bounds for constant weight codes. IEEE Trans. Inf. Theory (2018). \n                    https:\/\/doi.org\/10.1109\/TIT.2018.2854800\n                    \n                  .","key":"589_CR14","DOI":"10.1109\/TIT.2018.2854800"},{"key":"589_CR15","doi-asserted-by":"publisher","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A Schrijver","year":"2005","unstructured":"Schrijver A.: New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inf. Theory 51, 2859\u20132866 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Yamashita M., Fujisawa K., Fukuda M., Kobayashi K., Nakta K., Nakata M.: Latest developments in the SDPA Family for solvinglarge-scale SDPs. In: Anjos M.F., Lasserre J.B. (eds.) Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, Chapter 24, pp. 687\u2013714. Springer (2011).","key":"589_CR16"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0589-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0589-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0589-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T19:22:16Z","timestamp":1575055336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0589-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,30]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["589"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0589-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,11,30]]},"assertion":[{"value":"7 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}