{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T01:47:55Z","timestamp":1761788875754},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T00:00:00Z","timestamp":1221782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10623-008-9239-x","type":"journal-article","created":{"date-parts":[[2008,9,18]],"date-time":"2008-09-18T19:42:24Z","timestamp":1221766944000},"page":"9-20","source":"Crossref","is-referenced-by-count":4,"title":["A class of optimal linear codes of length one above the Griesmer bound"],"prefix":"10.1007","volume":"51","author":[{"given":"E. J.","family":"Cheon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,19]]},"reference":[{"key":"9239_CR1","first-page":"225","volume":"37","author":"E.J. Cheon","year":"2007","unstructured":"Cheon E.J.: On the upper bound of the minimum length of 5-dimensional linear codes. Aust. J. Combin. 37, 225\u2013232 (2007)","journal-title":"Aust. J. Combin."},{"key":"9239_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10623-007-9070-9","volume":"43","author":"E.J. Cheon","year":"2007","unstructured":"Cheon E.J., Maruta T.: On the minimum length of some linear codes. Des. Codes Cryptogr. 43, 123\u2013135 (2007)","journal-title":"Des. Codes Cryptogr."},{"key":"9239_CR3","unstructured":"Dodunekov S.M.: A remark on the weight structure of generating matrices of linear codes (Russian). Problemy Peredachi Informatsii 26(2), 101\u2013104 (1990); translation in Problems Inform. Transmission 26(2), 173\u2013176 (1990)."},{"key":"9239_CR4","unstructured":"Grassl M.: Code Tables: Bounds on the parameters of various types of codes, available on line: http:\/\/www.codetables.de ."},{"key":"9239_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(93)90404-H","volume":"116","author":"N. Hamada","year":"1993","unstructured":"Hamada N.: A characterization of some [n, k, d; q] codes meeting the Griesemer bound using a minihyper in a finite projective geometry. Discrete Math. 116, 229\u2013268 (1993)","journal-title":"Discrete Math."},{"key":"9239_CR6","unstructured":"Hamada N., Helleseth T.: Codes and minihypers, optimal codes and related topics. In: Proceedings of the EuroWorkshop on Optimal Codes and Related Topics, Sunny Beach, Bulgaria, pp. 79\u201384 (2001)."},{"key":"9239_CR7","unstructured":"Hill R.: Optimal linear codes. In: Mitchell C. (ed.) Cryptography and Coding II, pp. 75\u2013104. Oxford Univ. Press, Oxford (1992)."},{"key":"9239_CR8","unstructured":"Hill R., Kolev E.: A survey of recent results on optimal linear codes. In: Combinatorial Designs and their Applications (Milton Keynes, 1997), pp. 127\u2013152. Chapman Hall\/CRC Res. Notes Math., 403, Chapman Hall\/CRC, Boca Raton, FL (1999)."},{"key":"9239_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries over Finite Fields","author":"J.W.P. Hirschfeld","year":"1998","unstructured":"Hirschfeld J.W.P.: Projective Geometries over Finite Fields. Clarendon Press, Oxford (1998)"},{"key":"9239_CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0012-365X(03)00201-2","volume":"274","author":"A. Klein","year":"2004","unstructured":"Klein A.: On codes meeting the Griesmer bound. Discrete Math. 274, 289\u2013297 (2004)","journal-title":"Discrete Math."},{"key":"9239_CR11","doi-asserted-by":"crossref","first-page":"2695","DOI":"10.1016\/j.disc.2007.01.015","volume":"307","author":"A. Klein","year":"2007","unstructured":"Klein A., Metsch K.: Parameters for which the Griesmer bound is not sharp. Discrete Math. 307, 2695\u20132703 (2007)","journal-title":"Discrete Math."},{"key":"9239_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1008250010928","volume":"12","author":"T. Maruta","year":"1997","unstructured":"Maruta T.: On the achievement of the Griesmer bound. Des. Codes Cryptogr. 12, 83\u201387 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"9239_CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1005076729296","volume":"74","author":"T. Maruta","year":"1999","unstructured":"Maruta T.: A characterization of some minihypers and its application to linear codes. Geometriae Dedicata 74, 305\u2013311 (1999)","journal-title":"Geometriae Dedicata"},{"key":"9239_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1008317022638","volume":"22","author":"T. Maruta","year":"2001","unstructured":"Maruta T.: On the nonexistence of q-ary linear codes of dimension five. Des. Codes Cryptogr. 22, 165\u2013177 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"9239_CR15","unstructured":"Maruta T.: Griesmer Bound for Linear Codes over Finite Fields. Available on line: http:\/\/www.geocities.com\/mars39.geo\/griesmer.htm ."},{"issue":"1","key":"9239_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/jcta.1997.2864","volume":"83","author":"H.N. Ward","year":"1998","unstructured":"Ward H.N.: Divisibility of codes meeting the Griesmer bound. J. Combin. Theory Ser. A 83(1), 79\u201393 (1998)","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9239-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9239-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9239-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T21:05:24Z","timestamp":1709240724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9239-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,19]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9239"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9239-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,19]]}}}