{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:52Z","timestamp":1772283532529,"version":"3.50.1"},"reference-count":83,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7351,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0012-365x(93)90404-h","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"229-268","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":68,"title":["A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry"],"prefix":"10.1016","volume":"116","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90404-H_BIB1","first-page":"553","article-title":"Sui {k;n}-archi di un piano linear finito","volume":"11","author":"Barlotti","year":"1956","journal-title":"Boll. Un. Mat. Ital."},{"key":"10.1016\/0012-365X(93)90404-H_BIB2","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":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(93)90404-H_BIB3","series-title":"The Mathematical Theory of Coding","author":"Blake","year":"1975"},{"key":"10.1016\/0012-365X(93)90404-H_BIB4","first-page":"107","article-title":"Mathematical theory of the symmetrical factorial design","volume":"8","author":"Bose","year":"1947","journal-title":"Sankhy\u0101"},{"key":"10.1016\/0012-365X(93)90404-H_BIB5","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. Internat. Statist."},{"key":"10.1016\/0012-365X(93)90404-H_BIB6","first-page":"21","article-title":"On the problem of confounding in the general symmetrical factorial design","volume":"5","author":"Bose","year":"1940","journal-title":"Sankhy\u0101"},{"key":"10.1016\/0012-365X(93)90404-H_BIB7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0019-9958(60)90287-4","article-title":"On a class of error correcting binary group codes","volume":"3","author":"Bose","year":"1960","journal-title":"Inform. and Control"},{"key":"10.1016\/0012-365X(93)90404-H_BIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0019-9958(60)90870-6","article-title":"Further results on error correcting binary group codes","volume":"3","author":"Bose","year":"1960","journal-title":"Inform. and Control"},{"key":"10.1016\/0012-365X(93)90404-H_BIB9","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1214\/aoms\/1177703764","article-title":"On a bound useful in the theory of factorial designs and error correcting codes","volume":"35","author":"Bose","year":"1964","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0012-365X(93)90404-H_BIB10","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(93)90404-H_BIB11","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1214\/aoms\/1177729387","article-title":"Orthogonal arrays of index unity","volume":"23","author":"Bush","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0012-365X(93)90404-H_BIB12","series-title":"Introduction to the Theory of Groups of Finite Order","author":"Carmichael","year":"1956"},{"key":"10.1016\/0012-365X(93)90404-H_BIB13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(84)90180-8","article-title":"On the uniqueness of (q+1)-arcs of PG(4,q), q=2h, h\u2a7e3","volume":"48","author":"Casse","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90404-H_BIB14","series-title":"Finite Geometries","author":"Dembowski","year":"1968"},{"key":"10.1016\/0012-365X(93)90404-H_BIB15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0021-9800(69)80095-5","article-title":"Some maximal arcs in finite projective planes","volume":"6","author":"Denniston","year":"1969","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90404-H_BIB16","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/TIT.1987.1057363","article-title":"New bounds on binary linear codes of dimension eight","volume":"33","author":"Dodunekov","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(93)90404-H_BIB17","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1049\/el:19700293","article-title":"Linear binary anticodes","volume":"6","author":"Farrell","year":"1970","journal-title":"Electron. Lett."},{"key":"10.1016\/0012-365X(93)90404-H_BIB18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1111\/j.1469-1809.1943.tb02333.x","article-title":"The fractional replication of factorial arrangements","volume":"12","author":"Finney","year":"1945","journal-title":"Ann. Eugen. Lond."},{"key":"10.1016\/0012-365X(93)90404-H_BIB19","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1111\/j.1469-1809.1941.tb02298.x","article-title":"The theory of confounding in factorial experiments in relation to the theory of groups","volume":"11","author":"Fisher","year":"1942","journal-title":"Ann. Eugen. Lond."},{"key":"10.1016\/0012-365X(93)90404-H_BIB20","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1111\/j.1469-1809.1943.tb02332.x","article-title":"A system of confounding for factors with more than two alternatives giving completely orthogonal cubes and higher power","volume":"12","author":"Fisher","year":"1945","journal-title":"Ann. Eugen. Lond."},{"key":"10.1016\/0012-365X(93)90404-H_BIB21","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1002\/j.1538-7305.1952.tb01393.x","article-title":"A comparison of signaling alphabets","volume":"31","author":"Gilbert","year":"1952","journal-title":"Bell. System Tech. J."},{"key":"10.1016\/0012-365X(93)90404-H_BIB22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0012-365X(86)90067-1","article-title":"The non-classical 10-arc of PG(4,9)","volume":"59","author":"Glynn","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90404-H_BIB23","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(93)90404-H_BIB24","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0097-3165(73)90034-4","article-title":"On maximal t-linearly independent sets","volume":"15","author":"Gulati","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90404-H_BIB25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1111\/j.2517-6161.1970.tb00822.x","article-title":"On a bound useful in the theory of symmetrical factorial design","volume":"32","author":"Gulati","year":"1970","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"10.1016\/0012-365X(93)90404-H_BIB26","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0097-3165(73)90035-6","article-title":"Maximal sets of points in finite projective space, no t-linearly dependent","volume":"15","author":"Gulati","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90404-H_BIB27","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(93)90404-H_BIB28","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(93)90404-H_BIB29","first-page":"25","article-title":"Characterization of {12,2;2,4}-minihypers 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(93)90404-H_BIB30","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(93)90404-H_BIB31","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01788665","article-title":"Characterization of {v\u03bc+1+2v\u03bc,v\u03bc+2v\u03bc-1;t,q}-minihypers and its applications to error-correcting codes","volume":"5","author":"Hamada","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(93)90404-H_BIB32","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\u2a7e3,q\u2a7e5) and its applications to error-correcting codes","volume":"71","author":"Hamada","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90404-H_BIB33","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=qk-1-q\u03b1-q\u03b2-q\u03b3(0\u2a7d\u03b1\u2a7dgb<\u03b3<k-1 or 0\u2a7d\u03b1<\u03b2\u2a7d\u03b3<k\u22121)","volume":"16","author":"Hamada","year":"1988"},{"key":"10.1016\/0012-365X(93)90404-H_BIB34","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(89)90353-1","article-title":"A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a minihyper in a finite projective geometry","volume":"77","author":"Hamada","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90404-H_BIB35","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0378-3758(89)90098-0","article-title":"A characterization of {v\u03bc+1+\u03b5,v\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(93)90404-H_BIB36","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(91)90214-M","article-title":"A characterization of {2v\u03bc+1+2v\u03b2+1,2v\u03b1+2v\u03b2;t,q}-minihypers in PG(t,q)(t\u2a7e2,q\u2a7e5 and 0\u2a7d\u03b1<\u03b2<t) and its applications to error-correcting codes","volume":"93","author":"Hamada","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90404-H_BIB37","first-page":"49","article-title":"A characterization of some {3v2,3v1;t,q}-minihypers and some {2v2+v\u03b3+1,2v1+v\u03b3;t, q}-minihypers (q=3 or 4, 2\u2a7d\u03b3<) and its application to error-correcting codes","volume":"27","author":"Hamada","year":"1990","journal-title":"Bull. Osaka Women's Univ."},{"key":"10.1016\/0012-365X(93)90404-H_BIB38","unstructured":"N. Hamada and T. Helleseth, A characterization of some {3v\u03bc+1,3v\u03bc;k-1,q}-minihypers and some (n,k,qk-1-3q\u03bc;q)-codes (k\u2a7e3,q\u2a7e5, 1\u2a7d\u03bc<k-1) meeting the Griesmer bound, submitted."},{"key":"10.1016\/0012-365X(93)90404-H_BIB39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(92)90625-P","article-title":"A characterization of some {2v\u03b1+1}+v\u03b3+1,2v\u03b1+v\u03b3;k-1,3}-minihypers and some (n,k,3k-1-2\u00b73\u03b1-3\u03b3;3)-codes (k\u2a7e3,0\u2a7d\u03b1<\u03b3<k-1) meeting the Griesmer bound","volume":"104","author":"Hamada","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90404-H_BIB40","unstructured":"N. Hamada and T. Helleseth, A characterization of some {v2+2v3,v1+2v2;k-1,3}-minihypers and some (vk-30,k,3k-1-21;3)-codes meeting the Griesmer bound, J. Statist. Plann. Inference, to appear."},{"key":"10.1016\/0012-365X(93)90404-H_BIB41","unstructured":"N. Hamada and T. Helleseth, A characterization of some minihypers in PG(t,3) and some ternary codes meeting the Griesmer bound, submitted."},{"key":"10.1016\/0012-365X(93)90404-H_BIB42","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(93)90404-H_BIB43","first-page":"231","article-title":"A characterization of some linear codes over GF(4) meeting the Griesmer bound","volume":"37","author":"Hamada","year":"1992","journal-title":"Mathematica Japonica"},{"key":"10.1016\/0012-365X(93)90404-H_BIB44","first-page":"43","article-title":"On a characterization of some minihypers in PG(t,q) (q= 3 or 4) and its applications to error-correcting codes","volume":"1518","author":"Hamada","year":"1992"},{"key":"10.1016\/0012-365X(93)90404-H_BIB45","unstructured":"N. Hamada, T. Helleseth and \u00d8. Ytrehus, Characterization of {2(q+1)+2,2;t,q}-minihypers in PG(t,q) (t\u2a7e3, q\u03f5{3,4}), Discrete Math., to appear."},{"key":"10.1016\/0012-365X(93)90404-H_BIB46","unstructured":"N. Hamada, T. Helleseth and \u00d8. Ytrehus, There are exactly two nonequivalent [20,5,12;3]-codes, Ars Combin., to appear."},{"key":"10.1016\/0012-365X(93)90404-H_BIB47","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 Ser. A"},{"key":"10.1016\/0012-365X(93)90404-H_BIB48","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(93)90404-H_BIB49","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(93)90404-H_BIB50","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","article-title":"Error detection and error correcting codes","volume":"29","author":"Hamming","year":"1950","journal-title":"Bell. System. Tech. J."},{"key":"10.1016\/0012-365X(93)90404-H_BIB51","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(93)90404-H_BIB52","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TIT.1983.1056658","article-title":"New construction of codes meeting the Griesmer bound","volume":"29","author":"Helleseth","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(93)90404-H_BIB53","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1109\/TIT.1981.1056405","article-title":"A new class of codes meeting the Griesmer bound","volume":"27","author":"Helleseth","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(93)90404-H_BIB54","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(93)90404-H_BIB55","first-page":"61","article-title":"Some optimal ternary linear codes","volume":"25","author":"Hill","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)90404-H_BIB56","series-title":"Projective Geometry over Finite Fields","author":"Hirschfeld","year":"1979"},{"key":"10.1016\/0012-365X(93)90404-H_BIB57","series-title":"Projective Planes","author":"Hughes","year":"1973"},{"key":"10.1016\/0012-365X(93)90404-H_BIB58","first-page":"91","article-title":"On fractional replication of the general symmetrical factorial design","volume":"1","author":"Kishen","year":"1948","journal-title":"J. Indian Soc. Agricultural Statist."},{"key":"10.1016\/0012-365X(93)90404-H_BIB59","article-title":"The Theory of Error-Correcting Codes","volume":"Vol. 16","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0012-365X(93)90404-H_BIB60","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0021-8693(66)90024-X","article-title":"A vector-space packing problem","volume":"4","author":"Maneri","year":"1966","journal-title":"J. Algebra"},{"key":"10.1016\/0012-365X(93)90404-H_BIB61","first-page":"481","article-title":"A characterization up to isomorphism of some classes of codes meeting the Griesmer bound","volume":"37","author":"Manev","year":"1984","journal-title":"Comptes rendues de l'Academie bulgare des Sciences"},{"key":"10.1016\/0012-365X(93)90404-H_BIB62","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1002\/j.1538-7305.1959.tb01595.x","article-title":"Error-correcting codes-a linear programming approach","volume":"38","author":"McCluskey","year":"1959","journal-title":"Bell. System Tech. J."},{"key":"10.1016\/0012-365X(93)90404-H_BIB63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(78)90026-2","article-title":"Lower bounds on mt(r,s)","volume":"25","author":"Mukuhopadhyay","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90404-H_BIB64","first-page":"149","article-title":"Sul massino ordine delle calotte in S4,3","volume":"25","author":"Pellegrino","year":"1971","journal-title":"Matematiche"},{"key":"10.1016\/0012-365X(93)90404-H_BIB65","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0021-9800(68)80067-5","article-title":"On the uniqueness of the Golay codes","volume":"5","author":"Pless","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(93)90404-H_BIB66","series-title":"Error-Correcting Codes","author":"Peterson","year":"1961"},{"key":"10.1016\/0012-365X(93)90404-H_BIB67","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","article-title":"Binary codes with specified minimum distances","volume":"6","author":"Plotkin","year":"1960","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(93)90404-H_BIB68","first-page":"134","article-title":"Some remarks concerning curves of the second degree in a finite plane","author":"Qvist","year":"1952","journal-title":"Ann. Acad. Sci. Fenn. Ser. AI"},{"key":"10.1016\/0012-365X(93)90404-H_BIB69","series-title":"Construction and Combinatorial Problems in Design of Experiments","author":"Raghavarao","year":"1971"},{"key":"10.1016\/0012-365X(93)90404-H_BIB70","doi-asserted-by":"crossref","first-page":"128","DOI":"10.2307\/2983576","article-title":"Factorial experiments derivable from combinatorial arrangements of arrays","volume":"9","author":"Rao","year":"1947","journal-title":"Supp. J. Roy. Stat. Soc."},{"key":"10.1016\/0012-365X(93)90404-H_BIB71","article-title":"Introduction to Galois geometries","volume":"7","author":"Segre","year":"1967","journal-title":"Atti. Acad. Naz. Lincei. Mem. Ser. V III"},{"key":"10.1016\/0012-365X(93)90404-H_BIB72","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(93)90404-H_BIB73","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"},{"issue":"III","key":"10.1016\/0012-365X(93)90404-H_BIB74","first-page":"35","article-title":"On an {f,m;t,q}-maxhyper and a {k,m;t,s}-minihyper in a finite projective geometry PG(t,s)","volume":"31","author":"Tamari","year":"1981","journal-title":"Bull. Fukuoka Univ. Ed."},{"key":"10.1016\/0012-365X(93)90404-H_BIB75","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(93)90404-H_BIB76","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0097-3165(75)80012-4","article-title":"Some results concerning {(q + 1)(n \u2212 1);n}-arcs and {q + 1)(n \u22121) + 1;n}-arcs in finite projective plane of order q","volume":"19","author":"Thas","year":"1975","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(93)90404-H_BIB77","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0124010","article-title":"On the nonexistence of perfect codes over finite fields","volume":"24","author":"Tiet\u00e4v\u00e4inen","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(93)90404-H_BIB78","first-page":"3","article-title":"There are no unknown perfect binary codes","volume":"148","author":"Tiet\u00e4v\u00e4inen","year":"1971","journal-title":"Ann. Univ. Turku. Ser. A"},{"key":"10.1016\/0012-365X(93)90404-H_BIB79","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"},{"key":"10.1016\/0012-365X(93)90404-H_BIB80","first-page":"739","article-title":"Estimate of the number of signals in error-correcting codes","volume":"117","author":"Varshamov","year":"1957","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0012-365X(93)90404-H_BIB81","series-title":"Coding Theorems of Information Theory","author":"Wolfowitz","year":"1964"},{"issue":"A-I","key":"10.1016\/0012-365X(93)90404-H_BIB82","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."},{"key":"10.1016\/0012-365X(93)90404-H_BIB83","article-title":"A survey of recent work on characterization of minihypers in PG(t,q) and nonbinary linear codes meeting the Griesmer bound","volume":"18","author":"Hamada","year":"1993","journal-title":"J.Combin. Inform. Syst. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390404H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390404H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T07:00:05Z","timestamp":1762066805000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390404H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":83,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0012365X9390404H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90404-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(93)90404-H","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}