{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T09:28:44Z","timestamp":1762075724205},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"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":[[1992,6]]},"DOI":"10.1016\/0012-365x(92)90625-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"67-81","source":"Crossref","is-referenced-by-count":9,"title":["A characterization of some {2\u03c5\u03b1+1+\u03c5\u03b3+1, 2\u03c5\u03b1+\u03c5\u03b3; k\u22121, 3}- minihypers and some (n,k, 3k\u22121 \u2212 2 \u00b7 3\u03b1 \u2212 3\u03b3; 3)-codes (k\u2a7e3, 0\u2a7d\u03b1&lt;\u03b3&lt;k\u22121) meeting the Griesmer bound"],"prefix":"10.1016","volume":"104","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Tor","family":"Helleseth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90625-P_BIB1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0195-6698(87)80042-2","article-title":"Arcs and blocking sets II","volume":"8","author":"Bruen","year":"1987","journal-title":"European J. Combin."},{"key":"10.1016\/0012-365X(92)90625-P_BIB2","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(92)90625-P_BIB3","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(92)90625-P_BIB4","first-page":"1","article-title":"Characterization of minihypers 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(92)90625-P_BIB5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01788659","article-title":"Characterization of {(q+1)+2, 1; t, q)}-minihypers and {2(q+1) + 2, 2; 2, q)}-miihypers in a finite projective geom etry","volume":"5","author":"Hamada","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(92)90625-P_BIB6","doi-asserted-by":"crossref","unstructured":"N. Hamada, A characterization of some (n, k, d; q)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(93)90404-H"},{"key":"10.1016\/0012-365X(92)90625-P_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(88)90102-1","article-title":"Characterization of {2(q+1)+2, 2; t, q)}-minihypers in PG(t,q)(t \u2a7e 3, q \u2a7e 5) and its applications to error-co rrecting codes","volume":"71","author":"Hamada","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90625-P_BIB8","first-page":"321","article-title":"A characterization of some (n, k, d; q)-codes meeting the Griesmer bound for given integers k\u2a7e3, q\u2a7e5 and d = q k\u22121\u2212q\u03b1\u2212q\u03b2\u2212q\u03b3 (0\u2a7d\u03b1\u2a7d\u03b2<\u03b3<k\u22121 or 0\u2a7d\u03b1<\u03b2\u2a7d\u03b3<k\u22121)","volume":"16","author":"Hamada","year":"1988","journal-title":"Bull. Inst. Math. Acad. Sinica"},{"key":"10.1016\/0012-365X(92)90625-P_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0378-3758(89)90098-0","article-title":"A characterization of {\u03c5\u03bc+1+\u03f5, \u03c5\u03bc; t, q}-minihypers and its applications to error-correcting codes and factorial de signs","volume":"22","author":"Hamada","year":"1989","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/0012-365X(92)90625-P_BIB10","unstructured":"N. Hamada and T. Helleseth, A characterization of some {3\u03c5\u03bc+1, 3\u03c5\u03bc; k\u22121, q}-minihypers and some (n,k, qk\u22121\u22123q\u03bc; q)-codes (k\u2a7e3, q\u2a7e5, 1\u2a7d\u03bc<k\u22121) meeting the Griesmer bound, submitted."},{"key":"10.1016\/0012-365X(92)90625-P_BIB11","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/S0195-6698(13)80039-X","article-title":"A characterization of some minihypers in a finite projective geometry PG(t, 4)","volume":"11","author":"Hamada","year":"1990","journal-title":"European J. Combin."},{"key":"10.1016\/0012-365X(92)90625-P_BIB12","article-title":"A characterization of some {3\u03c52, 3\u03c51; t,q}-minihypers and some {2\u03c52+\u03c5\u03b3+1, 2\u03c51+\u03c5\u03b3; t,q};-minihypers (q = 3 or 4, 2\u2a7d\u03b3<t) and its applications to error-correcting codes","volume":"27","author":"Hamada","year":"1990"},{"issue":"A","key":"10.1016\/0012-365X(92)90625-P_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. Combin. Theory"},{"key":"10.1016\/0012-365X(92)90625-P_BIB14","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":"European J. Combin."},{"key":"10.1016\/0012-365X(92)90625-P_BIB15","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":"Inform. and Control"},{"key":"10.1016\/0012-365X(92)90625-P_BIB16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(78)90120-6","article-title":"Caps and codes","volume":"22","author":"Hill","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90625-P_BIB17","volume":"16","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0012-365X(92)90625-P_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":"Inform. and Control"},{"key":"10.1016\/0012-365X(92)90625-P_BIB19","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/0378-3758(81)90042-2","article-title":"A note on the construction of optimal linear codes","volume":"5","author":"Tamari","year":"1981","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/0012-365X(92)90625-P_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(92)90625-P_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":"Inform. and Control"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290625P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290625P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:44Z","timestamp":1555129604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9290625P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["0012365X9290625P"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90625-p","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}