{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T15:59:33Z","timestamp":1787759973694,"version":"build-2784847793"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["110-2628-E-A49-007"],"award-info":[{"award-number":["110-2628-E-A49-007"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["109-2628-M-008-002-MY4"],"award-info":[{"award-number":["109-2628-M-008-002-MY4"]}],"id":[{"id":"10.13039\/501100004663","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":[[2023,10]]},"DOI":"10.1007\/s10623-023-01250-4","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T15:02:22Z","timestamp":1686322942000},"page":"3241-3262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Semidefinite programming bounds for binary codes from a split Terwilliger algebra"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1112-5127","authenticated-orcid":false,"given":"Pin-Chieh","family":"Tseng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1970-8167","authenticated-orcid":false,"given":"Ching-Yi","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei-Hsuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,9]]},"reference":[{"issue":"3","key":"1250_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/JSAC.2020.2968997","volume":"38","author":"A Ashikhmin","year":"2020","unstructured":"Ashikhmin A., Lai C.-Y., Brun T.A.: Quantum data-syndrome codes. IEEE J. Sel. Areas Commun. 38(3), 449\u2013462 (2020). https:\/\/doi.org\/10.1109\/JSAC.2020.2968997.","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1250_CR2","doi-asserted-by":"publisher","unstructured":"Bachoc, C.: Applications of semidefinite programming to coding theory. In: Proceedings of the 2010 IEEE Information Theory Workshop (ITW), pp. 1\u20135 (2010). https:\/\/doi.org\/10.1109\/CIG.2010.5592938","DOI":"10.1109\/CIG.2010.5592938"},{"key":"1250_CR3","doi-asserted-by":"crossref","unstructured":"Bannai, E., Bannai, E., Ito, T., Tanaka, R.: Algebraic combinatorics. De Gruyter Series in Discrete Mathematics and Applications. Walter de Gruyter GmbH, Co KG, Berlin, Boston (2021)","DOI":"10.1515\/9783110630251"},{"issue":"1","key":"1250_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TIT.1978.1055827","volume":"24","author":"M Best","year":"1978","unstructured":"Best M., Brouwer A., MacWilliams F., Odlyzko A., Sloane N.: Bounds for binary codes of length less than 25. IEEE Trans. Inf. Theory 24(1), 81\u201393 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055827.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1250_CR5","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1109\/TIT.1980.1056269","volume":"26","author":"M Best","year":"1980","unstructured":"Best M.: Binary codes with a minimum distance of four. IEEE Trans. Inf. Theory 26(6), 738\u2013742 (1980). https:\/\/doi.org\/10.1109\/TIT.1980.1056269.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1250_CR6","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.jcta.2011.01.002","volume":"118","author":"A Barg","year":"2011","unstructured":"Barg A., Musin O.R.: Bounds on sets with few distances. J. Comb. Theory Ser. A 118(4), 1465\u20131474 (2011). https:\/\/doi.org\/10.1016\/j.jcta.2011.01.002.","journal-title":"J. Comb. Theory Ser. A"},{"key":"1250_CR7","unstructured":"Brouwer, A.: Table of general binary codes. https:\/\/www.win.tue.nl\/ aeb\/codes\/binary-1.html (2022). Accessed 14 Feb"},{"issue":"3","key":"1250_CR8","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1090\/S0894-0347-07-00589-9","volume":"21","author":"C Bachoc","year":"2008","unstructured":"Bachoc C., Vallentin F.: New upper bounds for kissing numbers from semidefinite programming. J. Am. Math. Soc. 21(3), 909\u2013924 (2008). https:\/\/doi.org\/10.1090\/S0894-0347-07-00589-9.","journal-title":"J. Am. Math. Soc."},{"key":"1250_CR9","first-page":"111","volume":"625","author":"A Barg","year":"2013","unstructured":"Barg A., Yu W.-H.: New bounds for equiangular lines. Discret. Geom. Algebr. Comb. 625, 111\u2013121 (2013).","journal-title":"Discret. Geom. Algebr. Comb."},{"issue":"2","key":"1250_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/10586458.2013.767725","volume":"22","author":"A Barg","year":"2013","unstructured":"Barg A., Yu W.-H.: New bounds for spherical two-distance sets. Exp. Math. 22(2), 187\u2013194 (2013). https:\/\/doi.org\/10.1080\/10586458.2013.767725.","journal-title":"Exp. Math."},{"key":"1250_CR11","first-page":"880","volume":"10","author":"P Delsarte","year":"1973","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. 10, 880\u2013886 (1973).","journal-title":"Philips Res."},{"key":"1250_CR12","series-title":"Lecture notes in control and information Sciences","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-1-84800-155-8_7","volume-title":"Recent Advances in Learning and Control","author":"M Grant","year":"2008","unstructured":"Grant M., Boyd S.: Graph implementations for nonsmooth convex programs. In: Blondel V., Boyd S., Kimura H. (eds.) Recent Advances in Learning and Control, pp. 95\u2013110. Lecture notes in control and information Sciences. Springer-Verlag, Berlin Heidelberg (2008)."},{"key":"1250_CR13","unstructured":"Grant, M., Boyd, S.: CVX: MATLAB software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2014)"},{"key":"1250_CR14","unstructured":"Gijswijt, D.: Matrix algebras and semidefinite programming techniques for codes. PhD thesis, University of Amsterdam (2005)"},{"key":"1250_CR15","unstructured":"Gijswijt, D.: Block diagonalization for algebra\u2019s associated with block codes. https:\/\/arxiv.org\/0910.4515 (2009)"},{"issue":"5","key":"1250_CR16","doi-asserted-by":"publisher","first-page":"2697","DOI":"10.1109\/TIT.2012.2184845","volume":"58","author":"D Gijswijt","year":"2012","unstructured":"Gijswijt D., Mittelmann H., Schrijver A.: Semidefinite code bounds based on quadruple distances. IEEE Trans. Inf. Theory 58(5), 2697\u20132705 (2012). https:\/\/doi.org\/10.1109\/TIT.2012.2184845.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1250_CR17","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.jcta.2006.03.010","volume":"113","author":"D Gijswijt","year":"2006","unstructured":"Gijswijt D., Schrijver A., Tanaka H.: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Comb. Theory Ser. A 113(8), 1719\u20131731 (2006). https:\/\/doi.org\/10.1016\/j.jcta.2006.03.010.","journal-title":"J. Comb. Theory Ser. A"},{"key":"1250_CR18","doi-asserted-by":"publisher","first-page":"105182","DOI":"10.1016\/j.jcta.2019.105182","volume":"172","author":"L Hou","year":"2020","unstructured":"Hou L., Hou B., Gao S., Yu W.-H.: New code upper bounds for the folded n-cube. J. Comb. Theory Ser. A 172, 105182 (2020). https:\/\/doi.org\/10.1016\/j.jcta.2019.105182.","journal-title":"J. Comb. Theory Ser. A"},{"issue":"11","key":"1250_CR19","doi-asserted-by":"publisher","first-page":"7337","DOI":"10.1109\/TIT.2013.2277714","volume":"59","author":"H-K Kim","year":"2013","unstructured":"Kim H.-K., Toan P.-T.: Improved semidefinite programming bound on sizes of codes. IEEE Trans. Inf. Theory 59(11), 7337\u20137345 (2013). https:\/\/doi.org\/10.1109\/TIT.2013.2277714.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1250_CR20","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/TIT.2017.2711601","volume":"64","author":"C-Y Lai","year":"2018","unstructured":"Lai C.-Y., Ashikhmin A.: Linear programming bounds for entanglement-assisted quantum error-correcting codes by split weight enumerators. IEEE Trans. Inf. Theory 64(1), 622\u2013639 (2018). https:\/\/doi.org\/10.1109\/TIT.2017.2711601.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1250_CR21","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10107-006-0030-3","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent M.: Strengthened semidefinite programming bounds for codes. Math. Program. 109, 239\u2013261 (2007). https:\/\/doi.org\/10.1007\/s10107-006-0030-3.","journal-title":"Math. Program."},{"issue":"8","key":"1250_CR22","doi-asserted-by":"publisher","first-page":"3148","DOI":"10.1109\/TCOMM.2016.2585641","volume":"64","author":"C-Y Lai","year":"2016","unstructured":"Lai C.-Y., Hsieh M.-H., Lu H.-F.: On the MacWilliams identity for classical and quantum convolutional codes. IEEE Trans. Commun. 64(8), 3148\u20133159 (2016). https:\/\/doi.org\/10.1109\/TCOMM.2016.2585641.","journal-title":"IEEE Trans. Commun."},{"key":"1250_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-016-0216-5","volume":"84","author":"B Litjens","year":"2017","unstructured":"Litjens B., Polak S., Schrijver A.: Semidefinite bounds for nonbinary codes based on quadruples. Des. Codes Cryptogr. 84, 87\u2013100 (2017). https:\/\/doi.org\/10.1007\/s10623-016-0216-5.","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1250_CR24","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/10586458.2017.1286273","volume":"27","author":"FC Machado","year":"2018","unstructured":"Machado F.C., de Oliveira Filho F.M.: Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry. Exp. Math. 27(3), 362\u2013369 (2018). https:\/\/doi.org\/10.1080\/10586458.2017.1286273.","journal-title":"Exp. Math."},{"issue":"4","key":"1250_CR25","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/18.992776","volume":"48","author":"B Mounits","year":"2002","unstructured":"Mounits B., Etzion T., Litsyn S.: Improved upper bounds on sizes of codes. IEEE Trans. Inf. Theory 48(4), 880\u2013886 (2002). https:\/\/doi.org\/10.1109\/18.992776.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1250_CR26","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1016\/j.ejc.2011.03.003","volume":"32","author":"OR Musin","year":"2011","unstructured":"Musin O.R., Nozaki H.: Bounds on three- and higher-distance sets. Eur. J. Comb. 32(8), 1182\u20131190 (2011). https:\/\/doi.org\/10.1016\/j.ejc.2011.03.003.","journal-title":"Eur. J. Comb."},{"key":"1250_CR27","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North Holland Publishing Co., North Holland (1977)."},{"issue":"2","key":"1250_CR28","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10623-018-0532-z","volume":"87","author":"PRJ \u00d6sterg\u00e5rd","year":"2019","unstructured":"\u00d6sterg\u00e5rd P.R.J.: The sextuply shortened binary golay code is optimal. Des. Codes Cryptogr. 87(2), 341\u2013347 (2019). https:\/\/doi.org\/10.1007\/s10623-018-0532-z.","journal-title":"Des. Codes Cryptogr."},{"key":"1250_CR29","unstructured":"Polak, S.C.: New methods in coding theory: Error-correcting codes and the Shannon capacity. PhD thesis, University of Amsterdam (2019)"},{"issue":"1","key":"1250_CR30","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/TIT.2018.2854800","volume":"65","author":"SC Polak","year":"2019","unstructured":"Polak S.C.: Semidefinite programming bounds for constant-weight codes. IEEE Trans. Inf. Theory 65(1), 28\u201338 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2854800.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1250_CR31","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A Schrijver","year":"1979","unstructured":"Schrijver A.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Theory 25(4), 425\u2013429 (1979). https:\/\/doi.org\/10.1109\/TIT.1979.1056072.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1250_CR32","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(8), 2859\u20132866 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.851748.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1250_CR33","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0024-3795(93)00106-A","volume":"216","author":"J Simonis","year":"1995","unstructured":"Simonis J.: MacWilliams identities and coordinate partitions. Linear Algebra Appl. 216, 81\u201391 (1995). https:\/\/doi.org\/10.1016\/0024-3795(93)00106-A.","journal-title":"Linear Algebra Appl."},{"key":"1250_CR34","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1022494701663","volume":"1","author":"P Terwilliger","year":"1992","unstructured":"Terwilliger P.: The subconstituent algebra of an association scheme, (part I). J. Algebr. Comb. 1, 363\u2013388 (1992). https:\/\/doi.org\/10.1023\/A:1022494701663.","journal-title":"J. Algebr. Comb."},{"key":"1250_CR35","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1022480715311","volume":"2","author":"P Terwilliger","year":"1993","unstructured":"Terwilliger P.: The subconstituent algebra of an association scheme, (part II). J. Algebr. Comb. 2, 73\u2013103 (1993). https:\/\/doi.org\/10.1023\/A:1022480715311.","journal-title":"J. Algebr. Comb."},{"key":"1250_CR36","doi-asserted-by":"publisher","unstructured":"Tseng, P.-C., Lai, C.-Y., Yu, W.-H.: Improved semidefinite programming bounds for binary codes by split distance enumerations. In: Proceedings of the 2022 IEEE International Symposium on Information Theory (ISIT), pp. 3073\u20133078 (2022). https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834515","DOI":"10.1109\/ISIT50566.2022.9834515"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01250-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01250-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01250-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T18:05:50Z","timestamp":1695924350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01250-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,9]]},"references-count":36,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1250"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01250-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,9]]},"assertion":[{"value":"21 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}