{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:28Z","timestamp":1773377008361,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":["222\/19,1713\/20,2369\/24"],"award-info":[{"award-number":["222\/19,1713\/20,2369\/24"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195442","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["On Nearly Perfect Covering Codes"],"prefix":"10.1109","author":[{"given":"Avital","family":"Boruchovsky","sequence":"first","affiliation":[{"name":"Technion,Computer Science Department,Haifa,Israel,3200003"}]},{"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[{"name":"Technion,Computer Science Department,Haifa,Israel,3200003"}]},{"given":"Ron M.","family":"Roth","sequence":"additional","affiliation":[{"name":"Technion,Computer Science Department,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref1","first-page":"8","article-title":"On intersection of perfect binary codes","volume":"71","author":"Avgustinovich","year":"2005","journal-title":"Bayreuther Mathematische Schriften"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-005-4982-8"},{"key":"ref3","volume-title":"On nearly perfect covering codes","author":"Boruchovsky","year":"2024"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.335887"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196309171"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SIBIRCON.2010.5555312"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref8","author":"MacWilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes, North-Holland, Amsterdam"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.335936"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.2632"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195442.pdf?arnumber=11195442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:58Z","timestamp":1773347398000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195442\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195442","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}