{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:19:00Z","timestamp":1787314740429,"version":"build-2736575974"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"\u201cHigh-Dimensional Combinatorics\u201d of the Israel Science Foundation","doi-asserted-by":"publisher","award":["659\/18"],"award-info":[{"award-number":["659\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/tit.2023.3236660","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T14:25:38Z","timestamp":1673879138000},"page":"2886-2899","source":"Crossref","is-referenced-by-count":3,"title":["New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8298-272X","authenticated-orcid":false,"given":"Elyassaf","family":"Loyfer","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nati","family":"Linial","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","article-title":"One more proof of the first linear programming bound for binary codes and two conjectures","author":"samorodnitsky","year":"2021","journal-title":"arXiv 2104 14587"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9128-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.12.010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1142\/9789812832245_0002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946006020025"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442858"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.55"},{"key":"ref22","article-title":"The SCIP optimization suite 7.0","author":"gamrath","year":"2020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102408353"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0692"},{"key":"ref2","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851748"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107786134"},{"key":"ref18","volume":"23","author":"szeg\u00f6","year":"1939","journal-title":"Orthogonal Polynomials"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2014.02.004"},{"key":"ref7","author":"grassl","year":"2007","journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3842\/SIGMA.2011.119"},{"key":"ref4","first-page":"6","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"delsarte","year":"1973","journal-title":"Philips Res Rep Suppl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref6","first-page":"51:1","article-title":"A complete linear programming hierarchy for linear codes","author":"coregliano","year":"2022","journal-title":"Proc 13th Innov Theor Comput Sci Conf (ITCS)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/056\/02"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10106509\/10018310.pdf?arnumber=10018310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T14:41:50Z","timestamp":1683556910000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10018310\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":23,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3236660","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}