{"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":1762075735008},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"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":[[1989,9]]},"DOI":"10.1016\/0012-365x(89)90353-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"75-87","source":"Crossref","is-referenced-by-count":8,"title":["A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min\u00b7hyper in a finite projective geometry"],"prefix":"10.1016","volume":"77","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Michel","family":"Deza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90353-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(89)90353-1_BIB2","series-title":"Optimization Methods and Their Applications","first-page":"100","article-title":"A conjecture on the Griesmer bound","author":"Belov","year":"1974"},{"key":"10.1016\/0012-365X(89)90353-1_BIB3","series-title":"The Mathematical Theory of Coding","author":"Blake","year":"1975"},{"key":"10.1016\/0012-365X(89)90353-1_BIB4","first-page":"107","article-title":"Mathematical theory of the symmetrical factorial design","volume":"8","author":"Bose","year":"1947","journal-title":"Sankhya"},{"key":"10.1016\/0012-365X(89)90353-1_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. Int. Statist."},{"key":"10.1016\/0012-365X(89)90353-1_BIB6","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(89)90353-1_BIB7","series-title":"Introduction to the Theory of Groups of Finite Groups","author":"Carmichael","year":"1956"},{"key":"10.1016\/0012-365X(89)90353-1_BIB8","series-title":"Finite Geometries","author":"Dembowski","year":"1968"},{"key":"10.1016\/0012-365X(89)90353-1_BIB9","first-page":"751","article-title":"Characterization theorems for two classes of codes meeting the Griesmer bound","volume":"35","author":"Dodunekov","year":"1982","journal-title":"Comptes rendus de l'Acad\u00e9mie bulgare des Sciences"},{"key":"10.1016\/0012-365X(89)90353-1_BIB10","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(89)90353-1_BIB11","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(89)90353-1_BIB12","first-page":"1","volume":"22","author":"Hamada","year":"1985"},{"key":"10.1016\/0012-365X(89)90353-1_BIB13","unstructured":"N. Hamada, A characterization of some (n, k, d; q)-codes meeting the Griesmer bound using a min\u00b7hyper in a finite projective geometry, to appear in Annals of Discrete Mathematics (Combinatorial Aspects of Design Experiments)."},{"key":"10.1016\/0012-365X(89)90353-1_BIB14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01788659","article-title":"Characterization of {(q+1)+2, 1;t, q}-min\u00b7hypers and {2(q+1)+2, 2; 2, q}-min\u00b7hypers in a finite projective geometry","volume":"5","author":"Hamada","year":"1989","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/0012-365X(89)90353-1_BIB15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01788665","article-title":"Characterization of {\u03c5\u03bc+1+2\u03c5\u03bc, \u03c5 > \u03bc+2\u03c5\u03bc\u22121;t, q}-min\u00b7hypers and its applications to error-correct ing codes","volume":"5","author":"Hamada","year":"1989","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/0012-365X(89)90353-1_BIB16","first-page":"1","volume":"24","author":"Hamada","year":"1987"},{"key":"10.1016\/0012-365X(89)90353-1_BIB17","first-page":"25","volume":"24","author":"Hamada","year":"1987"},{"key":"10.1016\/0012-365X(89)90353-1_BIB18","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}-min\u00b7hypers in PG(t, q) (t\u2a7e3, q\u2a7e5) and its applications to error-correcti ing codes","volume":"71","author":"Hamada","year":"1988","journal-title":"Discrete Mathematics"},{"key":"10.1016\/0012-365X(89)90353-1_BIB19","unstructured":"N. Hamada and M. Deza, Characterization of {2\u03c5\u03b1+1+2\u03c5\u03b2+1, 2\u03c5\u03b1+2\u03c5\u03b2 t, q}-min\u00b7hypers in PG(t, q) (t\u2a7e2, q\u2a7e5 and 0\u2a7d\u03b1<\u03b2<t) and its applications to error-correcting codes, submitted."},{"key":"10.1016\/0012-365X(89)90353-1_BIB20","first-page":"321","article-title":"Characterization of (n, k, d; q)-codes meeting the Griesmer bound for given integers k\u2a7e3, q\u2a7e5 and d =qk\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(89)90353-1_BIB21","doi-asserted-by":"crossref","DOI":"10.1016\/0378-3758(89)90098-0","article-title":"A characterization of {\u03c5\u03bc+1+\u03b5, \u03c5\u03bc; y, q}-min \u00b7 hypers and its applications to error-correcting codes and factorial designs","volume":"22","author":"Hamada","year":"1989","journal-title":"J. Statistical Planning and Inference"},{"issue":"A","key":"10.1016\/0012-365X(89)90353-1_BIB22","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(89)90353-1_BIB23","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":"Annals of Discrete Mathemat."},{"key":"10.1016\/0012-365X(89)90353-1_BIB24","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. Combinator."},{"key":"10.1016\/0012-365X(89)90353-1_BIB25","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/S0019-9958(81)90184-4","article-title":"A characterization of codes meeting the Griesner bound","volume":"50","author":"Helleseth","year":"1981","journal-title":"Information and Control"},{"key":"10.1016\/0012-365X(89)90353-1_BIB26","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/TIT.1983.1056658","article-title":"New construction of codes meeting the Griesmer bound","volume":"IT-29","author":"Helleseth","year":"1983","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0012-365X(89)90353-1_BIB27","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":"IT-27","author":"Helleseth","year":"1981","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/0012-365X(89)90353-1_BIB28","series-title":"Projective Planes","author":"Hughes","year":"1973"},{"key":"10.1016\/0012-365X(89)90353-1_BIB29","volume":"Vol. 16","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0012-365X(89)90353-1_BIB30","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":"Information and Control"},{"key":"10.1016\/0012-365X(89)90353-1_BIB31","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. Statistical Planning and Inference"},{"issue":"III","key":"10.1016\/0012-365X(89)90353-1_BIB32","first-page":"35","article-title":"On an {f, m; t, s}-max \u00b7 hyper and a {k, m; t, s}-min \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(89)90353-1_BIB33","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 Mathematics"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89903531?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89903531?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:40Z","timestamp":1555134700000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89903531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0012365X89903531"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90353-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}