{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:36:48Z","timestamp":1762033008328},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2011,12,24]],"date-time":"2011-12-24T00:00:00Z","timestamp":1324684800000},"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":[[2013,7]]},"DOI":"10.1007\/s10623-011-9593-y","type":"journal-article","created":{"date-parts":[[2011,12,23]],"date-time":"2011-12-23T08:02:54Z","timestamp":1324627374000},"page":"407-425","source":"Crossref","is-referenced-by-count":5,"title":["On the minimum length of ternary linear codes"],"prefix":"10.1007","volume":"68","author":[{"given":"Tatsuya","family":"Maruta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Oya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,24]]},"reference":[{"key":"9593_CR1","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/18.992814","volume":"48","author":"I. Bouyukliev","year":"2002","unstructured":"Bouyukliev I., Simonis J.: Some new results for optimal ternary linear codes. IEEE Trans. Inform. Theory 48, 981\u2013985 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9593_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1008294128110","volume":"11","author":"A.E. 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":"9593_CR3","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 Griesmer bound using a minihyper in a finite projective geometry. Discret. Math. 116, 229\u2013268 (1993)","journal-title":"Discret. Math."},{"key":"9593_CR4","first-page":"31","volume":"52","author":"N. Hamada","year":"2000","unstructured":"Hamada N., Helleseth T.: The nonexistence of some ternary linear codes and update of the bounds for n 3(6, d), 1 \u2264\u00a0 d \u2264\u00a0 243. Math. Jpn. 52, 31\u201343 (2000)","journal-title":"Math. Jpn."},{"key":"9593_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(78)90120-6","volume":"22","author":"R. Hill","year":"1978","unstructured":"Hill R.: Caps and codes. Discret. Math. 22, 111\u2013137 (1978)","journal-title":"Discret. Math."},{"key":"9593_CR6","first-page":"75","volume-title":"Cryptography and Coding II","author":"R. Hill","year":"1992","unstructured":"Hill R.: Optimal linear codes. In: Mitchell, C. (eds) Cryptography and Coding II, pp. 75\u2013104. Oxford University Press, Oxford (1992)"},{"key":"9593_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008319024396","volume":"17","author":"R. Hill","year":"1999","unstructured":"Hill R.: An extension theorem for linear codes. Des. Codes Cryptogr. 17, 151\u2013157 (1999)","journal-title":"Des. Codes Cryptogr."},{"key":"9593_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00124893","volume":"2","author":"R. Hill","year":"1992","unstructured":"Hill R., Newton D.E.: Optimal ternary linear codes. Des. Codes Cryptogr. 2, 137\u2013157 (1992)","journal-title":"Des. Codes Cryptogr."},{"key":"9593_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W.C. Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"9593_CR10","unstructured":"Kohnert A.: Best linear codes. http:\/\/www.algorithm.uni-bayreuth.de\/en\/research\/Coding_Theory\/Linear_Codes_BKW\/ . Accessed September 2011."},{"key":"9593_CR11","doi-asserted-by":"crossref","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":"9593_CR12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1008317124941","volume":"15","author":"I.N. Landjev","year":"1998","unstructured":"Landjev I.N.: The nonexistence of some optimal ternary linear codes of dimension five. Des. Codes Cryptogr. 15, 245\u2013258 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"9593_CR13","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":"9593_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10623-005-6400-7","volume":"35","author":"T. Maruta","year":"2005","unstructured":"Maruta T.: Extendability of ternary linear codes. Des. Codes Cryptogr. 35, 175\u2013190 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"9593_CR15","unstructured":"Maruta T.: Griesmer bound for linear codes over finite fields. http:\/\/www.geocities.jp\/mars39geo\/griesmer.htm . Accessed September 2011."},{"key":"9593_CR16","doi-asserted-by":"crossref","first-page":"505","DOI":"10.3934\/amc.2011.5.505","volume":"5","author":"T. Maruta","year":"2011","unstructured":"Maruta T., Oya Y.: On optimal ternary linear codes of dimension 6. Adv. Math. Commun. 5, 505\u2013520 (2011)","journal-title":"Adv. Math. Commun."},{"key":"9593_CR17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.55630\/sjc.2011.5.117-128","volume":"5","author":"Y. Oya","year":"2011","unstructured":"Oya Y.: The nonexistence of [132, 6, 86]3 codes and [135, 6, 88]3 codes. Serdica J. Comput. 5, 117\u2013128 (2011)","journal-title":"Serdica J. Comput."},{"key":"9593_CR18","first-page":"1","volume":"25","author":"G. Pellegrino","year":"1970","unstructured":"Pellegrino G.: Sul massimo ordine delle calotte in S 4,3. Matematiche (Catania) 25, 1\u20139 (1970)","journal-title":"Matematiche (Catania)"},{"key":"9593_CR19","doi-asserted-by":"crossref","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":"9593_CR20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01388456","volume":"4","author":"M. Eupen van","year":"1994","unstructured":"van Eupen M., Hill R.: An optimal ternary [69, 5, 45] code and related codes. Des. Codes Cryptogr. 4, 271\u2013282 (1994)","journal-title":"Des. Codes Cryptogr."},{"key":"9593_CR21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1008292320488","volume":"10","author":"M. Eupen van","year":"1997","unstructured":"van Eupen M., Lison\u00eak P.: Classification of some optimal ternary linear codes of small length. Des. Codes Cryptogr. 10, 63\u201384 (1997)","journal-title":"Des. Codes Cryptogr."},{"key":"9593_CR22","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. Comb. Theory A 83, 79\u201393 (1998)","journal-title":"J. Comb. Theory A"},{"key":"9593_CR23","doi-asserted-by":"crossref","first-page":"#R9","DOI":"10.37236\/98","volume":"16","author":"Y. Yoshida","year":"2009","unstructured":"Yoshida Y., Maruta T.: Ternary linear codes and quadrics. Electron. J. Comb. 16,#R9 (2009)","journal-title":"Electron. J. Comb."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9593-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9593-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9593-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T03:44:47Z","timestamp":1686541487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9593-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,24]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9593"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9593-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,24]]}}}