{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T06:02:45Z","timestamp":1773295365135,"version":"3.50.1"},"reference-count":7,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"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":[[1985,5]]},"DOI":"10.1109\/tit.1985.1057038","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"378-384","source":"Crossref","is-referenced-by-count":25,"title":["A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm"],"prefix":"10.1109","volume":"31","author":[{"given":"L.","family":"Levitin","sequence":"first","affiliation":[]},{"given":"C.","family":"Hartmann","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056419"},{"key":"ref3","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref6","author":"cohen","year":"1981","journal-title":"private communication"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056678"},{"key":"ref7","author":"levitin","year":"1983","journal-title":"A new approach to the general minimum distance decoding problem The zero-neighbors algorithm"},{"key":"ref2","author":"peterson","year":"1961","journal-title":"Error-Correcting Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22748\/01057038.pdf?arnumber=1057038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:44Z","timestamp":1753121264000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1057038\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":7,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.1985.1057038","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}