{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:35:24Z","timestamp":1648874124232},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":6468,"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":[[1995,11]]},"DOI":"10.1016\/0012-365x(94)00157-3","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T23:51:23Z","timestamp":1051228283000},"page":"59-67","source":"Crossref","is-referenced-by-count":1,"title":["A characterization of some {3v\u03bc + 1, 3v\u03bc; k - 1, q}-minihypers and some [n, k, qk-1 - 3q\u03bc; q]-codes (k \u2a7e 3, q \u2a7e 5, 1 \u2a7d \u03bc &lt; k - 1) meeting the Griesmer bound"],"prefix":"10.1016","volume":"146","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Tor","family":"Helleseth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00157-3_BIB1","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(94)00157-3_BIB2","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(94)00157-3_BIB3","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(94)00157-3_BIB4","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}-minihypers in a finite projective geometry","volume":"5","author":"Hamada","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(94)00157-3_BIB5","first-page":"229","article-title":"A characterization of some [n, k, d; q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry","volume":"116","author":"Hamada","year":"1993"},{"key":"10.1016\/0012-365X(94)00157-3_BIB6","first-page":"321","article-title":"A characterization of some (n, k, d; q)-codes meeting the Griesmer bound for given integers k \u2a7e 3, q \u2a7e 5 and d = qk-1 - q\u03b1 - q\u03b2 - qy (0 \u2a7d \u03b1 \u2a7d \u03b2 < \u03b3 < k - 1 or 0 \u2a7d \u03b1 < \u03b2 \u2a7d \u03b3 < k - 1)","volume":"16","author":"Hamada","year":"1988"},{"key":"10.1016\/0012-365X(94)00157-3_BIB7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0378-3758(89)90098-0","article-title":"A characterization of {\u03bd\u03bc + 1 + \u03f5, \u03bd\u03bc; t, q}-minihypers and its applications to error-correcting codes and factorial designs","volume":"22","author":"Hamada","year":"1989","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/0012-365X(94)00157-3_BIB8","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(94)00157-3_BIB9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0378-3758(93)90147-X","article-title":"A characterization of some {\u03bd2 + 2\u03bd3, \u03bd1 + 2\u03bd2; k - 1, 3}-minihypers and some (\u03bdk - 30, k, 3k - 1 - 21; 3)-codes meeting the Griesmer bound","volume":"34","author":"Hamada","year":"1993","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/0012-365X(94)00157-3_BIB10","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(94)00157-3_BIB11","first-page":"128","article-title":"A characterization of codes meeting the Griesmer bound","volume":"50","author":"Helleseth","year":"1981"},{"key":"10.1016\/0012-365X(94)00157-3_BIB12","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(94)00157-3_BIB13","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(94)00157-3_BIB14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(84)90116-X","article-title":"On linear codes which attain the Solomon\u2014Stiffler bound","volume":"49","author":"Tamari","year":"1984","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94001573?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94001573?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T23:28:16Z","timestamp":1555802896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94001573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["0012365X94001573"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00157-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}