{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T20:52:12Z","timestamp":1673211132450},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":4672,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1006\/jcta.1999.3053","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T13:38:25Z","timestamp":1032356305000},"page":"95-101","source":"Crossref","is-referenced-by-count":4,"title":["Lower Bound for the Linear Multiple Packing of the Binary Hamming Space"],"prefix":"10.1006","volume":"92","author":[{"given":"Volodia","family":"Blinovsky","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcta.1999.3053_RF1","series-title":"List Decoding for Noisy Channels","author":"Elias","year":"1957"},{"key":"10.1006\/jcta.1999.3053_RF2","first-page":"7","article-title":"Bounds for code in the case of list decoding of finite volume","volume":"22","author":"Blinovsky","year":"1986","journal-title":"Problems Inform. Transmission"},{"key":"10.1006\/jcta.1999.3053_RF3","series-title":"Asymptotic Combinatorial Coding Theory","author":"Blinovsky","year":"1997"},{"key":"10.1006\/jcta.1999.3053_RF4","first-page":"288","article-title":"Lower bound on error probability in fixed volume list decoding","volume":"27","author":"Blinovsky","year":"1991","journal-title":"Problems Inform. Transmission"},{"key":"10.1006\/jcta.1999.3053_RF5","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1006\/jcta.1999.3053_RF6","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/18.312186","article-title":"Improved lower bounds on the sizes of error-correcting codes for list decoding","author":"Wei","year":"1994","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316599930534?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316599930534?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T00:50:14Z","timestamp":1557363014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316599930534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0097316599930534"],"URL":"https:\/\/doi.org\/10.1006\/jcta.1999.3053","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}