{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T14:47:00Z","timestamp":1772376420563,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16KK0103"],"award-info":[{"award-number":["16KK0103"]}],"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":[[2020,8]]},"DOI":"10.1007\/s10623-019-00688-9","type":"journal-article","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T17:03:52Z","timestamp":1574269432000},"page":"1503-1519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Wei-type duality theorems for rank metric codes"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4891-3055","authenticated-orcid":false,"given":"Thomas","family":"Britz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Mammoliti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0576-5750","authenticated-orcid":false,"given":"Keisuke","family":"Shiromoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,20]]},"reference":[{"key":"688_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1008227811117","volume":"14","author":"A Ashikhimin","year":"1998","unstructured":"Ashikhimin A.: On generalized Hamming weights for Galois ring linear codes. Des. Codes Cryptogr. 14, 107\u2013126 (1998).","journal-title":"Des. Codes Cryptogr."},{"key":"688_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"EF Assmus Jr","year":"1969","unstructured":"Assmus Jr. E.F., Mattson Jr. H.F.: New 5-designs. J. Comb. Theory 6, 122\u2013151 (1969).","journal-title":"J. Comb. Theory"},{"key":"688_CR3","doi-asserted-by":"publisher","first-page":"2300","DOI":"10.1016\/j.disc.2006.12.001","volume":"307","author":"T Britz","year":"2007","unstructured":"Britz T.: Higher support matroids. Discret. Math. 307, 2300\u20132308 (2007).","journal-title":"Discret. Math."},{"key":"688_CR4","doi-asserted-by":"publisher","first-page":"4350","DOI":"10.1109\/TIT.2010.2054654","volume":"56","author":"T Britz","year":"2010","unstructured":"Britz T.: Code enumerators and Tutte polynomials. IEEE Trans. Inf. Theory 56, 4350\u20134358 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR5","doi-asserted-by":"publisher","first-page":"4551","DOI":"10.1016\/j.disc.2007.08.064","volume":"308","author":"T Britz","year":"2008","unstructured":"Britz T., Shiromoto K.: A MacWilliams type identity for matroids. Discret. Math. 308, 4551\u20134559 (2008).","journal-title":"Discret. Math."},{"key":"688_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10623-007-9145-7","volume":"46","author":"T Britz","year":"2008","unstructured":"Britz T., Shiromoto K.: Designs from subcode supports of linear codes. Des. Codes Cryptogr. 46, 175\u2013189 (2008).","journal-title":"Des. Codes Cryptogr."},{"key":"688_CR7","doi-asserted-by":"publisher","first-page":"2567","DOI":"10.1109\/TIT.2007.899509","volume":"53","author":"D Britz","year":"2007","unstructured":"Britz D., Britz T., Shiromoto K., S\u00f8rensen H.K.: The higher weight enumerators of the doubly-even, self-dual $$[48,24,12]$$ code. IEEE Trans. Inf. Theory 53, 2567\u20132571 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR8","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1137\/080728913","volume":"23","author":"T Britz","year":"2009","unstructured":"Britz T., Royle G., Shiromoto K.: Designs from matroids. SIAM J. Discret. Math. 23, 1082\u20131099 (2009).","journal-title":"SIAM J. Discret. Math."},{"key":"688_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10623-011-9524-y","volume":"62","author":"T Britz","year":"2012","unstructured":"Britz T., Johnsen T., Mayhew D., Shiromoto K.: Wei-type duality theorems for matroids. Des. Codes Cryptogr. 62, 331\u2013341 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"688_CR10","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1109\/TIT.2013.2292524","volume":"60","author":"T Britz","year":"2014","unstructured":"Britz T., Johnson T., Martin J.: Chains, demi-matroids, and profiles. IEEE Trans. Inf. Theory 60, 986\u2013991 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10623-013-9895-3","volume":"75","author":"T Britz","year":"2015","unstructured":"Britz T., Shiromoto K., Westerb\u00e4ck T.: Demi-matroids from codes over finite Frobenius rings. Des. Codes Cryptogr. 75, 97\u2013107 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"688_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0012-365X(94)00228-B","volume":"147","author":"RA Brualdi","year":"1995","unstructured":"Brualdi R.A., Graves J.S., Lawrence K.M.: Codes with a poset metric. Discret. Math. 147, 57\u201372 (1995).","journal-title":"Discret. Math."},{"key":"688_CR13","doi-asserted-by":"publisher","first-page":"7915","DOI":"10.1109\/TIT.2013.2280914","volume":"59","author":"TH Chan","year":"2013","unstructured":"Chan T.H., Grant A., Britz T.: Quasi-uniform codes and their applications. IEEE Trans. Inf. Theory 59, 7915\u20137926 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR14","doi-asserted-by":"publisher","first-page":"3180","DOI":"10.1109\/TIT.2010.2048464","volume":"56","author":"A de Oliveira Moura","year":"2010","unstructured":"de Oliveira Moura A., Firer M.: Duality for poset codes. IEEE Trans. Inf. Theory 56, 3180\u20133186 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR15","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25, 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"key":"688_CR16","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/18.720545","volume":"44","author":"P Delsarte","year":"1988","unstructured":"Delsarte P., Levenshtein V.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44, 2477\u20132504 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1090\/conm\/632\/12622","volume":"632","author":"J Ducoat","year":"2015","unstructured":"Ducoat J.: Generalized rank weights, a duality statement, in topics in finite fields. Contemp. Math. 632, 101\u2013109 (2015).","journal-title":"Contemp. Math."},{"key":"688_CR18","first-page":"3","volume":"21","author":"\u00c8M Gabidulin","year":"1985","unstructured":"Gabidulin \u00c8.M.: Theory of codes with maximum rank distance. Probl. Pereda. Inform. 21, 3\u201316 (1985). (Russian).","journal-title":"Probl. Pereda. Inform."},{"key":"688_CR19","first-page":"1","volume":"1","author":"\u00c8M Gabidulin","year":"1985","unstructured":"Gabidulin \u00c8.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 1, 1\u201312 (1985). (Russian).","journal-title":"Probl. Inf. Transm."},{"key":"688_CR20","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume":"547","author":"\u00c8M Gabidulin","year":"1991","unstructured":"Gabidulin \u00c8.M., Paramonov \u00c0.V., Tretjakov \u00d2.V.: Ideals over a non-commutative ring and their application in cryptology. Lect. Notes Comput. Sci. 547, 482\u2013489 (1991).","journal-title":"Lect. Notes Comput. Sci."},{"key":"688_CR21","unstructured":"Gadouleau M., Yan Z.: MacWilliams identities for the rank-metric. In: Proceedings of IEEE International Symposium on Information Theory (ISIT07), France, pp. 36\u201340 (2007)."},{"key":"688_CR22","doi-asserted-by":"publisher","first-page":"754021","DOI":"10.1155\/2008\/754021","volume":"2008","author":"M Gadouleau","year":"2008","unstructured":"Gadouleau M., Yan Z.: MacWilliams identity for codes with the rank-metric. EURASIP J. Wirel. Commun. Netw. 2008, 754021 (2008).","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"688_CR23","unstructured":"Ghorpade S.R., Johnsen T.: A polymatroid approach to generalized weights of rank metric codes. arXiv:1904.01913v2 [cs:IT], 22pp (2019)."},{"key":"688_CR24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11786-012-0119-4","volume":"6","author":"G Gordon","year":"2012","unstructured":"Gordon G.: On Brylawski\u2019s generalized duality. Math. Comput. Sci. 6, 135\u2013146 (2012).","journal-title":"Math. Comput. Sci."},{"key":"688_CR25","unstructured":"Gorla E.: Rank-metric codes. arXiv:1902.02650 [cs:IT], 26pp (2019)."},{"key":"688_CR26","unstructured":"Gorla E., Jurrius R., Lopez H.H., Ravagnani A.: Rank-metric codes and $$q$$-polymatroids. arXiv:1803.10844 [cs.IT], 21pp (2018)."},{"key":"688_CR27","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/sapm1976552119","volume":"55","author":"C Greene","year":"1976","unstructured":"Greene C.: Weight enumeration and the geometry of linear codes. Stud. Appl. Math. 55, 119\u2013128 (1976).","journal-title":"Stud. Appl. Math."},{"key":"688_CR28","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-45624-4_15","volume":"2227","author":"H Horimoto","year":"2001","unstructured":"Horimoto H., Shiromoto K.: On generalized Hamming weights for codes over finite chain rings. Lect. Notes Comput. Sci. 2227, 141\u2013150 (2001).","journal-title":"Lect. Notes Comput. Sci."},{"key":"688_CR29","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1109\/TIT.2017.2654456","volume":"63","author":"T Johnsen","year":"2017","unstructured":"Johnsen T., Verdure H.: Generalized Hamming weights for almost affine codes. IEEE Trans. Inf. Theory 63, 1941\u20131953 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"688_CR30","first-page":"2.3","volume":"25","author":"R Jurrius","year":"2018","unstructured":"Jurrius R., Pellikaan R.: Defining the $$q$$-analogue of a matroid. Electron. J. Comb. 25(3), 2.3 (2018).","journal-title":"Electron. J. Comb."},{"key":"688_CR31","unstructured":"Kshevetskiy A., Gabidulin \u00c8.M.: The new construction of rank codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT05), Australia, pp. 2105\u20132108 (2005)."},{"key":"688_CR32","doi-asserted-by":"publisher","first-page":"3912","DOI":"10.1109\/TIT.2015.2429713","volume":"61","author":"J Kurihara","year":"2015","unstructured":"Kurihara J., Matsumoto R., Uyematsu T.: Relative generalized rank weight of linear codes and its applications to network coding. IEEE Trans. Inf. Theory 61, 3912\u20133936 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR33","unstructured":"Larsen A.H.: Matroider og Line\u00e6re Koder. Master\u2019s thesis, University of Bergen (2005)."},{"key":"688_CR34","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/j.1538-7305.1963.tb04003.x","volume":"42","author":"FJ MacWilliams","year":"1963","unstructured":"MacWilliams F.J.: A theorem on the distribution of weights in a systematic code. Bell System Tech. J. 42, 79\u201394 (1963).","journal-title":"Bell System Tech. J."},{"key":"688_CR35","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1007\/s10623-019-00619-8","volume":"14","author":"U Martinez-Pen\u00e3s","year":"2019","unstructured":"Martinez-Pen\u00e3s U.: Theory of supports for linear codes endowed with the sum-rank metric. Des. Codes Cryptogr. 14, 2295\u20132320 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"688_CR36","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1109\/TIT.2017.2766292","volume":"64","author":"U Martinez-Pen\u00e3s","year":"2018","unstructured":"Martinez-Pen\u00e3s U., Matsumoto R.: Relative generalized matrix weights of matrix codes for universal security on wire-tap networks. IEEE Trans. Inf. Theory 64, 2529\u20132549 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR37","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(91)90315-S","volume":"96","author":"H Niederreiter","year":"1991","unstructured":"Niederreiter H.: A combinatorial problem for vector spaces over finite fields. Discret. Math. 96, 221\u2013228 (1991).","journal-title":"Discret. Math."},{"key":"688_CR38","unstructured":"Oggier F., Sboui A.: On the existence of generalized rank weights. In: Proceedings of 2012 International Symposium Information Theory and Its Applications, Honolulu, Hawaii, USA, pp. 406\u2013410 (2012)."},{"key":"688_CR39","doi-asserted-by":"publisher","first-page":"1946","DOI":"10.1016\/j.jpaa.2015.10.009","volume":"220","author":"A Ravagnani","year":"2016","unstructured":"Ravagnani A.: Generalized weights: an anticode approach. J. Pure Appl. Algebra 220, 1946\u20131962 (2016).","journal-title":"J. Pure Appl. Algebra"},{"key":"688_CR40","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10623-015-0077-3","volume":"80","author":"A Ravagnani","year":"2016","unstructured":"Ravagnani A.: Rank-metric codes and their duality theory. Des. Codes Cryptogr. 80, 197\u2013216 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"688_CR41","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"RM Roth","year":"1991","unstructured":"Roth R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory 37, 328\u2013336 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR42","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1109\/TIT.2004.826673","volume":"50","author":"HG Schaathun","year":"2004","unstructured":"Schaathun H.G.: Duality and support weight distributions. IEEE Trans. Inf. Theory 50, 862\u2013867 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0576-0","author":"K Shiromoto","year":"2018","unstructured":"Shiromoto K.: Matroids and codes with the rank metric. Des. Codes Cryptogr. (2018). https:\/\/doi.org\/10.1007\/s10623-018-0576-0.","journal-title":"Des. Codes Cryptogr."},{"key":"688_CR44","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva D., Kschischang F.R., Koetter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54, 3951\u20133967 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR45","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/18.50376","volume":"36","author":"H Stichtenoth","year":"1990","unstructured":"Stichtenoth H.: On the dimension of subfield subcodes. IEEE Trans. Inf. Theory 36, 90\u201393 (1990).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR46","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/18.661517","volume":"44","author":"V Tarokh","year":"1998","unstructured":"Tarokh V., Seshadri N., Calderbank A.R.: Space\u2013time codes for high data rate wireless communication: performance criterion and code construction. IEEE Trans. Inf. Theory 44, 744\u2013765 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR47","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"VK Wei","year":"1991","unstructured":"Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inf. Theory 37, 1412\u20131418 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"688_CR48","doi-asserted-by":"publisher","first-page":"5296","DOI":"10.1109\/TIT.2016.2598149","volume":"62","author":"T Westerb\u00e4ck","year":"2016","unstructured":"Westerb\u00e4ck T., Freij-Hollanti R., Ernvall T., Hollanti C.: On the combinatorics of locally repairable codes via matroid theory. IEEE Trans. Inf. Theory 62, 5296\u20135315 (2016).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00688-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00688-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00688-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:51:13Z","timestamp":1605747073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00688-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,20]]},"references-count":48,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["688"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00688-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,20]]},"assertion":[{"value":"20 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}