{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T09:32:51Z","timestamp":1762075971560},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T00:00:00Z","timestamp":1378771200000},"content-version":"vor","delay-in-days":11424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1016\/s0195-6698(82)80026-7","type":"journal-article","created":{"date-parts":[[2013,9,9]],"date-time":"2013-09-09T08:31:00Z","timestamp":1378715460000},"page":"129-141","source":"Crossref","is-referenced-by-count":20,"title":["Construction of Optimal Linear Codes Using Flats and Spreads in a Finite Projective Geometry"],"prefix":"10.1016","volume":"3","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Fumikazu","family":"Tamari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(82)80026-7_bib1","series-title":"Algebraic Coding Theory","author":"Berlekamp","year":"1968"},{"key":"10.1016\/S0195-6698(82)80026-7_bib2","series-title":"The Mathematical Theory of Coding","author":"Blake","year":"1975"},{"key":"10.1016\/S0195-6698(82)80026-7_bib3","series-title":"Introduction to the Theory of Groups of Finite Order","author":"Carmichael","year":"1956"},{"key":"10.1016\/S0195-6698(82)80026-7_bib4","series-title":"Finite Geometries","author":"Dembowski","year":"1968"},{"key":"10.1016\/S0195-6698(82)80026-7_bib5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-5060(08)70702-7","article-title":"Construction of optimal codes and optimal fractional factorial designs using linear programming","volume":"6","author":"Hamada","year":"1980","journal-title":"Ann. Discrete Math"},{"key":"10.1016\/S0195-6698(82)80026-7_bib6","series-title":"Error Correcting Codes","author":"Peterson","year":"1972"},{"key":"10.1016\/S0195-6698(82)80026-7_bib7","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","article-title":"Algebraically punctured cyclic codes","volume":"8","author":"Solomon","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/S0195-6698(82)80026-7_bib8","first-page":"137","article-title":"On finite geometries and cyclically generated incomplete block designs","volume":"30","author":"Yamamoto","year":"1966","journal-title":"J. Sci. Hiroshima Univ. Ser. A-I"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669882800267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669882800267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T04:23:07Z","timestamp":1539404587000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669882800267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["S0195669882800267"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(82)80026-7","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}