{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T09:31:18Z","timestamp":1762075878030},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1007\/bf01788659","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T18:46:51Z","timestamp":1119206811000},"page":"63-81","source":"Crossref","is-referenced-by-count":14,"title":["Characterization of {(q + 1) + 2, 1;t, q}-min \u00b7 hypers and {2(q + 1) + 2, 2; 2,q}-min \u00b7 hypers in a Finite projective geometry"],"prefix":"10.1007","volume":"5","author":[{"given":"Noboru","family":"Hamada","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01788659_CR1","first-page":"257","volume":"38","author":"R.C. Bose","year":"1961","unstructured":"Bose, R.C.: On some connections between the design of experiments and information theory. Bull. Int. Stat. Inst.38, 257\u2013271 (1961)","journal-title":"Bull. Int. Stat. Inst."},{"key":"BF01788659_CR2","volume-title":"Introduction to the Theory of Groups of Finite Order","author":"R.D. Carmichael","year":"1956","unstructured":"Carmichael, R.D.: Introduction to the Theory of Groups of Finite Order. New York: Dover Publications 1956"},{"key":"BF01788659_CR3","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"J.H. Griesmer","year":"1960","unstructured":"Griesmer, J.H.: A bound for error-correcting codes. IBM J. Res. Dev.4, 532\u2013542 (1960)","journal-title":"IBM J. Res. Dev."},{"key":"BF01788659_CR4","first-page":"1","volume":"22","author":"N. Hamada","year":"1985","unstructured":"Hamada, N.: Characterization resp. nonexistence of certainq-ary linear codes attaining the Griesmer bound. Bull. Osaka Women's Univ.22, 1\u201347 (1985)","journal-title":"Bull. Osaka Women's Univ."},{"key":"BF01788659_CR5","unstructured":"Hamada, N.: Characterization of {2(q + 1), 2;t, q}-min \u00b7 hypers and {2(q + 1) + 1, 2;t, q}-min \u00b7 hypers in a finite projective geometry. Bull. Osaka Women's Univ.26 (to appear)"},{"key":"BF01788659_CR6","first-page":"1","volume":"24","author":"N. Hamada","year":"1987","unstructured":"Hamada, N.: Characterization of min \u00b7 hypers in a finite projective geometry and its applications to error-correcting codes. Bull. Osaka Women's Univ.24, 1\u201324 (1987)","journal-title":"Bull. Osaka Women's Univ."},{"key":"BF01788659_CR7","first-page":"25","volume":"24","author":"N. Hamada","year":"1987","unstructured":"Hamada, N.: Characterization of {12, 2; 2, 4}-min \u00b7 hypers in a finite projective geometry PG(2, 4). Bull. Osaka Women's Univ.24, 25\u201331 (1987)","journal-title":"Bull. Osaka Women's Univ."},{"key":"BF01788659_CR8","doi-asserted-by":"crossref","unstructured":"Hamada, N., Deza, M.: Characterization of {2(q + 1) + 2, 2;t, q}-min \u00b7 hypers in PG(t, q) (t \u2265 3, q \u2265 5) and its applications to error-correcting codes. Discrete Math.71, 219\u2013231","DOI":"10.1016\/0012-365X(88)90102-1"},{"key":"BF01788659_CR9","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0097-3165(78)90027-4","volume":"25","author":"N. Hamada","year":"1978","unstructured":"Hamada, N., Tamari, F.: On a geometrical method of construction of maximalt-linearly independent sets. J. Comb. Theory (A)25, 14\u201328 (1978)","journal-title":"J. Comb. Theory (A)"},{"key":"BF01788659_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-5060(08)70702-7","volume":"6","author":"N. Hamada","year":"1980","unstructured":"Hamada, N., Tamari, F.: Construction of optimal codes and optimal fractional factorial designs using linear programming. Ann. Discrete Math.6, 175\u2013188 (1980)","journal-title":"Ann. Discrete Math."},{"key":"BF01788659_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0195-6698(82)80026-7","volume":"3","author":"N. Hamada","year":"1982","unstructured":"Hamada, N., Tamari, F.: Construction of optimal linear codes using flats and spreads in a finite projective geometry. Europ. J. Comb.3, 129\u2013141 (1982)","journal-title":"Europ. J. Comb."},{"key":"BF01788659_CR12","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/S0019-9958(81)90184-4","volume":"50","author":"T. Helleseth","year":"1981","unstructured":"Helleseth, T.: A characterization of codes meeting the Griesmer bound. Inf. Control50, 128\u2013159 (1981)","journal-title":"Inf. Control"},{"key":"BF01788659_CR13","first-page":"16","volume-title":"The theory of error-correcting codes","author":"F. J. MacWilliams","year":"1977","unstructured":"MacWilliams, F. J., Sloane, N.J.A.: The theory of error-correcting codes. Amsterdam: North-Holland Mathematical Library 16 (1977)"},{"key":"BF01788659_CR14","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G. Solomon","year":"1965","unstructured":"Solomon, G., Stiffler, J.J.: Algebraically puncture cyclic codes. Inf. Control8, 170\u2013179 (1965)","journal-title":"Inf. Control"},{"key":"BF01788659_CR15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/0378-3758(81)90042-2","volume":"5","author":"F. Tamari","year":"1981","unstructured":"Tamari, F.: A note on the construction of optimal linear codes. J. Stat. Plann. Inference5, 405\u2013411 (1981)","journal-title":"J. Stat. Plann. Inference"},{"issue":"III","key":"BF01788659_CR16","first-page":"35","volume":"31","author":"F. Tamari","year":"1981","unstructured":"Tamari, F.: 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). Bull. Fukuoka Univ. Educ.31 (III, 35\u201343 (1981)","journal-title":"Bull. Fukuoka Univ. Educ."},{"key":"BF01788659_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(84)90116-X","volume":"49","author":"F. Tamari","year":"1984","unstructured":"Tamari, F.: On linear codes which attain the Solomon-Stiffler bound. Discrete Math.49, 179\u2013191 (1984)","journal-title":"Discrete Math."},{"key":"BF01788659_CR18","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/S0019-9958(80)90115-1","volume":"44","author":"H.C.A. Tilborg van","year":"1980","unstructured":"Tilborg, H.C.A. van: On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound. Inf. Control44, 16\u201335 (1980)","journal-title":"Inf. Control"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788659\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788659","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:56:51Z","timestamp":1557410211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["BF01788659"],"URL":"https:\/\/doi.org\/10.1007\/bf01788659","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}