{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:30:33Z","timestamp":1768523433565,"version":"3.49.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T00:00:00Z","timestamp":1549929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-7027-00053B"],"award-info":[{"award-number":["DFF-7027-00053B"]}],"id":[{"id":"10.13039\/100008394","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":[[2019,10]]},"DOI":"10.1007\/s10623-019-00619-8","type":"journal-article","created":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T01:55:19Z","timestamp":1549936519000},"page":"2295-2320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Theory of supports for linear codes endowed with the sum-rank metric"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,12]]},"reference":[{"issue":"2","key":"619_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s002000050060","volume":"8","author":"A Barg","year":"1997","unstructured":"Barg A.: The matroid of supports of a linear code. Appl. Algebra Eng. Commun. Comput. 8(2), 165\u2013172 (1997).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"11","key":"619_CR2","doi-asserted-by":"publisher","first-page":"3016","DOI":"10.1109\/TIT.2003.819322","volume":"49","author":"TP Berger","year":"2003","unstructured":"Berger T.P.: Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inf. Theory 49(11), 3016\u20133019 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"619_CR3","doi-asserted-by":"publisher","first-page":"4510","DOI":"10.1109\/TIT.2013.2252395","volume":"59","author":"M Blaum","year":"2013","unstructured":"Blaum M., Hafner J.L., Hetzler S.: Partial-MDS codes and their application to RAID type of architectures. IEEE Trans. Inf. Theory 59(7), 4510\u20134519 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"619_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10623-012-9704-4","volume":"70","author":"D Boucher","year":"2014","unstructured":"Boucher D., Ulmer F.: Linear codes using skew polynomials with automorphisms and derivations. Des. Codes Cryptogr. 70(3), 405\u2013431 (2014).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"619_CR5","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/16M1091769","volume":"31","author":"E Byrne","year":"2017","unstructured":"Byrne E., Ravagnani A.: Covering radius of matrix codes endowed with the rank metric. SIAM J. Discret. Math. 31(2), 927\u2013944 (2017).","journal-title":"SIAM J. Discret. Math."},{"key":"619_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de\u00a0Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Advances in cryptology\u2014EUROCRYPT 2007, volume 4515 of Lecture Notes in Computer Science, pp. 291\u2013310 (2007)","DOI":"10.1007\/978-3-540-72540-4_17"},{"issue":"8","key":"619_CR7","doi-asserted-by":"publisher","first-page":"5404","DOI":"10.1109\/TIT.2017.2712636","volume":"63","author":"A Couvreur","year":"2017","unstructured":"Couvreur A., M\u00e1rquez-Corbella I., Pellikaan R.: Cryptanalysis of McEliece cryptosystem based on algebraic geometry codes and their subcodes. IEEE Trans. Inf. Theory 63(8), 5404\u20135418 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"619_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1018014013461","volume":"9","author":"MA Boer De","year":"1996","unstructured":"De Boer M.A.: Almost MDS codes. Des. Codes Cryptogr. 9(2), 143\u2013155 (1996).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"619_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-016-0325-1","volume":"86","author":"J Cruz De la","year":"2018","unstructured":"De la Cruz J., Gorla E., L\u00f3pez H.H., Ravagnani A.: Weight distribution of rank-metric codes. Des. Codes Cryptogr. 86(1), 1\u201316 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"619_CR10","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(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"619_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/18.567708","volume":"43","author":"R Dodunekova","year":"1997","unstructured":"Dodunekova R., Dodunekov S.M., Kl\u00f8ve T.: Almost-MDS and near-MDS codes for error detection. IEEE Trans. Inf. Theory 43(1), 285\u2013290 (1997).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"619_CR12","doi-asserted-by":"crossref","unstructured":"Ducoat, J.: Generalized rank weights: a duality statement. In: Topics in Finite Fields, volume 632 of Comtemporary Mathematics, pp. 114\u2013123 (2015)","DOI":"10.1090\/conm\/632\/12622"},{"issue":"4","key":"619_CR13","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/18.335972","volume":"40","author":"G-L Feng","year":"1994","unstructured":"Feng G.-L., Rao T.R.N.: A simple approach for construction of algebraic-geometric codes from affine plane curves. IEEE Trans. Inf. Theory 40(4), 1003\u20131012 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"619_CR14","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1109\/18.340452","volume":"40","author":"GD Forney Jr","year":"1994","unstructured":"Forney Jr. G.D.: Dimension\/length profiles and trellis complexity of linear block codes. IEEE Trans. Inf. Theory 40(6), 1741\u20131752 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"619_CR15","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/16M1102562","volume":"1","author":"R Freij-Hollanti","year":"2017","unstructured":"Freij-Hollanti R., Gnilke O.W., Hollanti C., Karpuk D.A.: Private information retrieval from coded databases with colluding servers. SIAM J. Appl. Algebra Geom. 1(1), 647\u2013664 (2017).","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"1","key":"619_CR16","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Inf. Trans. 21(1), 1\u201312 (1985).","journal-title":"Probl. Inf. Trans."},{"issue":"1","key":"619_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TIT.2002.806116","volume":"49","author":"H Gamal El","year":"2003","unstructured":"El Gamal H., Hammons A.R.: On the design of algebraic space-time codes for MIMO block-fading channels. IEEE Trans. Inf. Theory 49(1), 151\u2013163 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"619_CR18","doi-asserted-by":"publisher","first-page":"5245","DOI":"10.1109\/TIT.2014.2332338","volume":"60","author":"P Gopalan","year":"2014","unstructured":"Gopalan P., Huang C., Jenkins B., Yekhanin S.: Explicit maximally recoverable codes with locality. IEEE Trans. Inf. Theory 60(9), 5245\u20135256 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"619_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.jcta.2014.03.005","volume":"125","author":"M Greferath","year":"2014","unstructured":"Greferath M., Honold T., Mc Fadden C., Wood J.A., Zumbr\u00e4gel J.: Macwilliams\u2019 extension theorem for bi-invariant weights over finite principal ideal rings. J. Comb. Theory Ser. A 125, 177\u2013193 (2014).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"619_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950).","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"619_CR21","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/18.370144","volume":"41","author":"T Helleseth","year":"1995","unstructured":"Helleseth T., Kl\u00f8ve T., Levenshtein V.I., Ytrehus \u00d8.: Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41(2), 432\u2013440 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"619_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(77)90078-4","volume":"18","author":"T Helleseth","year":"1977","unstructured":"Helleseth T., Kl\u00f8ve T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths $$n_l((q^l-1)\/{N})$$ n l ( ( q l - 1 ) \/ N ) . Discret. Math. 18(2), 179\u2013211 (1977).","journal-title":"Discret. Math."},{"issue":"3","key":"619_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.3934\/amc.2017042","volume":"11","author":"A-L Horlemann-Trautmann","year":"2017","unstructured":"Horlemann-Trautmann A.-L., Marshall K.: New criteria for MRD and Gabidulin codes and some rank-metric code constructions. Adv. Math. Commun. 11(3), 533 (2017).","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"619_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.3934\/amc.2017014","volume":"11","author":"R Jurrius","year":"2017","unstructured":"Jurrius R., Pellikaan R.: On defining generalized rank weights. Adv. Math. Commun. 11(1), 225\u2013235 (2017).","journal-title":"Adv. Math. Commun."},{"key":"619_CR25","doi-asserted-by":"crossref","first-page":"321","DOI":"10.37236\/6911","volume":"25","author":"R Jurrius","year":"2018","unstructured":"Jurrius R., Pellikaan R.: Defining the q-analogue of a matroid. Electron. J. Comb. 25, 321\u2013330 (2018).","journal-title":"Electron. J. Comb."},{"key":"619_CR26","unstructured":"K\u00f6tter, R.: A unified description of an error locating procedure for linear codes. In: Proceeding of the Algebraic and Combinatorial Coding Theory, pp. 113\u2013117 (1992)"},{"issue":"8","key":"619_CR27","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6tter","year":"2008","unstructured":"K\u00f6tter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"619_CR28","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(7), 3912\u20133936 (2015).","journal-title":"IEEE Trans. Inf.. Theory"},{"key":"619_CR29","first-page":"193","volume":"4","author":"TY Lam","year":"1986","unstructured":"Lam T.Y.: A general theory of Vandermonde matrices. Expos. Math. 4, 193\u2013215 (1986).","journal-title":"Expos. Math."},{"issue":"2","key":"619_CR30","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0021-8693(88)90063-4","volume":"119","author":"TY Lam","year":"1988","unstructured":"Lam T.Y., Leroy A.: Vandermonde and Wronskian matrices over division rings. J. Algebra 119(2), 308\u2013336 (1988).","journal-title":"J. Algebra"},{"issue":"5","key":"619_CR31","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1109\/TIT.2005.846403","volume":"51","author":"H-F Lu","year":"2005","unstructured":"Lu H.-F., Kumar P.V.: A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Trans. Inf. Theory 51(5), 1709\u20131730 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"619_CR32","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/TIT.2004.842763","volume":"51","author":"Y Luo","year":"2005","unstructured":"Luo Y., Mitrpant C., Han\u00a0Vinck A.J., Chen K.: Some new characters on the wire-tap channel of type II. IEEE Trans. Inf. Theory 51(3), 1222\u20131229 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"619_CR33","unstructured":"MacWilliams, F.J.: Combinatorial problems of elementary abelian groups. PhD thesis, Harvard (1962)"},{"issue":"6","key":"619_CR34","doi-asserted-by":"publisher","first-page":"3039","DOI":"10.1109\/TIT.2016.2555949","volume":"62","author":"R Mahmood","year":"2016","unstructured":"Mahmood R., Badr A., Khisti A.: Convolutional codes with maximum column sum rank for network streaming. IEEE Trans. Inf. Theory 62(6), 3039\u20133052 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"619_CR35","doi-asserted-by":"publisher","first-page":"4081","DOI":"10.1109\/TIT.2016.2570238","volume":"62","author":"U Mart\u00ednez-Pe\u00f1as","year":"2016","unstructured":"Mart\u00ednez-Pe\u00f1as U.: On the similarities between generalized rank and Hamming weights and their applications to network coding. IEEE Trans. Inf. Theory 62(7), 4081\u20134095 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"619_CR36","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Linearized multivariate skew polynomials and Hilbert 90 theorems with multivariate norms, In: Proceeding of the XVI EACA, Zaragoza-Encuentros de \u00c1lgebra Computacional y Aplicaciones, pp. 119\u2013122 (2018)"},{"key":"619_CR37","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.jalgebra.2018.02.005","volume":"504","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as U.: Skew and linearized Reed\u2013Solomon codes and maximum sum rank distance codes over any division ring. J. Algebra 504, 587\u2013612 (2018).","journal-title":"J. Algebra"},{"key":"619_CR38","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Private information retrieval from locally repairable databases with colluding servers. (2019). Preprint: arXiv:1901.02938 ."},{"key":"619_CR39","unstructured":"Mart\u00ednez-Pe\u00f1as, U., Kschischang, F.R.: Reliable and secure multishot network coding using linearized Reed\u2013Solomon codes. In: Proceeding of the 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (2018). Extended version: arXiv:1805.03789"},{"key":"619_CR40","unstructured":"Mart\u00ednez-Pe\u00f1as, U., Kschischang, F.R.: Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes. In: Proceeding of the 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (2018). Extended version: arXiv:1809.11158 ."},{"key":"619_CR41","unstructured":"Mart\u00ednez-Pe\u00f1as, U., Kschischang, F.R.: Evaluation and interpolation over multivariate skew polynomial rings. J. Algebra, pp. 1\u201328, (2019). In press. Available: arXiv:1710.09606"},{"issue":"1\u20132","key":"619_CR42","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10623-016-0284-6","volume":"84","author":"U Mart\u00ednez-Pe\u00f1as","year":"2017","unstructured":"Mart\u00ednez-Pe\u00f1as U., Pellikaan R.: Rank error-correcting pairs. Des. Codes Cryptogr. 84(1\u20132), 261\u2013281 (2017).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"619_CR43","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1109\/TIT.2017.2766292","volume":"64","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as U., Matsumoto R.: Relative generalized matrix weights of matrix codes for universal security on wire-tap networks. IEEE Trans. Inf. Theory 64(4), 2529\u20132549 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"619_CR44","doi-asserted-by":"crossref","unstructured":"Napp, D., Pinto, R., Rosenthal, J., Vettori, P.: MRD rank metric convolutional codes. In: Proceeding of the 2017 IEEE International Symposium on Information Theory, pp. 2766\u20132770 (2017)","DOI":"10.1109\/ISIT.2017.8007033"},{"issue":"2","key":"619_CR45","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10623-017-0346-4","volume":"86","author":"D Napp","year":"2018","unstructured":"Napp D., Pinto R., Sidorenko V.: Concatenation of convolutional codes and rank metric codes for multi-shot network coding. Des. Codes Cryptogr. 86(2), 303\u2013318 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"619_CR46","doi-asserted-by":"crossref","unstructured":"N\u00f3brega, R.W., Uch\u00f4a-Filho, B.F.: Multishot codes for network coding: bounds and a multilevel construction. In: Proceeding of the 2009 IEEE International Symposium on Information Theory, pp. 428\u2013432 (2009)","DOI":"10.1109\/ISIT.2009.5205750"},{"key":"619_CR47","doi-asserted-by":"crossref","unstructured":"N\u00f3brega, R.W., Uch\u00f4a-Filho, B.F.: Multishot codes for network coding using rank-metric codes. In: Proceeding of the 2010 Third IEEE International Workshop on Wireless Network Coding, pp. 1\u20136 (2010)","DOI":"10.1109\/WINC.2010.5507933"},{"key":"619_CR48","unstructured":"Oggier, F.E., Sboui, A.: On the existence of generalized rank weights. In: Proceeding of the 2012 International Symposium on Information Theory and its Applications, pp. 406\u2013410 (2012)"},{"issue":"3","key":"619_CR49","doi-asserted-by":"publisher","first-page":"480","DOI":"10.2307\/1968173","volume":"34","author":"O Ore","year":"1933","unstructured":"Ore O.: Theory of non-commutative polynomials. Ann. Math. 34(3), 480\u2013508 (1933).","journal-title":"Ann. Math."},{"issue":"2","key":"619_CR50","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008).","journal-title":"J. Cryptol."},{"key":"619_CR51","doi-asserted-by":"crossref","unstructured":"Ozarow, L.H., Wyner, A.D.: Wire-tap channel II. In: advances in cryptology: EUROCRYPT 84, volume 209 of Lecture Notes in Computer Science, pp. 33\u201350 (1985)","DOI":"10.1007\/3-540-39757-4_5"},{"issue":"2","key":"619_CR52","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0378-3758(95)00088-7","volume":"51","author":"R Pellikaan","year":"1996","unstructured":"Pellikaan R.: On the existence of error-correcting pairs. J. Stat. Plan. Inference 51(2), 229\u2013242 (1996).","journal-title":"J. Stat. Plan. Inference"},{"issue":"5","key":"619_CR53","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(5), 1946\u20131962 (2016).","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"619_CR54","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(2), 328\u2013336 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"619_CR55","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TIT.2010.2090212","volume":"57","author":"D Silva","year":"2011","unstructured":"Silva D., Kschischang F.R.: Universal secure network coding via rank-metric codes. IEEE Trans. Inf. Theory 57(2), 1124\u20131135 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"619_CR56","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R Singleton","year":"1964","unstructured":"Singleton R.: Maximum distance q-nary codes. IEEE Trans. Inf. Theory 10(2), 116\u2013118 (1964).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6, part 1","key":"619_CR57","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.1109\/18.476213","volume":"41","author":"MA Tsfasman","year":"1995","unstructured":"Tsfasman M.A., Vl\u0103du\u0163 S.G.: Geometric approach to higher weights. IEEE Trans. Inf. Theory 41(6, part 1), 1564\u20131588 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"619_CR58","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1134\/S0032946011020049","volume":"47","author":"A Wachter","year":"2011","unstructured":"Wachter A., Sidorenko V.R., Bossert M., Zyablov V.V.: On (partial) unit memory codes based on Gabidulin codes. Probl. Inf. Trans. 47(2), 117\u2013129 (2011).","journal-title":"Probl. Inf. Trans."},{"issue":"6","key":"619_CR59","doi-asserted-by":"publisher","first-page":"3199","DOI":"10.1109\/TIT.2015.2424930","volume":"61","author":"A Wachter-Zeh","year":"2015","unstructured":"Wachter-Zeh A., Stinner M., Sidorenko V.: Convolutional codes in rank metric with application to random network coding. IEEE Trans. Inf. Theory 61(6), 3199\u20133213 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"619_CR60","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(5), 1412\u20131418 (1991).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00619-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00619-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00619-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T11:38:26Z","timestamp":1606477106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00619-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,12]]},"references-count":60,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00619-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,12]]},"assertion":[{"value":"8 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}