{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T15:49:26Z","timestamp":1687362566302},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":9239,"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":[[1988,5]]},"DOI":"10.1016\/0097-3165(88)90078-7","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"104-119","source":"Crossref","is-referenced-by-count":10,"title":["On minimum weight codewords in QR codes"],"prefix":"10.1016","volume":"48","author":[{"given":"Donald W","family":"Newhart","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(88)90078-7_BIB1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","article-title":"New 5-designs","volume":"6","author":"Assmus","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0097-3165(88)90078-7_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(72)90021-0","article-title":"On weights in quadratic-residue codes","volume":"3","author":"Assmus","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(88)90078-7_BIB3","article-title":"Some Codes Which Are Invariant Under a Doubly-Transitive Permutation Group","author":"Kasami","year":"1966","journal-title":"AFCRL-66-142, Scientific Report No. 6"},{"key":"10.1016\/0097-3165(88)90078-7_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0012-365X(82)90222-9","article-title":"Information sets in quadratic-residue codes","volume":"42","author":"Newhart","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(88)90078-7_BIB5","series-title":"Introduction to Error-Correcting Codes","author":"Press","year":"1982"},{"key":"10.1016\/0097-3165(88)90078-7_BIB6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/TIT.1986.1057188","article-title":"On MDS extensions of generalized Reed-Solomon codes","volume":"32","author":"Seroussi","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0097-3165(88)90078-7_BIB7","series-title":"Algebraic Number Theory","author":"Stewart","year":"1979"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316588900787?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316588900787?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:23:25Z","timestamp":1549099405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316588900787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["0097316588900787"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(88)90078-7","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}