{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:30:11Z","timestamp":1754152211788,"version":"3.41.2"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"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":[[1983,5]]},"DOI":"10.1109\/tit.1983.1056677","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"349-351","source":"Crossref","is-referenced-by-count":17,"title":["Perfect codes hardly exist"],"prefix":"10.1109","volume":"29","author":[{"given":"M.","family":"Best","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb02410.x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1963.tb04003.x"},{"journal-title":"Some nonexistence proofs for perfect codes over arbitrary alphabets","year":"1977","author":"reuvers","key":"ref12"},{"journal-title":"The Uniqueness of the Nordstrom-Robinson and the Golay binary codes","year":"1973","author":"snover","key":"ref13"},{"journal-title":"There are no unknown perfect binary codes","year":"1971","author":"tiet\ufffdv\ufffdinen","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90047-3"},{"key":"ref3","first-page":"289","article-title":"Bounds for unrestricted codes, by linear programming","volume":"7","author":"delsarte","year":"1972","journal-title":"Philips Research Reports"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref5","first-page":"657","article-title":"Notes on digital coding","volume":"37","author":"golay","year":"1949","journal-title":"Proc IRE"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90028-3"},{"journal-title":"Nonexistence of nontrivial perfect codes in the case q = ppp e ? 3","year":"1979","author":"laakso","key":"ref7"},{"journal-title":"A contribution to the nonexistence of perfect codes","year":"1982","author":"best","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(77)90079-6"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-36657-7","volume":"201","author":"van lint","year":"1973","journal-title":"Coding Theory Lecture Notes in Mathematics"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22732\/01056677.pdf?arnumber=1056677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:35Z","timestamp":1753121255000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056677\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,5]]},"references-count":14,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056677","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1983,5]]}}}