{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:16Z","timestamp":1773377716907,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834432","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1963-1968","source":"Crossref","is-referenced-by-count":2,"title":["New Bounds on the Size of Binary Codes with Large Minimum Distance"],"prefix":"10.1109","author":[{"given":"James Chin-Jen","family":"Pang","sequence":"first","affiliation":[{"name":"University of Michgan,Department of Electrical Engineering and Computer Science,Ann Arbor,MI,USA,48109"}]},{"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"University of Michgan,Department of Electrical Engineering and Computer Science,Ann Arbor,MI,USA,48109"}]},{"given":"S. Sandeep","family":"Pradhan","sequence":"additional","affiliation":[{"name":"University of Michgan,Department of Electrical Engineering and Computer Science,Ann Arbor,MI,USA,48109"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831751"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928288"},{"key":"ref12","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref13","article-title":"Essential coding theory","author":"guruswami","year":"0"},{"key":"ref14","first-page":"531","article-title":"On mutual correlation of sequences","volume":"196","author":"sidel\u2019nikov","year":"1971","journal-title":"Doklady Akademii Nauk"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90709-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.612999"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref4","first-page":"101","article-title":"Codes for high-noise memoryless channels","author":"dumer","year":"2020","journal-title":"2020 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518274"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611452"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457589"},{"key":"ref8","article-title":"Bounds for unrestricted binary codes","author":"agrell","year":"0"},{"key":"ref7","article-title":"An update table of the best binary codes known","author":"litsyn","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989142"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CSCN.2016.7785170"},{"key":"ref9","author":"brouwer","year":"0"},{"key":"ref20","first-page":"vi","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":"ref22","author":"kahn","year":"1989","journal-title":"The Influence Variables Boolean Functions"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9128-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102408353"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834432.pdf?arnumber=9834432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:57Z","timestamp":1773347697000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834432\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834432","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}