{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:34:48Z","timestamp":1649190888653},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9451,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1016\/0166-218x(87)90046-1","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"95-98","source":"Crossref","is-referenced-by-count":5,"title":["Some lower bounds for constant weight codes"],"prefix":"10.1016","volume":"18","author":[{"given":"Iiro","family":"Honkala","sequence":"first","affiliation":[]},{"given":"Heikki","family":"H\u00e4m\u00e4l\u00e4inen","sequence":"additional","affiliation":[]},{"given":"Markku","family":"Kaikkonen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90046-1_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.1978.1055827","article-title":"Bounds for binary codes of length less than 25","volume":"23","author":"Best","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(87)90046-1_BIB2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","article-title":"Lower bounds for constant weight codes","volume":"26","author":"Graham","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(87)90046-1_BIB3","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0166-218X(87)90046-1_BIB4","article-title":"On Bounds on Codes","author":"van Pul","year":"1982"},{"key":"10.1016\/0166-218X(87)90046-1_BIB5","unstructured":"S.M. Rankinen, private communication."},{"key":"10.1016\/0166-218X(87)90046-1_BIB6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1986.1057187","article-title":"Lexicographic codes: error-correcting codes from game theory","volume":"32","author":"Conway","year":"1986","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:57:03Z","timestamp":1553947023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["0166218X87900461"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90046-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}