{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:10:49Z","timestamp":1784301049345,"version":"3.55.0"},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1968,7,1]],"date-time":"1968-07-01T00:00:00Z","timestamp":-47433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1968,7,1]],"date-time":"1968-07-01T00:00:00Z","timestamp":-47433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":16453,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1968,7]]},"DOI":"10.1016\/s0019-9958(68)90779-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T01:51:40Z","timestamp":1103075500000},"page":"46-52","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["An upper bound on minimum distance for a k-ary code"],"prefix":"10.1016","volume":"13","author":[{"given":"A.D.","family":"Wyner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.L.","family":"Graham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(68)90779-1_bib1","series-title":"Lectures at Harvard University","author":"Beurling","year":"1950"},{"key":"10.1016\/S0019-9958(68)90779-1_bib2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TIT.1958.1057446","article-title":"Some properties of nonbinary error-correcting codes","volume":"IT-4","author":"Lee","year":"1958","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S0019-9958(68)90779-1_bib3","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","article-title":"Binary codes with specified minimum distance","volume":"IT-6","author":"Plotkin","year":"1960","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S0019-9958(68)90779-1_bib4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1090\/S0002-9947-1941-0004644-8","article-title":"Fourier-integrals and metric geometry","author":"von Neumann","year":"1941","journal-title":"Trans. of AMS"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868907791?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995868907791?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T04:28:31Z","timestamp":1758083311000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995868907791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,7]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1968,7]]}},"alternative-id":["S0019995868907791"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(68)90779-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1968,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An upper bound on minimum distance for a k-ary code","name":"articletitle","label":"Article Title"},{"value":"Information and Control","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0019-9958(68)90779-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1968 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}