{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:38:04Z","timestamp":1776847084087,"version":"3.51.2"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1980,11,1]],"date-time":"1980-11-01T00:00:00Z","timestamp":341884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1980,11,1]],"date-time":"1980-11-01T00:00:00Z","timestamp":341884800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1980,11,1]],"date-time":"1980-11-01T00:00:00Z","timestamp":341884800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1980,11]]},"DOI":"10.1109\/tit.1980.1056269","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"738-742","source":"Crossref","is-referenced-by-count":47,"title":["Binary codes with a minimum distance of four (Corresp.)"],"prefix":"10.1109","volume":"26","author":[{"given":"M.","family":"Best","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1971-081-3"},{"key":"ref11","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref12","first-page":"117","author":"sloane","year":"1977","journal-title":"Combinatorial Surveys"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054540"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055279"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055827"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90158-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057463"},{"key":"ref5","first-page":"272","volume":"27","author":"delsarte","year":"1972","journal-title":"Bounds for unrestricted codes by linear programming"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053779"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref2","author":"best","year":"1978","journal-title":"Binary Codes With Minimum Distance Four"},{"key":"ref1","author":"best","year":"1977","journal-title":"A[11 4 4]=35 or some new optimal constant weight codes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1968.26.131"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22717\/01056269.pdf?arnumber=1056269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:58:26Z","timestamp":1752775106000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,11]]},"references-count":14,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.1980.1056269","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,11]]}}}