{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:25:56Z","timestamp":1743049556220,"version":"3.40.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["921\/22"],"award-info":[{"award-number":["921\/22"]}],"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":[[2025,4]]},"DOI":"10.1109\/tit.2024.3504268","type":"journal-article","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T19:07:16Z","timestamp":1732216036000},"page":"2383-2388","source":"Crossref","is-referenced-by-count":0,"title":["On the Difficulty to Beat the First Linear Programming Bound for Binary Codes"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8643-7948","authenticated-orcid":false,"given":"Alex","family":"Samorodnitsky","sequence":"first","affiliation":[{"name":"School of Engineering and Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4135\/9781483388007.n5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2003.157.689"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2249-9"},{"key":"ref4","first-page":"6","article-title":"An algebraic approach to the association schemes of coding theory","volume-title":"Philips Res. Rep., Suppl.","volume":"10","author":"Delsarte","year":"1973"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139814782"},{"article-title":"Bounds for packings and designs in symmetric spaces","year":"2010","author":"Eidelstein","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/s0895480102408353"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"issue":"1","key":"ref9","first-page":"3","article-title":"Bounds for packings on the sphere and in the space","volume":"14","author":"Kabatyansky","year":"1978","journal-title":"Probl. Pered. Inform."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.412711"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4135\/9781483388007.n5"},{"key":"ref12","article-title":"Universal bounds for codes and designs","volume-title":"Handbook of Coding Theory","author":"Levenshtein","year":"1998"},{"key":"ref13","article-title":"An elementary proof of the first LP bound on the rate of binary codes","author":"Linial","year":"2023","journal-title":"arXiv:2303.16619"},{"volume-title":"The Theory of Error Correcting Codes","year":"1977","author":"MacWilliams","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref16","first-page":"327","article-title":"On Delsarte\u2019s linear programming bounds for binary codes","volume-title":"Proc. 46th Annu. IEEE Symp. Found. Comput. Sci. (FOCS)","author":"Navon"},{"issue":"11","key":"ref17","doi-asserted-by":"crossref","DOI":"10.1016\/j.jfa.2019.108280","article-title":"Improved log-sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube","volume":"277","author":"Polyanskiy","year":"2019","journal-title":"J. Funct. Anal."},{"key":"ref18","first-page":"9","article-title":"Application and generalization of the MacWilliams transform in coding theory","volume-title":"Proc. 15th Symp. Inform. Theory Benelux","author":"Rodemich"},{"key":"ref19","article-title":"Bounds for codes and designs in association schemes via formal Fourier transform","author":"Samorodnitsky","year":"2007","journal-title":"Unpublished"},{"key":"ref20","article-title":"A modified logarithmic Sobolev inequality for the Hamming cube and some applications","author":"Samorodnitsky","year":"2008","journal-title":"arXiv:0807.1679"},{"issue":"2","key":"ref21","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/s11856-023-2514-8","article-title":"One more proof of the first linear programming bound for binary codes and two conjectures","volume":"256","author":"Samorodnitsky","year":"2023","journal-title":"Isr. J. Math."}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10935829\/10759802.pdf?arnumber=10759802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:31:03Z","timestamp":1743042663000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10759802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":21,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3504268","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}