{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T09:28:55Z","timestamp":1762075735139},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":9329,"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":[[1988]]},"DOI":"10.1016\/0012-365x(88)90102-1","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T16:34:42Z","timestamp":1032280482000},"page":"219-231","source":"Crossref","is-referenced-by-count":16,"title":["Characterization of {2(q+1)+2,2;t,q}- min\u00b7hypers in PG(t, q) (t\u2a7e3,q\u2a7e5) and its applications to error-correcting codes"],"prefix":"10.1016","volume":"71","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Michel","family":"Deza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90102-1_BIB1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/TIT.1973.1054939","article-title":"A note on the Griesmer bound","volume":"19","author":"Baumert","year":"1973","journal-title":"Trans. Information Theory"},{"key":"10.1016\/0012-365X(88)90102-1_BIB2","series-title":"The Mathematical Theory of Coding","author":"Blake","year":"1975"},{"key":"10.1016\/0012-365X(88)90102-1_BIB3","first-page":"257","article-title":"On some connections between the design of experiments and information theory","volume":"38","author":"Bose","year":"1961","journal-title":"Bull. Inst. Int. Statist."},{"key":"10.1016\/0012-365X(88)90102-1_BIB4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1049\/el:19700293","article-title":"Linear binary anticode","volume":"6","author":"Farrell","year":"1970","journal-title":"Electron. Lett."},{"key":"10.1016\/0012-365X(88)90102-1_BIB5","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","article-title":"A bound for error-correcting codes","volume":"4","author":"Griesmer","year":"1960","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0012-365X(88)90102-1_BIB6","first-page":"1","article-title":"Characterization resp. nonexistence of certain q-ary linear codes attaining the Griesmer bound","volume":"22","author":"Hamada","year":"1985","journal-title":"Bull. Osaka Women's Univ."},{"key":"10.1016\/0012-365X(88)90102-1_BIB7","first-page":"1","article-title":"Characterization of min\u00b7hypers in a finite projective geometry and its applications to error-correcting codes","volume":"24","author":"Hamada","year":"1987","journal-title":"Bull. Osaka Women's Univ."},{"key":"10.1016\/0012-365X(88)90102-1_BIB8","unstructured":"N. Hamada, Characterization of {2(q+1), 2;t,q}-min\u00b7hypers and {2(q+ 1) + 1, 2;t, q}\u2212 min\u00b7hypers in a finite projective geometry. To appear in Bull. Osaka Women's Univ."},{"key":"10.1016\/0012-365X(88)90102-1_BIB9","unstructured":"N. Hamada, Characterization of {2\u03c5\u03bc + 1, 2\u03c5\u03bc;t, q}-min\u00b7hypers and {2\u03c5\u03bc + 1 + \u03c5\u03bc, 2\u03c5\u03bc + \u03c5\u03bc + 1;t, q}\u2212min\u00b7hypers and its applications to error-correcting codes. To appear in Graphs and Combinatorics 4."},{"key":"10.1016\/0012-365X(88)90102-1_BIB10","unstructured":"N. Hamada, Characterization of {(q+1)+2,1;t,q}\u2212min \u00b7 hypers and {2(q+1)+ 2,2;2,q}\u2212 min\u00b7hypers in a finite projective geometry. To appear in Graphs and Combinatorics 4."},{"key":"10.1016\/0012-365X(88)90102-1_BIB11","unstructured":"N. Hamada, Characterization of {\u03c5\u03bc + 1 + 2\u03c5\u03bc, \u03c5\u03bc + 2\u03c5\u03bc \u2013 1;t,q}\u2212min\u00b7hypers and its applications to error-correcting codes. To appear in Graphs and Combinatorics 4."},{"key":"10.1016\/0012-365X(88)90102-1_BIB12","first-page":"25","article-title":"Characterization of {12,2;2,4}\u2212min\u00b7hypers in a finite projective geometry PG(2,4)","volume":"24","author":"Hamada","year":"1987","journal-title":"Bull. Osaka Women's Univ."},{"key":"10.1016\/0012-365X(88)90102-1_BIB13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0097-3165(78)90027-4","article-title":"On a geometrical method of construction of maximal t-linearly independent sets","volume":"25","author":"Hamada","year":"1978","journal-title":"J. Combinatorial Theory (A)"},{"key":"10.1016\/0012-365X(88)90102-1_BIB14","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\/0012-365X(88)90102-1_BIB15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0195-6698(82)80026-7","article-title":"Construction of optimal linear codes using flats and spreads in a finite projective geometry","volume":"3","author":"Hamada","year":"1982","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0012-365X(88)90102-1_BIB16","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/S0019-9958(81)90184-4","article-title":"A characterization of codes meeting the Griesmer bound","volume":"50","author":"Helleseth","year":"1981","journal-title":"Inf. and Control"},{"key":"10.1016\/0012-365X(88)90102-1_BIB17","volume":"Vol. 16","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0012-365X(88)90102-1_BIB18","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":"Inf. and Control"},{"issue":"III","key":"10.1016\/0012-365X(88)90102-1_BIB19","first-page":"35","article-title":"On an {f,m;t,s}\u2212max\u00b7hyper and a {k,m;t,s}\u2212min \u00b7 hyper in a finite projective geometry PG(t,s)","volume":"31","author":"Tamari","year":"1981","journal-title":"Bull. Fukuoka University of Education"},{"key":"10.1016\/0012-365X(88)90102-1_BIB20","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(84)90116-X","article-title":"On linear codes which attain the Solomon-Stiffler bound","volume":"49","author":"Tamari","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90102-1_BIB21","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","article-title":"On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound","volume":"44","author":"van Tilborg","year":"1980","journal-title":"Inf. and Control"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T17:22:25Z","timestamp":1554830545000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88901021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988]]}},"alternative-id":["0012365X88901021"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90102-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988]]}}}