{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T06:16:11Z","timestamp":1772864171937,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["20K03722"],"award-info":[{"award-number":["20K03722"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10623-022-01021-7","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T15:56:01Z","timestamp":1645631761000},"page":"947-956","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the nonexistence of ternary linear codes attaining the Griesmer bound"],"prefix":"10.1007","volume":"90","author":[{"given":"Daiki","family":"Kawabata","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7858-0787","authenticated-orcid":false,"given":"Tatsuya","family":"Maruta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"issue":"3","key":"1021_CR1","first-page":"211","volume":"10","author":"BI Belov","year":"1974","unstructured":"Belov B.I., Logachev V.N., Sandimirov V.P.: Construction of a class of linear binary codes achieving the Varshamov-Griesmer bound. Probl. Inf. Transm. 10(3), 211\u2013217 (1974).","journal-title":"Probl. Inf. Transm."},{"key":"1021_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.55630\/sjc.2007.1.115-130","volume":"1","author":"IG Bouyukliev","year":"2007","unstructured":"Bouyukliev I.G.: What is Q-extension? Serdica J. Comput. 1, 115\u2013130 (2007).","journal-title":"Serdica J. Comput."},{"key":"1021_CR3","unstructured":"Bouyukliev I., Bouyuklieva S., Kurz S.: Computer classification of linear codes. IEEE Trans. Inf. Theory, in press."},{"key":"1021_CR4","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.3957236","author":"I Bouyukliev","year":"2020","unstructured":"Bouyukliev I., Bouyuklieva S., Kurz S.: Database with linear codes. Zenodo (2020). https:\/\/doi.org\/10.5281\/zenodo.3957236.","journal-title":"Zenodo"},{"key":"1021_CR5","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1109\/18.992814","volume":"46","author":"I Bouyukliev","year":"2002","unstructured":"Bouyukliev I., Jaffe D.B., Vavrek V.: The smallest length of eight-dimensional binary linear codes with prescribed minimum distance. IEEE Trans. Inf. Theory 46, 981\u2013985 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1021_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1008294128110","volume":"11","author":"AE Brouwer","year":"1997","unstructured":"Brouwer A.E., van Eupen M.: The correspondence between projective codes and 2-weight codes. Des. Codes Cryptogr. 11, 261\u2013266 (1997).","journal-title":"Des. Codes Cryptogr."},{"key":"1021_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10623-008-9239-x","volume":"51","author":"EJ Cheon","year":"2009","unstructured":"Cheon E.J.: A class of optimal linear codes of length one above the Griesmer bound. Des. Codes Cryptogr. 51, 9\u201320 (2009).","journal-title":"Des. Codes Cryptogr."},{"key":"1021_CR8","unstructured":"Dodunekov S.M.: Optimal linear codes, Doctor Thesis, Sofia (1985)."},{"key":"1021_CR9","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH 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":"1021_CR10","unstructured":"Hill R.: Optimal linear codes. In: Mitchell, C. (ed.) Cryptography and Coding II, pp. 75\u2013104. Oxford University Press, Oxford (1992)."},{"key":"1021_CR11","unstructured":"Hill R., Kolev E.: A survey of recent results on optimal linear codes. In: Holroyd, F.C., Quinn, K.A.S., Rowley, C., Webb, B.S. (eds.) Combinatorial Designs and their Applications. Chapman and Hall\/CRC Press Research Notes in Mathematics, pp. 127\u2013152, CRC Press. Boca Raton (1999)."},{"key":"1021_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ffa.2018.10.007","volume":"55","author":"Y Inoue","year":"2019","unstructured":"Inoue Y., Maruta T.: Construction of new Griesmer codes of dimension 5. Finite Fields Appl. 55, 231\u2013237 (2019).","journal-title":"Finite Fields Appl."},{"key":"1021_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10623-015-0167-2","volume":"81","author":"Y Kageyama","year":"2016","unstructured":"Kageyama Y., Maruta T.: On the geometric constructions of optimal linear codes. Des. Codes Cryptogr. 81, 469\u2013480 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"1021_CR14","doi-asserted-by":"crossref","unstructured":"Kawabata D., Maruta T.: A Conjecture on optimal ternary linear codes. In: Proceedings of 17th International Workshop on Algebraic and Combinatorial Coding Theory, 2020 Algebraic and Combinatorial Coding Theory (ACCT), pp. 90\u201394, IEEE Xplore (2021).","DOI":"10.1109\/ACCT51235.2020.9383341"},{"key":"1021_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/ffta.1996.0007","volume":"2","author":"I Landgev","year":"1996","unstructured":"Landgev I., Maruta T., Hill R.: On the nonexistence of quaternary [51, 4, 37] codes. Finite Fields Appl. 2, 96\u2013110 (1996).","journal-title":"Finite Fields Appl."},{"key":"1021_CR16","doi-asserted-by":"publisher","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":"1021_CR17","doi-asserted-by":"publisher","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":"1021_CR18","unstructured":"Maruta T.: Griesmer bound for linear codes over finite fields. http:\/\/mars39.lomo.jp\/opu\/griesmer.htm."},{"key":"1021_CR19","unstructured":"Maruta T.: Some 9-divisible ternary linear codes of dimension 7. http:\/\/mars39.lomo.jp\/opu\/div-ternary.htm."},{"key":"1021_CR20","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10623-011-9593-y","volume":"68","author":"T Maruta","year":"2013","unstructured":"Maruta T., Oya Y.: On the minimum length of ternary linear codes. Des. Codes Cryptogr. 68, 407\u2013425 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"1021_CR21","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.disc.2007.07.044","volume":"308","author":"M Takenaka","year":"2008","unstructured":"Takenaka M., Okamoto K., Maruta T.: On optimal non-projective ternary linear codes. Discret. Math. 308, 842\u2013854 (2008).","journal-title":"Discret. Math."},{"key":"1021_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(81)90166-7","volume":"33","author":"H van Tilborg","year":"1981","unstructured":"van Tilborg H.: The smallest length of binary 7-dimensional linear codes with prescribed minimum distance. Discret. Math. 33, 197\u2013207 (1981).","journal-title":"Discret. Math."},{"issue":"1","key":"1021_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/jcta.1997.2864","volume":"83","author":"HN Ward","year":"1998","unstructured":"Ward H.N.: Divisibility of codes meeting the Griesmer bound. J. Comb. Theory Ser. A 83(1), 79\u201393 (1998).","journal-title":"J. Comb. Theory Ser. A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01021-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01021-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01021-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T19:44:19Z","timestamp":1674848659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01021-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1021"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01021-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,23]]},"assertion":[{"value":"25 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}