{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:25:31Z","timestamp":1775053531190,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0012-365x(02)00820-8","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"377-385","source":"Crossref","is-referenced-by-count":22,"title":["Extendability of linear codes over GF(q) with minimum distance d, gcd(d,q)=1"],"prefix":"10.1016","volume":"266","author":[{"given":"Tatsuya","family":"Maruta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00820-8_BIB1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF00181559","article-title":"Blocking sets and partial spreads in finite projective spaces","volume":"9","author":"Beutelspacher","year":"1980","journal-title":"Geom. Dedicata"},{"key":"10.1016\/S0012-365X(02)00820-8_BIB2","unstructured":"U. Heim, On t-blocking sets in projective spaces, unpublished."},{"key":"10.1016\/S0012-365X(02)00820-8_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008319024396","article-title":"An extension theorem for linear codes","volume":"17","author":"Hill","year":"1999","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/S0012-365X(02)00820-8_BIB4","doi-asserted-by":"crossref","unstructured":"R. Hill, P. Lizak, Extensions of linear codes, Proceedings of the IEEE International Symposium on Information Theory, Whistler, Canada, 1995, p. 345.","DOI":"10.1109\/ISIT.1995.550332"},{"key":"10.1016\/S0012-365X(02)00820-8_BIB5","series-title":"Projective Geometries over Finite Fields","author":"Hirschfeld","year":"1998"},{"key":"10.1016\/S0012-365X(02)00820-8_BIB6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/ffta.2001.0296","article-title":"On the extendability of linear codes","volume":"7","author":"Maruta","year":"2001","journal-title":"Finite Fields Appl."},{"key":"10.1016\/S0012-365X(02)00820-8_BIB7","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1109\/18.850691","article-title":"Adding a parity check bit","volume":"46","author":"Simonis","year":"2000","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008208?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:22:53Z","timestamp":1553775773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0012365X02008208"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00820-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}