{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T22:33:21Z","timestamp":1777761201114,"version":"3.51.4"},"reference-count":279,"publisher":"Emerald","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"abstract":"<jats:p>The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a variety of applications. In code-based cryptography, the hardness of the corresponding generic decoding problem can lead to systems with reduced public-key size. In distributed data storage, codes in the rank metric have been used repeatedly to construct codes with locality, and in coded caching, they have been employed for the placement of coded symbols. This survey gives a general introduction to rank-metric codes, explains their most important applications, and highlights their relevance to these areas of research.<\/jats:p>","DOI":"10.1561\/0100000119","type":"journal-article","created":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T07:34:27Z","timestamp":1651476867000},"page":"391-546","source":"Crossref","is-referenced-by-count":31,"title":["Rank-Metric Codes and Their Applications"],"prefix":"10.1108","volume":"19","author":[{"given":"Hannes","family":"Bartz","sequence":"first","affiliation":[{"name":"German Aerospace Center (DLR)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Holzbaur","sequence":"additional","affiliation":[{"name":"Technical University of Munich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hedongliang","family":"Liu","sequence":"additional","affiliation":[{"name":"Technical University of Munich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Puchinger","sequence":"additional","affiliation":[{"name":"Hensoldt Sensors GmbH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Renner","sequence":"additional","affiliation":[{"name":"Technical University of Munich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Technical University of Munich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2022,5,2]]},"reference":[{"issue":"7","key":"2026032712181828900_ref001","first-page":"2373","article-title":"Upper bounds for constantweight codes","volume":"46","author":"Agrell","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref002","article-title":"ROLLO - rank-ouroboros, LAKE & LOCKER","author":"Aguilar Melchor","year":"2019","journal-title":"Second round submission to the NIST post-quantum cryptography call"},{"key":"2026032712181828900_ref003","article-title":"Rank quasi cyclic (RQC)","author":"Aguilar Melchor","year":"2019","journal-title":"Second round submission to the NIST post-quantum cryptography call"},{"issue":"5","key":"2026032712181828900_ref004","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","article-title":"Efficient encryption from random quasi-cyclic codes","volume":"64","author":"Aguilar-Melchor","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712181828900_ref005","first-page":"1204","article-title":"Network information flow","volume":"46","author":"Ahlswede","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref006","article-title":"Status Report on the Second Round of the NIST Post-Quantum Cryptography Standardization Process","author":"Alagic","year":"2020","journal-title":"Tech. Rep."},{"issue":"1","key":"2026032712181828900_ref007","first-page":"1","article-title":"Generalized twisted fields","volume":"11","author":"Albert","year":"1961","journal-title":"Pacific J. Math"},{"issue":"1","key":"2026032712181828900_ref008","first-page":"53","article-title":"A new rank metric for convolutional codes","volume":"89","author":"Almeida","year":"2021","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref009","article-title":"BIKE - bit flipping key encapsulation","author":"Aragon","year":"2019","journal-title":"Second round submission to the NIST post-quantum cryptography call"},{"key":"2026032712181828900_ref010","first-page":"728","article-title":"Durandal: a rank metric based signature scheme","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Aragon","year":"2019"},{"key":"2026032712181828900_ref011","article-title":"A key recovery attack against LRPC using decryption failures","author":"Aragon","year":"2019"},{"issue":"12","key":"2026032712181828900_ref012","first-page":"7697","article-title":"Low rank parity check codes: new decoding algorithms and applications to cryptography","volume":"65","author":"Aragon","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref013","first-page":"2421","article-title":"A new algorithm for solving the rank syndrome decoding problem","author":"Aragon","year":"2018"},{"key":"2026032712181828900_ref014","first-page":"229","article-title":"A public key encryption scheme based on the polynomial reconstruction problem","volume":"2656","author":"Augot","year":"2003","journal-title":"LNCS: Revised selected papers of EUROCRYPT 2003"},{"key":"2026032712181828900_ref015","article-title":"Rank metric and Gabidulin codes in characteristic zero","author":"Augot","year":"2013"},{"issue":"8","key":"2026032712181828900_ref016","first-page":"1807","article-title":"Generalized Gabidulin codes over fields of any characteristic","volume":"86","author":"Augot","year":"2018","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref017","first-page":"1881","article-title":"On partial maximally-recoverable and maximally-recoverable codes","author":"Balaji","year":"2015"},{"issue":"1","key":"2026032712181828900_ref018","first-page":"1","article-title":"Enhanced public key security for the McEliece cryptosystem","volume":"29","author":"Baldi","year":"2016","journal-title":"Journal of Cryptography"},{"key":"2026032712181828900_ref019","article-title":"Cryptanalysis of a code-based signature scheme based on the Lyubashevsky framework","author":"Baldi","year":"2020"},{"key":"2026032712181828900_ref020","article-title":"An algebraic approach to the rank support learning problem","volume":"abs\/2103.03558","author":"Bardet","year":"2021","journal-title":"CoRR"},{"key":"2026032712181828900_ref021","first-page":"64","article-title":"An algebraic attack on rank metric code-based cryptosystems","author":"Bardet","year":"2020"},{"key":"2026032712181828900_ref022","first-page":"507","article-title":"Improvements of algebraic attacks for solving the rank decoding and Min-Rank problems","volume-title":"Lecture Notes in Computer Science","author":"Bardet","year":"2020"},{"issue":"2","key":"2026032712181828900_ref023","first-page":"801","article-title":"On the covering radius of mds codes","volume":"61","author":"Bartoli","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref024","article-title":"A new family of maximum scattered linear sets in PG(1, q6)","author":"Bartoli","year":"2019","journal-title":"arXiv preprint"},{"key":"2026032712181828900_ref025","article-title":"Algebraic Decoding of Subspace and Rank-Metric Codes","author":"Bartz","year":"2017","journal-title":"Ph.D. dissertation"},{"issue":"8","key":"2026032712181828900_ref026","doi-asserted-by":"publisher","first-page":"5026","DOI":"10.1109\/TIT.2021.3067318","article-title":"Fast decoding of codes in the rank, subspace, and sum-rank metric","volume":"67","author":"Bartz","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref027","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282407","article-title":"List and probabilistic unique decoding of folded subspace codes","author":"Bartz","year":"2015"},{"issue":"1-2","key":"2026032712181828900_ref028","first-page":"449","article-title":"Algebraic decoding of folded Gabidulin codes","volume":"82","author":"Bartz","year":"2017","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref029","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1109\/ALLERTON.2014.7028612","article-title":"Efficient interpolation-based decoding of interleaved subspace and Gabidulin codes","author":"Bartz","year":"2014"},{"issue":"4","key":"2026032712181828900_ref030","first-page":"773","article-title":"Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using gr\u00f6bner bases","volume":"12","author":"Bartz","year":"2018","journal-title":"Advances in Mathematics of Communications"},{"issue":"4","key":"2026032712181828900_ref031","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"Bassalygo","year":"1965","journal-title":"Probl. Inf. Transm."},{"issue":"11","key":"2026032712181828900_ref032","first-page":"3016","article-title":"Isometries for rank distance and permutation group of Gabidulin codes","volume":"49","author":"Berger","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref033","first-page":"247","article-title":"Gabidulin matrix codes and their application to small ciphertext size cryptosystems","author":"Berger","year":"2017"},{"key":"2026032712181828900_ref034","volume-title":"Algebraic Coding Theory","author":"Berlekamp","year":"1984"},{"key":"2026032712181828900_ref035","article-title":"Classic McEliece","author":"Bernstein","year":"2019","journal-title":"Second round submission to the NIST post-quantum cryptography call"},{"issue":"8","key":"2026032712181828900_ref036","first-page":"1767","article-title":"Rank metric codes and zeta functions","volume":"86","author":"Blanco-Chac\u00f3n","year":"2018","journal-title":"Designs, Codes and Cryptography"},{"issue":"7","key":"2026032712181828900_ref037","first-page":"4510","article-title":"Partial-MDS codes and their application to RAID type of architectures","volume":"59","author":"Blaum","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712181828900_ref038","first-page":"2673","article-title":"Construction of partial MDS and sector-disk codes with two global parity symbols","volume":"62","author":"Blaum","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref039","article-title":"Decoding supercodes of Gabidulin codes and applications to cryptanalysis","author":"Bombar","year":"2021","journal-title":"arXiv preprint"},{"issue":"4","key":"2026032712181828900_ref040","article-title":"Skew cyclic codes","volume":"18","author":"Boucher","year":"2007","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"2026032712181828900_ref041","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9704-4","article-title":"Linear codes using skew polynomials with automorphisms and derivations","author":"Boucher","year":"2012","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref042","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-10868-6_3","volume-title":"Cryptography and Coding","author":"Boucher","year":"2009"},{"issue":"12","key":"2026032712181828900_ref043","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1016\/j.jsc.2007.11.008","article-title":"Coding with skew polynomial rings","volume":"44","author":"Boucher","year":"2009","journal-title":"J. Symbolic Comput."},{"key":"2026032712181828900_ref044","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.laa.2020.03.006","article-title":"Rank-metric codes, generalized binomial moments and their zeta functions","volume":"604","author":"Byrne","year":"2020","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"2026032712181828900_ref045","first-page":"927","article-title":"Covering radius of matrix codes endowed with the rank metric","volume":"31","author":"Byrne","year":"2017","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2026032712181828900_ref046","first-page":"105 169","article-title":"Partition-balanced families of codes and asymptotic enumeration in coding theory","volume":"171","author":"Byrne","year":"2020","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"2026032712181828900_ref047","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1109\/ITW.2002.1115432","article-title":"Network coding and error correction","author":"Cai","year":"2002"},{"issue":"1","key":"2026032712181828900_ref048","first-page":"37","article-title":"Network error correction, II: lower bounds","volume":"6","author":"Cai","year":"2006","journal-title":"Communications in Information and Systems"},{"issue":"3","key":"2026032712181828900_ref049","first-page":"452","article-title":"A general construction for PMDS codes","volume":"21","author":"Calis","year":"2016","journal-title":"IEEE Communications Letters"},{"issue":"3","key":"2026032712181828900_ref050","first-page":"777","article-title":"Network routing capacity","volume":"52","author":"Cannons","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712181828900_ref051","first-page":"368","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201996","author":"Chabaud","year":"1996"},{"issue":"3","key":"2026032712181828900_ref052","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10623-008-9230-6","article-title":"Skew codes of prescribed distance or rank","volume":"50","author":"Chaussade","year":"2009","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref053","first-page":"486","article-title":"On the maximally recoverable property for multi-protection group codes","author":"Chen","year":"2007"},{"issue":"17","key":"2026032712181828900_ref054","first-page":"2315","article-title":"Fundamental limits of caching: improved bounds for users with small buffers","volume":"10","author":"Chen","year":"2016","journal-title":"IET Communications"},{"key":"2026032712181828900_ref055","article-title":"On the security of a Loidreau\u2019s rank metric code based encryption scheme","author":"Coggia","year":"2019"},{"key":"2026032712181828900_ref056","volume-title":"Covering codes","author":"Cohen","year":"1997"},{"issue":"3","key":"2026032712181828900_ref057","first-page":"328","article-title":"Covering radius\u2014survey and recent results","volume":"31","author":"Cohen","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712181828900_ref058","first-page":"1","article-title":"Elliptic periods for finite fields","volume":"15","author":"Couveignes","year":"2009","journal-title":"Finite Fields and Their Applications"},{"issue":"3","key":"2026032712181828900_ref059","first-page":"499","article-title":"Algebraic structures of MRD codes","volume":"10","author":"de la Cruz","year":"2016","journal-title":"Advances in Mathematics of Communications"},{"key":"2026032712181828900_ref060","first-page":"203","article-title":"A new family of MRD-codes","volume":"548","author":"Csajb\u00f3k","year":"2018","journal-title":"Linear Algebra and its Applications"},{"issue":"9","key":"2026032712181828900_ref061","first-page":"111 985","article-title":"MRD codes with maximum idealizers","volume":"343","author":"Csajb\u00f3k","year":"2020","journal-title":"Discrete Mathematics"},{"key":"2026032712181828900_ref062","first-page":"133","article-title":"New maximum scattered linear sets of the projective line","volume":"54","author":"Csajb\u00f3k","year":"2018","journal-title":"Finite Fields and Their Applications"},{"key":"2026032712181828900_ref063","article-title":"Wave: A new code-based signature scheme","author":"Debris-Alazard","year":"2018"},{"issue":"3","key":"2026032712181828900_ref064","first-page":"226","article-title":"Bilinear forms over a finite field with applications to coding theory","volume":"25","author":"Delsarte","year":"1978","journal-title":"Journal of Combinatorial Theory"},{"key":"2026032712181828900_ref065","first-page":"358","article-title":"On finite algebras","volume":"1905","author":"Dickson","year":"1905","journal-title":"Nachrichten von der Gesellschaft der Wissenschaften zu G\u00f6ttingen, Mathematisch-Physikalische Klasse"},{"issue":"4","key":"2026032712181828900_ref066","first-page":"514","article-title":"On commutative linear algebras in which division is always uniquely possible","volume":"7","author":"Dickson","year":"1906","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1","key":"2026032712181828900_ref067","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TIT.2014.2371915","article-title":"On list-decodability of random rank metric codes and subspace codes","volume":"61","author":"Ding","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712181828900_ref068","first-page":"51","article-title":"On list-decodability of random rank metric codes and subspace codes","volume":"61","author":"Ding","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref069","first-page":"1","article-title":"Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer","author":"Djomou","year":"2021","journal-title":"Arabian Journal of Mathematics"},{"issue":"6","key":"2026032712181828900_ref070","first-page":"1949","article-title":"Networks, matroids, and non-Shannon information inequalities","volume":"53","author":"Dougherty","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712181828900_ref071","first-page":"996","article-title":"Algebraic algorithms for vector network coding","volume":"57","author":"Ebrahimi","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712181828900_ref072","article-title":"A public-key cryptosystem from interleaved Goppa codes","author":"Elleuch","year":"2018","journal-title":"arXiv preprint"},{"issue":"2","key":"2026032712181828900_ref073","first-page":"1165","article-title":"Error-correcting codes in projective space","volume":"57","author":"Etzion","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712181828900_ref074","first-page":"2460","article-title":"Vector network coding based on subspace codes outperforms scalar linear network coding","volume":"64","author":"Etzion","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref075","first-page":"304","article-title":"A new public-key cryptosystem based on the problem of reconstructing p\u2013polynomials","author":"Faure","year":"2005"},{"key":"2026032712181828900_ref076","article-title":"Storage Architecture and Challenges","author":"Fikes","year":"2010"},{"key":"2026032712181828900_ref077","first-page":"163","article-title":"On identity testing of tensors, low-rank recovery and compressed sensing","author":"Forbes","year":"2012"},{"issue":"1","key":"2026032712181828900_ref078","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712181828900_ref079","first-page":"284","article-title":"Space-time codes based on rank codes","author":"Gabidulin","year":"2000"},{"issue":"2","key":"2026032712181828900_ref080","first-page":"103","article-title":"Symmetric Rank Codes","volume":"40","author":"Gabidulin","year":"2004","journal-title":"Probl. Inf. Transm."},{"issue":"2","key":"2026032712181828900_ref081","first-page":"171","article-title":"Attacks and counter-attacks on the GPT public key cryptosystem","volume":"48","author":"Gabidulin","year":"2008","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref082","article-title":"On public-key cryptosystems based on linear codes: efficiency and weakness","author":"Gabidulin","year":"1993"},{"key":"2026032712181828900_ref083","first-page":"168","article-title":"Modified GPT PKC with right scrambler","volume":"6","author":"Gabidulin","year":"2001","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"12","key":"2026032712181828900_ref084","first-page":"3289","article-title":"Reducible rank codes and their applications to cryptography","volume":"49","author":"Gabidulin","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref085","first-page":"482","article-title":"Ideals over a non-commutative ring and their application in cryptology","author":"Gabidulin","year":"1991"},{"key":"2026032712181828900_ref086","first-page":"1110","article-title":"On improving security of GPT cryptosystems","author":"Gabidulin","year":"2009"},{"key":"2026032712181828900_ref087","first-page":"126","volume-title":"Algebraic Coding, Lecture Notes in Computer Science","author":"Gabidulin","year":"1992"},{"key":"2026032712181828900_ref088","volume-title":"Rank Codes","author":"Gabidulin","year":"2021"},{"issue":"2","key":"2026032712181828900_ref089","first-page":"305","article-title":"Symmetric matrices and codes correcting rank errors beyond the [(d-1)\/2] bound","volume":"154","author":"Gabidulin","year":"2006","journal-title":"Discrete Applied Mathematics"},{"issue":"1-3","key":"2026032712181828900_ref090","first-page":"105","article-title":"Error and erasure correcting algorithms for rank codes","volume":"49","author":"Gabidulin","year":"2008","journal-title":"Designs, Codes and Cryptography"},{"issue":"2","key":"2026032712181828900_ref091","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","article-title":"On the complexity of the rank syndrome decoding problem","volume":"62","author":"Gaborit","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712181828900_ref092","first-page":"194","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Gaborit","year":"2017"},{"key":"2026032712181828900_ref093","first-page":"194","article-title":"Identity-based encryption from codes with rank metric","author":"Gaborit","year":"2017"},{"key":"2026032712181828900_ref094","first-page":"168","article-title":"Low rank parity check codes and their application to cryptography","author":"Gaborit","year":"2013"},{"issue":"2","key":"2026032712181828900_ref095","first-page":"1006","article-title":"On the complexity of the rank syndrome decoding problem","volume":"62","author":"Gaborit","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"2026032712181828900_ref096","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","article-title":"On the hardness of the decoding and the minimum distance problems for rank codes","volume":"62","author":"Gaborit","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712181828900_ref097","first-page":"3692","article-title":"Constructions of partial MDS codes over small fields","volume":"65","author":"Gabrys","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref098","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/glocom.2006.173","article-title":"Properties of codes with the rank metric","author":"Gadouleau","year":"2006"},{"issue":"7","key":"2026032712181828900_ref099","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1109\/TIT.2010.2048447","article-title":"Constant-rank codes and their connection to constant-dimension codes","volume":"56","author":"Gadouleau","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712181828900_ref100","first-page":"3873","article-title":"Packing and covering properties of rank metric codes","volume":"54","author":"Gadouleau","year":"2008","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref101","first-page":"1","article-title":"MacWilliams identity for codes with the rank metric","volume":"2008","author":"Gadouleau","year":"2008","journal-title":"EURASIP journal on wireless communications and networking"},{"issue":"9","key":"2026032712181828900_ref102","first-page":"691","article-title":"Bounds on covering codes with the rank metric","volume":"13","author":"Gadouleau","year":"2009","journal-title":"IEEE Communications Letters"},{"key":"2026032712181828900_ref103","first-page":"55","article-title":"A new algorithm for decoding Reed\u2013Solomon codes","volume-title":"Commun. Inf. Network Sec.","author":"Gao","year":"2003"},{"issue":"1","key":"2026032712181828900_ref104","first-page":"37","article-title":"Severely denting the Gabidulin version of the McEliece public key cryptosystem","volume":"6","author":"Gibson","year":"1995","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref105","first-page":"212","article-title":"The security of the Gabidulin public key cryptosystem","author":"Gibson","year":"1996"},{"issue":"4","key":"2026032712181828900_ref106","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1006\/jsco.1998.0224","article-title":"Factoring in skew-polynomial rings over finite fields","volume":"26","author":"Giesbrecht","year":"1998","journal-title":"J. Symb. Computation"},{"key":"2026032712181828900_ref107","first-page":"145","article-title":"On the sparseness of certain linear mrd codes","volume":"596","author":"Gluesing-Luerssen","year":"2020","journal-title":"Linear Algebra and its Applications"},{"issue":"10","key":"2026032712181828900_ref108","doi-asserted-by":"publisher","first-page":"4488","DOI":"10.1109\/TCOMM.2018.2834364","article-title":"Fundamental limits of caching: Improved rate-memory tradeoff with coded prefetching","volume":"66","author":"G\u00f3mez-Vilardeb\u00f3","year":"2018","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712181828900_ref109","first-page":"2092","article-title":"Maximally recoverable codes for grid-like topologies","author":"Gopalan","year":"2017"},{"issue":"9","key":"2026032712181828900_ref110","first-page":"5245","article-title":"Explicit maximally recoverable codes with locality","volume":"60","author":"Gopalan","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712181828900_ref111","first-page":"6925","article-title":"On the locality of codeword symbols","volume":"58","author":"Gopalan","year":"2012","journal-title":"IEEE Transactions on Information theory"},{"key":"2026032712181828900_ref112","article-title":"Rank-metric codes","author":"Gorla","year":"2019"},{"key":"2026032712181828900_ref113","first-page":"3","volume-title":"Network Coding and Subspace Designs","author":"Gorla","year":"2018"},{"key":"2026032712181828900_ref114","article-title":"Common complements of linear subspaces and the sparseness of mrd codes","author":"Gruica","year":"2020","journal-title":"SIAM Journal on Applied Algebra and Geometry"},{"key":"2026032712181828900_ref115","first-page":"789","article-title":"A key recovery attack on MDPC with CCA security using decoding errors","author":"Guo","year":"2016"},{"issue":"1","key":"2026032712181828900_ref116","first-page":"135","article-title":"Explicit codes achieving list decoding capacity: error-correction with optimal redundancy","volume":"54","author":"Guruswami","year":"2008","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712181828900_ref117","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1109\/TIT.2013.2246813","article-title":"Linear-algebraic list decoding for variants of Reed-Solomon codes","volume":"59","author":"Guruswami","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref118","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/2090236.2090252","article-title":"List decoding subspace codes from insertions and deletions","author":"Guruswami","year":"2012"},{"key":"2026032712181828900_ref119","article-title":"Explicit rank-metric codes list-decodable with optimal redundancy","volume":"20","author":"Guruswami","year":"2013","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"2026032712181828900_ref120","article-title":"Explicit rank-metric codes list-decodable with optimal redundancy","volume":"abs\/1311.7084","author":"Guruswami","year":"2013","journal-title":"CoRR"},{"issue":"5","key":"2026032712181828900_ref121","first-page":"2707","article-title":"Explicit list-decodable rank-metric and subspace codes via subspace designs","volume":"62","author":"Guruswami","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref122","first-page":"162","article-title":"Fast recursive linearized feedback shift register synthesis","author":"Hassan","year":"2010"},{"key":"2026032712181828900_ref123","first-page":"2747","article-title":"New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem","author":"Hauteville","year":"2015"},{"issue":"10","key":"2026032712181828900_ref124","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","article-title":"A random linear network coding approach to multicast","volume":"52","author":"Ho","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref125","first-page":"1887","article-title":"On decoding and applications of interleaved Goppa codes","author":"Holzbaur","year":"2019"},{"key":"2026032712181828900_ref126","article-title":"Correctable erasure patterns in product topologies","author":"Holzbaur","year":"2021"},{"key":"2026032712181828900_ref127","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3091455","article-title":"Partial MDS codes with regeneration","author":"Holzbaur","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712181828900_ref128","first-page":"319","article-title":"Extension of Overbeck\u2019s attack for Gabidulin-based cryptosystems","volume":"86","author":"Horlemann-Trautmann","year":"2018","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"2026032712181828900_ref129","first-page":"533","article-title":"New criteria for MRD and Gabidulin codes and some rank-metric code constructions","volume":"11","author":"Horlemann-Trautmann","year":"2017","journal-title":"Advances in Mathematics of Communications"},{"key":"2026032712181828900_ref130","first-page":"2544","article-title":"Considerations for rank-based cryptosystems","author":"Horlemann-Trautmann","year":"2016"},{"issue":"1","key":"2026032712181828900_ref131","first-page":"69","article-title":"A complete classification of partial-MDS (maximally recoverable) codes with one global parity","volume":"14","author":"Horlemann-Trautmann","year":"2020","journal-title":"Advances in Mathematics of Communications"},{"key":"2026032712181828900_ref132","first-page":"1591","article-title":"New constructions of SD and MR codes over small finite fields","author":"Hu","year":"2016"},{"key":"2026032712181828900_ref133","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/NCA.2007.37","article-title":"Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems","author":"Huang","year":"2007"},{"key":"2026032712181828900_ref134","volume-title":"The Theory of Rings","author":"Jacobson","year":"1943"},{"key":"2026032712181828900_ref135","volume-title":"Finite-Dimensional Division Algebras over Fields","author":"Jacobson","year":"1996"},{"issue":"6","key":"2026032712181828900_ref136","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","article-title":"Polynomial time algorithms for multicast network code construction","volume":"51","author":"Jaggi","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref137","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/ISIT45174.2021.9518115","article-title":"Decoding of Space-Symmetric Rank Errors","author":"Jerkovits","year":"2021"},{"issue":"3","key":"2026032712181828900_ref138","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1962.1057714","article-title":"A new upper bound for error-correcting codes","volume":"8","author":"Johnson","year":"1962","journal-title":"IRE Trans. Inf. Theory"},{"key":"2026032712181828900_ref139","article-title":"On defining generalized rank weights","author":"Jurrius","year":"2015","journal-title":"arXiv preprint"},{"issue":"9","key":"2026032712181828900_ref140","first-page":"5454","article-title":"Codes with locality in the rank and subspace metrics","volume":"65","author":"Kadhe","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712181828900_ref141","first-page":"987","article-title":"On decoding additive generalized twisted Gabidulin codes","volume":"12","author":"Kadir","year":"2020","journal-title":"Cryptography and Communications"},{"key":"2026032712181828900_ref142","article-title":"On interpolation-based decoding of a class of maximum rank distance codes","author":"Kadir","year":"2021","journal-title":"arXiv preprint"},{"issue":"8","key":"2026032712181828900_ref143","first-page":"4637","article-title":"Codes with local regeneration and erasure correction","volume":"60","author":"Kamath","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref144","article-title":"Low-rank parity-check codes over finite commutative rings and application to cryptography","author":"Kamche","year":"2021","journal-title":"arXiv preprint"},{"issue":"12","key":"2026032712181828900_ref145","first-page":"7718","article-title":"Rank-metric codes over finite principal ideal rings and applications","volume":"65","author":"Kamche","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712181828900_ref146","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TNET.2008.923722","article-title":"XORs in the air: practical wireless network coding","volume":"16","author":"Katti","year":"2008","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712181828900_ref147","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10868-6_1","volume-title":"Cryptography and Coding","author":"Khaleghi","year":"2009"},{"key":"2026032712181828900_ref148","first-page":"131","article-title":"Modeling network coded tcp throughput: a simple model and its validation","volume-title":"VALUETOOLS \u201911","author":"Kim","year":"2011"},{"key":"2026032712181828900_ref149","unstructured":"D. E.\n              Knuth\n            , \u201cFinite semifields and projective planes,\u201d Ph.D. dissertation, California Institute of Technology, 1963."},{"issue":"8","key":"2026032712181828900_ref150","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","article-title":"Coding for errors and erasures in random network coding","volume":"54","author":"K\u00f6tter","year":"2008","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"2026032712181828900_ref151","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","article-title":"Coding for errors and erasures in random network coding","volume":"54","author":"K\u00f6tter","year":"2008","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"5","key":"2026032712181828900_ref152","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","article-title":"An algebraic approach to network coding","volume":"11","author":"K\u00f6tter","year":"2003","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"5","key":"2026032712181828900_ref153","doi-asserted-by":"publisher","first-page":"2740","DOI":"10.1109\/20.617715","article-title":"Decoding for iterative Reed-Solomon coding schemes","volume":"33","author":"Krachkovsky","year":"1997","journal-title":"IEEE Transactions on Magnetics"},{"key":"2026032712181828900_ref154","article-title":"RAMESSES, a rank metric encryption scheme with short keys","author":"Lavauzelle","year":"2019"},{"issue":"7","key":"2026032712181828900_ref155","first-page":"1285","article-title":"Cryptanalysis of a system based on twisted reed\u2013solomon codes","volume":"88","author":"Lavauzelle","year":"2020","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref156","first-page":"119","article-title":"Application of rank metric codes in digital image watermarking","volume":"74","author":"Lef\u00e8vre","year":"2019","journal-title":"Signal Processing: Image Communication"},{"key":"2026032712181828900_ref157","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"Lehman","year":"2004"},{"issue":"3","key":"2026032712181828900_ref158","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1080\/10586458.2018.1470045","article-title":"Rook theory of the finite general linear group","volume":"29","author":"Lewis","year":"2020","journal-title":"Experimental Mathematics"},{"key":"2026032712181828900_ref159","first-page":"2054","article-title":"Interpolation-based decoding of nonlinear maximum rank distance codes","author":"Li","year":"2019"},{"key":"2026032712181828900_ref160","article-title":"On decoding additive generalized twisted Gabidulin codes","author":"Li","year":"2019"},{"issue":"2","key":"2026032712181828900_ref161","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","article-title":"Linear network coding","volume":"49","author":"Li","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref162","first-page":"571","article-title":"On transform-domain error and erasure correction by Gabidulin codes","volume":"73","author":"Li","year":"2014","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref163","volume-title":"Finite Fields","author":"Lidl","year":"1996"},{"key":"2026032712181828900_ref164","volume-title":"Error Control Coding","author":"Lin","year":"2004"},{"issue":"1","key":"2026032712181828900_ref165","first-page":"159","article-title":"List decodability of random subcodes of Gabidulin codes","volume":"63","author":"Liu","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref166","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9716-0","article-title":"Asymptotic behaviour of codes in rank metric over finite fields","author":"Loidreau","year":"2012","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref167","article-title":"An evolution of GPT cryptosystem","author":"Loidreau","year":"2016"},{"key":"2026032712181828900_ref168","first-page":"186","article-title":"Decoding rank errors beyond the error correcting capability","author":"Loidreau","year":"2006"},{"key":"2026032712181828900_ref169","first-page":"36","volume-title":"Coding and cryptography","author":"Loidreau","year":"2006"},{"key":"2026032712181828900_ref170","first-page":"192","article-title":"Properties of codes in rank metric","volume-title":"International Workshop on Algebraic and Combinatorial Coding Theory (ACCT)","author":"Loidreau","year":"2008"},{"key":"2026032712181828900_ref171","first-page":"142","article-title":"Designing a rank metric based McEliece cryptosystem","volume-title":"International Workshop on Post-Quantum Cryptography","author":"Loidreau","year":"2010"},{"key":"2026032712181828900_ref172","article-title":"A new rank metric codes based encryption scheme","volume-title":"8th Int. Conf. on Post-Quantum Cryptography (PQCrypto)","author":"Loidreau","year":"2017"},{"key":"2026032712181828900_ref173","first-page":"95","article-title":"Generalized unified construction of space-time codes with optimal rate-diversity tradeoff","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Lu","year":"2004"},{"key":"2026032712181828900_ref174","first-page":"79","article-title":"Generalized twisted Gabidulin codes","volume":"159","author":"Lunardon","year":"2018","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"10","key":"2026032712181828900_ref175","first-page":"2757","article-title":"Maximum rank distance codes as space-time codes","volume":"49","author":"Lusina","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref176","first-page":"738","article-title":"Lattice signatures without trapdoors","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Lyubashevsky","year":"2012"},{"key":"2026032712181828900_ref177","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1988"},{"issue":"5","key":"2026032712181828900_ref178","doi-asserted-by":"publisher","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental limits of caching","volume":"60","author":"Maddah-Ali","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref179","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/ISIT.2010.5513656","article-title":"Algebraic list-decoding on the operator channel","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Mahdavifar","year":"2010"},{"key":"2026032712181828900_ref180","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1109\/ISIT.2012.6283511","article-title":"List-decoding of subspace codes and rank-metric codes up to Singleton bound","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Mahdavifar","year":"2012"},{"key":"2026032712181828900_ref181","first-page":"99","article-title":"MRD-codes arising from the trinomial xq + xq3 + c xq5 \u2208 Fq6[x]","volume":"591","author":"Marino","year":"2020","journal-title":"Linear Algebra and its Applications"},{"issue":"12","key":"2026032712181828900_ref182","first-page":"7790","article-title":"Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes","volume":"65","author":"Mart\u00ednez-Pe\u00f1as","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref183","article-title":"Codes in the sum-rank metric","author":"Mart\u00ednez-Pe\u00f1as","year":"2021"},{"issue":"3","key":"2026032712181828900_ref184","first-page":"269","article-title":"Equalities and inequalities for ranks of matrices","volume":"2","author":"Matsaglia","year":"1974","journal-title":"Linear and Multilinear Algebra"},{"key":"2026032712181828900_ref185","article-title":"On the average list size for the guruswami\u2013sudan decoder","volume-title":"7th International Symposium on Communications Theory and Applications (ISCTA)","author":"McEliece","year":"2003"},{"issue":"44","key":"2026032712181828900_ref186","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"42","author":"McEliece","year":"1978","journal-title":"Deep Space Network Progress Report"},{"key":"2026032712181828900_ref187","article-title":"On coding for non-multicast networks","volume-title":"41st Allerton Conference on Communication, Control and Computing","author":"Medard","year":"2003"},{"key":"2026032712181828900_ref188","article-title":"Weight and rank of matrices over finite fields","author":"Migler","year":"2004"},{"key":"2026032712181828900_ref189","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1090\/S0002-9904-1896-00337-2","article-title":"A two-fold generalization of Fermat\u2019s theorem","volume":"2","author":"Moore","year":"1896","journal-title":"Bull. Amer. Math. Soc."},{"issue":"11","key":"2026032712181828900_ref190","first-page":"7035","article-title":"Equivalence for rank-metric and matrix codes and automorphism groups of Gabidulin codes","volume":"60","author":"Morrison","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref191","first-page":"161","article-title":"Low-rank matrix recovery using Gabidulin codes in characteristic zero","volume-title":"Electronic Notes in Discrete Mathematics","author":"M\u00fcelich","year":"2017"},{"key":"2026032712181828900_ref192","first-page":"2549","article-title":"An alternative decoding method for Gabidulin codes in characteristic zero","volume-title":"2016 IEEE International Symposium on Information Theory (ISIT)","author":"M\u00fcelich","year":"2016"},{"key":"2026032712181828900_ref193","first-page":"383","article-title":"f4: facebook\u2019s warm BLOB storage system","volume-title":"11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)","author":"Muralidhar","year":"2014"},{"key":"2026032712181828900_ref194","first-page":"248","article-title":"Column rank distances of rank metric convolutional codes","volume-title":"International Castle Meeting on Coding Theory and Applications","author":"Napp","year":"2017"},{"key":"2026032712181828900_ref195","first-page":"2766","article-title":"MRD rank metric convolutional codes","volume-title":"2017 IEEE International Symposium on Information Theory (ISIT)","author":"Napp","year":"2017"},{"key":"2026032712181828900_ref196","article-title":"Faster decoding of rank metric convolutional codes","volume-title":"23rd International Symposium on Mathematical Theory of Networks and Systems","author":"Napp","year":"2018"},{"key":"2026032712181828900_ref197","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.laa.2020.02.002","article-title":"Systematic encoders for generalized Gabidulin codes and the q-analogue of Cauchy matrices","volume":"593","author":"Neri","year":"2020","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"2026032712181828900_ref198","first-page":"341","article-title":"On the genericity of maximum rank distance and Gabidulin codes","volume":"86","author":"Neri","year":"2018","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref199","first-page":"418","article-title":"Equivalence and characterizations of linear rank-metric codes based on invariants","volume":"603","author":"Neri","year":"2020","journal-title":"Linear Algebra and its Applications"},{"key":"2026032712181828900_ref200","article-title":"Post\u2013quantum cryptography standardization","author":"NIST","year":"2017"},{"key":"2026032712181828900_ref201","first-page":"559","article-title":"On a special class of polynomials","volume":"35","author":"Ore","year":"1933","journal-title":"Transactions of the American Mathematical Society"},{"issue":"3","key":"2026032712181828900_ref202","first-page":"480","article-title":"Theory of non-commutative polynomials","volume":"34","author":"Ore","year":"1933","journal-title":"Ann. Math."},{"issue":"3","key":"2026032712181828900_ref203","first-page":"589","article-title":"Explicit constructions of some non-Gabidulin linear maximum rank distance codes","volume":"10","author":"Otal","year":"2016","journal-title":"Advances in Mathematics of Communications"},{"issue":"1","key":"2026032712181828900_ref204","first-page":"164","article-title":"Additive rank metric codes","volume":"63","author":"Otal","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref205","article-title":"Improved cryptanalysis of rank metric schemes based on Gabidulin codes","author":"Otmani","year":"2017"},{"issue":"3","key":"2026032712181828900_ref206","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","article-title":"New technique for decoding codes in the rank metric and its cryptography applications","volume":"38","author":"Ourivski","year":"2002","journal-title":"Problems of Information Transmission"},{"issue":"1","key":"2026032712181828900_ref207","first-page":"207","article-title":"Column scrambler for the GPT cryptosystem","volume":"128","author":"Ourivski","year":"2003","journal-title":"Discrete Applied Mathematics"},{"key":"2026032712181828900_ref208","first-page":"50","article-title":"A new structural attack for GPT and variants","volume-title":"LNCS: MYCRYPT","author":"Overbeck","year":"2005"},{"key":"2026032712181828900_ref209","first-page":"178","article-title":"Extending Gibson\u2019s attacks on the GPT cryptosystem","volume-title":"LNCS: Revised Selected Papers of WCC 2005","author":"Overbeck","year":"2006"},{"issue":"2","key":"2026032712181828900_ref210","first-page":"280","article-title":"Structural attacks for public key cryptosystems based on Gabidulin codes","volume":"21","author":"Overbeck","year":"2008","journal-title":"Journal of Cryptology"},{"key":"2026032712181828900_ref211","first-page":"103","article-title":"An algebraic approach to association schemes of coding theory","volume-title":"Philips research reports supplements","author":"Delsarte","year":"1973"},{"key":"2026032712181828900_ref212","first-page":"228","article-title":"The Erd\u00f6s-Ko-Rado theorem for vector spaces","volume":"43","author":"Frankl","year":"1986","journal-title":"Journal of Combinatorial Theory"},{"key":"2026032712181828900_ref213","article-title":"An analogue of Berlekamp-Massey algorithm for decoding codes in rank metric","volume-title":"Moscow Institute of Physics and Technology (MIPT)","author":"Paramonov","year":"1991"},{"key":"2026032712181828900_ref214","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/11779360_2","article-title":"On Codes Correcting Symmetric Rank Errors","volume-title":"Coding and Cryptography","author":"Pilipchuk","year":"2005"},{"issue":"1-2","key":"2026032712181828900_ref215","first-page":"389","article-title":"Row reduction applied to decoding of rank-metric and subspace codes","volume":"82","author":"Puchinger","year":"2017","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref216","article-title":"Twisted Gabidulin codes in the GPT cryptosystem","volume-title":"arXiv preprint arXiv:1806.10055","author":"Puchinger","year":"2018"},{"key":"2026032712181828900_ref217","article-title":"Efficient decoding of Gabidulin codes over Galois rings","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Puchinger","year":"2021"},{"key":"2026032712181828900_ref218","article-title":"Further generalisations of twisted Gabidulin codes","volume-title":"International Workshop on Coding and Cryptography (WCC)","author":"Puchinger","year":"2017"},{"key":"2026032712181828900_ref219","first-page":"125","article-title":"Space-time codes based on rank-metric codes and their decoding","volume-title":"2016 International Symposium on Wireless Communication Systems (ISWCS)","author":"Puchinger","year":"2016"},{"key":"2026032712181828900_ref220","article-title":"Sub-quadratic decoding of Gabidulin codes","volume-title":"IEEE Int. Symp. Inf. Theory (ISIT)","author":"Puchinger","year":"2016"},{"key":"2026032712181828900_ref221","first-page":"194","article-title":"Fast operations on linearized polynomials and their applications in coding theory","volume":"89","author":"Puchinger","year":"2018","journal-title":"Journal of Symbolic Computation"},{"key":"2026032712181828900_ref222","article-title":"A decoding algorithm for rank metric codes","volume-title":"arXiv preprint arXiv:1712.070760","author":"Randrianarisoa","year":"2017"},{"key":"2026032712181828900_ref223","first-page":"2771","article-title":"A decoding algorithm for twisted Gabidulin codes","volume-title":"2017 IEEE International Symposium on Information Theory (ISIT)","author":"Randrianarisoa","year":"2017"},{"key":"2026032712181828900_ref224","article-title":"A geometric approach to rank metric codes and a classification of constant weight codes","volume-title":"CoRR","author":"Randrianarisoa","year":"2019"},{"key":"2026032712181828900_ref225","first-page":"2463","article-title":"A smart approach for GPT cryptosystem based on rank codes","volume-title":"2010 IEEE International Symposium on Information Theory","author":"Rashwan","year":"2010"},{"issue":"8","key":"2026032712181828900_ref226","first-page":"937","article-title":"Security of the GPT cryptosystem and its applications to cryptography","volume":"4","author":"Rashwan","year":"2011","journal-title":"Security and Communication Networks"},{"issue":"1","key":"2026032712181828900_ref227","first-page":"197","article-title":"Rank-metric codes and their duality theory","volume":"80","author":"Ravagnani","year":"2016","journal-title":"Designs, Codes and Cryptography"},{"issue":"4","key":"2026032712181828900_ref228","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1109\/TIT.2016.2532343","article-title":"Some Gabidulin codes cannot be list decoded efficiently at any radius","volume":"62","author":"Raviv","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712181828900_ref229","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","article-title":"Optimal locally repairable and secure codes for distributed storage systems","volume":"60","author":"Rawat","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref230","article-title":"Interleaving Loidreau\u2019s rank-metric cryptosystem","volume-title":"XVI International Symposium \"Problems of Redundancy in Information and Control Systems\"","author":"Renner","year":"2019"},{"key":"2026032712181828900_ref231","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/REDUNDANCY48165.2019.9003356","article-title":"Efficient decoding of interleaved low-rank parity-check codes","volume-title":"2019 XVI International Symposium \"Problems of Redundancy in Information and Control Systems\" (REDUNDANCY)","author":"Renner","year":"2019"},{"key":"2026032712181828900_ref232","article-title":"Randomized decoding of Gabidulin codes beyond the unique decoding radius","volume-title":"International Conference on Post-Quantum Cryptography (PQCrypto)","author":"Renner","year":"2020"},{"issue":"2","key":"2026032712181828900_ref233","first-page":"351","article-title":"Low-rank parity-check codes over Galois rings","volume":"89","author":"Renner","year":"2021","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref234","article-title":"Decoding high-order interleaved rank-metric codes","volume-title":"IEEE Int. Symp. Inf. Theory (ISIT)","author":"Renner","year":"2021"},{"issue":"6","key":"2026032712181828900_ref235","first-page":"1279","article-title":"LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding","volume":"89","author":"Renner","year":"2021","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref236","article-title":"Low-rank parity-check codes over the ring of integers modulo a prime power","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Renner","year":"2020"},{"key":"2026032712181828900_ref237","article-title":"Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm","volume-title":"International ITG Conference on Systems, Communications and Coding 2004 (SCC)","author":"Richter","year":"2004"},{"key":"2026032712181828900_ref238","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1109\/ISIT.2004.1365435","article-title":"Fast decoding of rank-codes with rank errors and column erasures","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Richter","year":"2004"},{"issue":"2","key":"2026032712181828900_ref239","first-page":"120","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Communications of the ACM"},{"key":"2026032712181828900_ref240","first-page":"2559","article-title":"A quadratic Welch-Berlekamp algorithm to decode generalized Gabidulin codes, and some variants","volume-title":"2016 IEEE International Symposium on Information Theory (ISIT)","author":"Robert","year":"2016"},{"issue":"2","key":"2026032712181828900_ref241","first-page":"328","article-title":"Maximum-rank array codes and their application to crisscross error correction","volume":"37","author":"Roth","year":"1991","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712181828900_ref242","first-page":"2146","article-title":"Tensor codes for the rank metric","volume":"42","author":"Roth","year":"1996","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712181828900_ref243","first-page":"944","article-title":"On decoding rank-metric codes over large fields","volume":"64","author":"Roth","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712181828900_ref244","first-page":"826","article-title":"On generator matrices of MDS codes (corresp.)","volume":"31","author":"Roth","year":"1985","journal-title":"IEEE transactions on information theory"},{"key":"2026032712181828900_ref245","first-page":"51","article-title":"Decoding one out of many","volume-title":"Post-Quantum Cryptography","author":"Sendrier","year":"2011"},{"issue":"3","key":"2026032712181828900_ref246","first-page":"475","article-title":"A new family of linear maximum rank distance codes","volume":"10","author":"Sheekey","year":"2016","journal-title":"Advances in Mathematics of Communications"},{"key":"2026032712181828900_ref247","first-page":"255","volume-title":"Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications","author":"Sheekey","year":"2019"},{"key":"2026032712181828900_ref248","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12281","article-title":"New semifields and new MRD codes from skew polynomial rings","author":"Sheekey","year":"2019","journal-title":"Journal of the London Mathematical Society"},{"key":"2026032712181828900_ref249","first-page":"79","article-title":"An IND-CCA-secure code-based encryption scheme using rank metric","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2019","author":"Shehhi","year":"2019"},{"issue":"2","key":"2026032712181828900_ref250","first-page":"303","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM review"},{"key":"2026032712181828900_ref251","first-page":"1148","article-title":"Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Sidorenko","year":"2010"},{"issue":"2","key":"2026032712181828900_ref252","first-page":"621","article-title":"Skew-feedback shift-register synthesis and decoding interleaved Gabidulin codes","volume":"57","author":"Sidorenko","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712181828900_ref253","doi-asserted-by":"publisher","first-page":"6025","DOI":"10.1109\/TIT.2011.2162173","article-title":"Linearized shift-register synthesis","volume":"57","author":"Sidorenko","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1-2","key":"2026032712181828900_ref254","first-page":"55","article-title":"Fast skew-feedback shift-register synthesis","volume":"70","author":"Sidorenko","year":"2014","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref255","doi-asserted-by":"publisher","first-page":"2858","DOI":"10.1109\/ISIT.2009.5205272","article-title":"Fast encoding and decoding of Gabidulin codes","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Silva","year":"2009"},{"issue":"12","key":"2026032712181828900_ref256","doi-asserted-by":"publisher","first-page":"5479","DOI":"10.1109\/tit.2009.2032817","article-title":"On metrics for error correction in network coding","volume":"55","author":"Silva","year":"2009","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref257","unstructured":"D.\n              Silva\n            , \u201cError Control for Network Coding,\u201d Ph.D. dissertation, University of Toronto, Toronto, Canada, 2009."},{"issue":"9","key":"2026032712181828900_ref258","first-page":"3951","article-title":"A rank-metric approach to error control in random network coding","volume":"54","author":"Silva","year":"2008","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref259","first-page":"1537","article-title":"Reed\u2013Solomon codes over fields of characteristic zero","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Sippel","year":"2019"},{"key":"2026032712181828900_ref260","first-page":"790","article-title":"Private information retrieval over random linear networks","volume":"15","author":"Tajeddine","year":"2019","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"8","key":"2026032712181828900_ref261","first-page":"4661","article-title":"A family of optimal locally recoverable codes","volume":"60","author":"Tamo","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712181828900_ref262","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TIT.2018.2794543","article-title":"Caching and delivery via interference elimination","volume":"6","author":"Tian","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref263","article-title":"List decoding of lifted Gabidulin codes via the pl\u00fccker embedding","volume-title":"International Workshop on Coding and Cryptography (WCC)","author":"Trautmann","year":"2013"},{"issue":"9","key":"2026032712181828900_ref264","first-page":"5379","article-title":"On the list decodability of rank metric codes","volume":"66","author":"Trombetti","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref265","article-title":"Pseudorandomness","author":"Vadhan","year":"2011","journal-title":"Foundation and Trends in Theoretical Computer Science"},{"issue":"2","key":"2026032712181828900_ref266","first-page":"117","article-title":"On (partial) unit memory codes based on Gabidulin codes","volume":"47","author":"Wachter","year":"2011","journal-title":"Problems of Information Transmission"},{"key":"2026032712181828900_ref267","doi-asserted-by":"publisher","first-page":"2426","DOI":"10.1109\/ISIT.2018.8437561","article-title":"Repairing the Faure-Loidreau public-key cryptosystem","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Wachter-Zeh","year":"2018"},{"issue":"11","key":"2026032712181828900_ref268","doi-asserted-by":"publisher","first-page":"7268","DOI":"10.1109\/TIT.2013.2274653","article-title":"Bounds on list decoding of rank-metric codes","volume":"59","author":"Wachter-Zeh","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712181828900_ref269","first-page":"57","article-title":"Fast decoding of Gabidulin codes","volume":"66","author":"Wachter-Zeh","year":"2013","journal-title":"Des. Codes Cryptogr."},{"key":"2026032712181828900_ref270","first-page":"1","article-title":"Rank metric convolutional codes for random linear network coding","volume-title":"2012 International Symposium on Network Coding (NetCod)","author":"Wachter-Zeh","year":"2012"},{"issue":"6","key":"2026032712181828900_ref271","first-page":"3199","article-title":"Convolutional codes in rank metric with application to random network coding","volume":"61","author":"Wachter-Zeh","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712181828900_ref272","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s10623-014-9953-5","article-title":"List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques","volume":"73","author":"Wachter-Zeh","year":"2014","journal-title":"Designs, Codes and Cryptography"},{"key":"2026032712181828900_ref273","volume-title":"Geometry of matrices: in memory of professor LK Hua (1910\u20131985)","author":"Wan","year":"1996"},{"issue":"4","key":"2026032712181828900_ref274","first-page":"866","article-title":"Linear authentication codes: bounds and constructions","volume":"49","author":"Wang","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712181828900_ref275","first-page":"3394","article-title":"A new class of rank-metric codes and their list decoding beyond the unique decoding radius","volume":"64","author":"Xing","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712181828900_ref276","first-page":"19","article-title":"Network error correction, I: basic concepts and upper bounds","volume":"6","author":"Yeung","year":"2006","journal-title":"Communications in Information and Systems"},{"issue":"2","key":"2026032712181828900_ref277","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1109\/TIT.2017.2785237","article-title":"The exact rate-memory tradeoff for caching with uncoded prefetching","volume":"64","author":"Yu","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181828900_ref278","article-title":"Practical network coding","volume-title":"41st Annual Allerton Conference on Communication, Control, and Computing","author":"Yunnan","year":"2003"},{"issue":"2","key":"2026032712181828900_ref279","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/18.978730","article-title":"Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel","volume":"48","author":"Zheng","year":"2002","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/19\/3\/391\/11137477\/0100000119en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/19\/3\/391\/11137477\/0100000119en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:44Z","timestamp":1777471844000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/19\/3\/391\/1331439\/Rank-Metric-Codes-and-Their-Applications"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":279,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5,2]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000119","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,2]]}}}