{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:06:06Z","timestamp":1775052366501,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,5,2]],"date-time":"2007-05-02T00:00:00Z","timestamp":1178064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,5,2]],"date-time":"2007-05-02T00:00:00Z","timestamp":1178064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10623-007-9070-9","type":"journal-article","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T14:26:46Z","timestamp":1178029606000},"page":"123-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the minimum length of some linear codes"],"prefix":"10.1007","volume":"43","author":[{"given":"E. J.","family":"Cheon","sequence":"first","affiliation":[]},{"given":"T.","family":"Maruta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,2]]},"reference":[{"key":"9070_CR1","unstructured":"Brouwer AE Bounds on the minimum distance of linear codes. Eindhoven University of Technology, the Netherlands, available on line: http:\/\/www.win.tue.nl\/~aeb\/voorlincod.html"},{"key":"9070_CR2","first-page":"225","volume":"37","author":"EJ Cheon","year":"2007","unstructured":"Cheon EJ (2007). On the upper bound of the minimum length of 5-dimensional linear codes. Aust J Combin 37: 225\u2013232","journal-title":"Aust J Combin"},{"key":"9070_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10623-004-4034-9","volume":"37","author":"EJ Cheon","year":"2005","unstructured":"Cheon EJ, Kato T and Kim SJ (2005). On the minimum length of some linear codes of dimension 5. Des Codes Cryptogr 37: 421\u2013434","journal-title":"Des Codes Cryptogr"},{"key":"9070_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1021823703405","volume":"28","author":"P Govaerts","year":"2003","unstructured":"Govaerts P and Storme L (2003). On a particular class of minihypers and its applications I. The result for general q. Des Codes Cryptogr 28: 51\u201363","journal-title":"Des Codes Cryptogr"},{"key":"9070_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(93)90404-H","volume":"116","author":"N Hamada","year":"1993","unstructured":"Hamada N (1993). 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","journal-title":"Discrete Math"},{"key":"9070_CR6","unstructured":"Hamada N, Helleseth T (2001) 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"},{"key":"9070_CR7","first-page":"75","volume-title":"Cryptography and coding II","author":"R Hill","year":"1992","unstructured":"Hill R (1992). Optimal linear codes. In: Mitchell, C (eds) Cryptography and coding II, pp 75\u2013104. Oxford Univ Press, Oxford"},{"key":"9070_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective geometries over finite fields","author":"JWP Hirschfeld","year":"1998","unstructured":"Hirschfeld JWP (1998). Projective geometries over finite fields. Clarendon Press, Oxford"},{"issue":"209","key":"9070_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0012-365X(99)00088-6","volume":"208","author":"T Maruta","year":"1999","unstructured":"Maruta T (1999). On the minimum length of q-ary linear codes of dimension four. Discrete Math 208(209): 427\u2013435","journal-title":"Discrete Math"},{"key":"9070_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1008317022638","volume":"22","author":"T Maruta","year":"2001","unstructured":"Maruta T (2001). On the nonexistence of q-ary linear codes of dimension five. Des Codes Cryptogr 22: 165\u2013177","journal-title":"Des Codes Cryptogr"},{"key":"9070_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10623-003-4191-2","volume":"34","author":"T Maruta","year":"2005","unstructured":"Maruta T (2005). On the minimum size of some minihypers and related linear codes. Des Codes Cryptogr 34: 5\u201315","journal-title":"Des Codes Cryptogr"},{"key":"9070_CR12","unstructured":"Maruta T. Griesmer bound for linear codes over finite fields. Available online: http:\/\/www.geocities.com\/mars39.geo\/griesmer.htm"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9070-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-007-9070-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9070-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9070-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T01:38:57Z","timestamp":1707874737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-007-9070-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,2]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9070"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9070-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,2]]},"assertion":[{"value":"7 October 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2007","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2007","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2007","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}