{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:01:52Z","timestamp":1761058912448},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,3,7]],"date-time":"2009-03-07T00:00:00Z","timestamp":1236384000000},"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,8]]},"DOI":"10.1007\/s10623-009-9275-1","type":"journal-article","created":{"date-parts":[[2009,3,6]],"date-time":"2009-03-06T21:29:21Z","timestamp":1236374961000},"page":"171-183","source":"Crossref","is-referenced-by-count":3,"title":["A new extension theorem for 3-weight modulo q linear codes over $${\\mathbb{F}_q}$$"],"prefix":"10.1007","volume":"52","author":[{"given":"E. J.","family":"Cheon","sequence":"first","affiliation":[]},{"given":"T.","family":"Maruta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,7]]},"reference":[{"key":"9275_CR1","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/18.370155","volume":"41","author":"R. Daskalov","year":"1995","unstructured":"Daskalov R., Metodieva E.: The nonexistence of some 5-dimensional quaternary linear codes. IEEE Trans. Inform. Theory 41, 581\u2013583 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9275_CR2","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. Discrete Math. 116, 229\u2013268 (1993)","journal-title":"Discrete Math."},{"key":"9275_CR3","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":"9275_CR4","doi-asserted-by":"crossref","unstructured":"Hill R., Lizak P.: Extensions of linear codes. In: Proceedings of the IEEE International Symposium on Information Theory, p. 345. Whistler, Canada (1995).","DOI":"10.1109\/ISIT.1995.550332"},{"key":"9275_CR5","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":"9275_CR6","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.disc.2007.12.028","volume":"309","author":"A. Kohnert","year":"2009","unstructured":"Kohnert A.: (l, s)-extension of linear codes. Discrete Math. 309, 412\u2013417 (2009)","journal-title":"Discrete Math."},{"key":"9275_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1134\/S0032946006040041","volume":"42","author":"I. Landjev","year":"2006","unstructured":"Landjev I., Rousseva A.: An extension theorem for arcs and linear codes. Probl. Inf. Transm. 42, 319\u2013329 (2006)","journal-title":"Probl. Inf. Transm."},{"key":"9275_CR8","unstructured":"Maruta T.: The nonexistence of [116, 5, 85]4 codes and [187, 5, 139]4 codes. In: Proceedings of the 2nd International Workshop on Optimal Codes and Related Topics in Sozopol, pp. 168\u2013174 (1998)."},{"key":"9275_CR9","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/ffta.2001.0296","volume":"7","author":"T. Maruta","year":"2001","unstructured":"Maruta T.: On the extendability of linear codes. Finite Fields Appl. 7, 350\u2013354 (2001)","journal-title":"Finite Fields Appl."},{"key":"9275_CR10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0012-365X(02)00820-8","volume":"266","author":"T. Maruta","year":"2003","unstructured":"Maruta T.: Extendability of linear codes over GF(q) with minimum distance d, gcd(d, q) = 1. Discrete Math. 266, 377\u2013385 (2003)","journal-title":"Discrete Math."},{"key":"9275_CR11","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ffa.2004.02.001","volume":"10","author":"T. Maruta","year":"2004","unstructured":"Maruta T.: A new extension theorem for linear codes. Finite Fields Appl. 10, 674\u2013685 (2004)","journal-title":"Finite Fields Appl."},{"key":"9275_CR12","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":"9275_CR13","unstructured":"Maruta T.: Extendability of linear codes over $${\\mathbb{F}_q}$$ . In: Proceedings of the 11th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), pp. 203\u2013209. Pam-porovo, Bulgaria (2008)."},{"key":"9275_CR14","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.ffa.2005.09.005","volume":"13","author":"T. Maruta","year":"2007","unstructured":"Maruta T., Okamoto K.: Some improvements to the extendability of ternary linear codes. Finite Fields Appl. 13, 259\u2013280 (2007)","journal-title":"Finite Fields Appl."},{"key":"9275_CR15","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.ffa.2008.09.003","volume":"15","author":"T. Maruta","year":"2009","unstructured":"Maruta T., Okamoto K.: Extendability of 3-weight (mod q) linear codes over $${\\mathbb{F}_q}$$ . Finite Fields Appl. 15, 134\u2013149 (2009)","journal-title":"Finite Fields Appl."},{"key":"9275_CR16","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ffa.2007.09.001","volume":"14","author":"T. Maruta","year":"2008","unstructured":"Maruta T., Takeda M., Kawakami K.: New sufficient conditions for the extendability of quaternary linear codes. Finite Fields Appl. 14, 615\u2013634 (2008)","journal-title":"Finite Fields Appl."},{"key":"9275_CR17","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1109\/18.850691","volume":"46","author":"J. Simonis","year":"2000","unstructured":"Simonis J.: Adding a parity check bit. IEEE Trans. Inform. Theory 46, 1544\u20131545 (2000)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9275-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9275-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9275-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T04:45:34Z","timestamp":1710132334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9275-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,7]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9275"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9275-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,7]]}}}