{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:49:14Z","timestamp":1764557354758},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS KAKENHI","award":["14474695"],"award-info":[{"award-number":["14474695"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10623-015-0139-6","type":"journal-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T09:22:57Z","timestamp":1443691377000},"page":"169-178","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A generalization of Kung\u2019s theorem"],"prefix":"10.1007","volume":"81","author":[{"given":"Trygve","family":"Johnsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keisuke","family":"Shiromoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugues","family":"Verdure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,1]]},"reference":[{"key":"139_CR1","doi-asserted-by":"crossref","unstructured":"Ball S., Blokhuis A.: A bound for the maximum weight of a linear code. SIAM J. Discret. Math. 27(1), 575\u2013583 (2013).","DOI":"10.1137\/120880100"},{"key":"139_CR2","unstructured":"Britz T., Shiromoto K.: On the covering dimension of a linear code. arXiv:1504.02357 (2015)."},{"key":"139_CR3","doi-asserted-by":"crossref","unstructured":"Crapo H., Rota G.-C.: On the Foundation of Combinatorial Theory: Combinatorial Geometries (Preliminary Edition). MIT Press, Cambridge (1970).","DOI":"10.1002\/sapm1970492109"},{"key":"139_CR4","unstructured":"Johnsen T., Roksvold J.N., Verdure H.: A Generalization of Weight Polynomials to Matroids. arXiv:1311.6291 (2013)."},{"key":"139_CR5","doi-asserted-by":"crossref","unstructured":"Jurrius R.: Weight enumeration of codes from finite spaces. Des. Codes Cryptogr. 63(3), 321\u2013330 (2012).","DOI":"10.1007\/s10623-011-9557-2"},{"key":"139_CR6","unstructured":"Jurrius R.: Codes, arrangements, matroids, and their polynomial links. PhD thesis, Technische Universiteit Eindhoven. http:\/\/alexandria.tue.nl\/extra2\/734704 (2012)."},{"key":"139_CR7","doi-asserted-by":"crossref","unstructured":"Jurrius R., Pellikaan R.: Codes, arrangements and matroids. In: Algebraic Geometry Modeling in Information Theory. Series on Coding Theory and Cryptology, vol. 8, pp. 219\u2013325. World Scientific Publishing, Hackensack (2013).","DOI":"10.1142\/9789814335768_0006"},{"key":"139_CR8","doi-asserted-by":"crossref","unstructured":"Kl\u00f8ve T.: Support weight distribution of linear codes. Discret. Math. 106(107), 311\u2013316 (1992).","DOI":"10.1016\/0012-365X(92)90559-X"},{"key":"139_CR9","doi-asserted-by":"crossref","unstructured":"Kung, J.P.S.: Critical problems. In: Matroid Theory (Seattle, WA, 1995). Contemporary Mathematics, vol. 197, pp. 1\u2013127. American Mathematical Society, Providence (1996).","DOI":"10.1090\/conm\/197\/02527"},{"key":"139_CR10","doi-asserted-by":"crossref","unstructured":"Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inf. Theory 37(5), 1412\u20131418 (1991).","DOI":"10.1109\/18.133259"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0139-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0139-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0139-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T04:40:53Z","timestamp":1567226453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0139-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["139"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0139-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,1]]}}}