Etzion T., “Sequence Folding, Lattice Tiling, and Multidimensional Coding”, IEEE Trans Inform Theory, 57:7 (2011), 4383–4400
Gaborit Ph., Schrek J., Zemor G., “Full Cryptanalysis of the Chen Identification Protocol”, Post-Quantum Cryptography, Lecture Notes in Computer Science, 7071, ed. Yang B., Springer-Verlag Berlin, 2011, 35–50
Э. М. Габидулин, Н. И. Пилипчук, М. Боссерт, “Декодирование случайных сетевых кодов”, Пробл. передачи информ., 46:4 (2010), 33–55 ; E. M. Gabidulin, N. I. Pilipchuk, M. Bossert, “Decoding of random network codes”, Problems Inform. Transmission, 46:4 (2010), 300–320
Rashwan H., Gabidulin E.M., Honary B., “A Smart Approach for GPT Cryptosystem Based on Rank Codes”, 2010 IEEE International Symposium on Information Theory, IEEE International Symposium on Information Theory, 2010, 2463–2467
Loidreau P., “Designing a Rank Metric Based McEliece Cryptosystem”, Post-Quantum Cryptography, Proceedings, Lecture Notes in Computer Science, 6061, 2010, 142–152
Gabidulin E.M., Rashwan H., Honary B., “On improving security of GPT cryptosystems”, 2009 IEEE International Symposium on Information Theory, 2009, 1110–1114
Bossert M., Gabidulin E.M., “One family of Algebraic Codes for Network Coding”, 2009 IEEE International Symposium on Information Theory, 2009, 2863–2866
Gabidulin, EM, “Error and erasure correcting algorithms for rank codes”, Designs Codes and Cryptography, 49:1–3 (2008), 105
Gabidulin, EM, “Properties of subspace subcodes of Gabidulin codes”, Advances in Mathematics of Communications, 2:2 (2008), 147
Pilipchuk, NI, “On codes correcting symmetric rank errors”, Coding and Cryptography, 3969 (2006), 14
Loidreau, P, “A Welch-Berlekamp like algorithm for decoding Gabidulin codes”, Coding and Cryptography, 3969 (2006), 36
Overbeck, R, “Extending Gibson's attacks on the GPT cryptosystem”, Coding and Cryptography, 3969 (2006), 178
Faure, C, “A new public-key cryptosystem based on the problem of reconstructing p-polynomials”, Coding and Cryptography, 3969 (2006), 304
Gabidulin, EM, “Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound”, Discrete Applied Mathematics, 154:2 (2006), 305
Gadouleau M., Yan Zh., “Decoder error probability of MRD codes”, Proceedings of 2006 IEEE Information Theory Workshop, 2006, 264–268
Gadouleau M., Yan Zh., “Security of the GPT-type cryptosystems”, 2006 IEEE International Symposium on Information Theory, 2006, 724–728
Berger T., Loidreau Pierre., “Designing an efficient and secure public-key cryptosystem based on reducible rank codes”, Lecture Notes in Comput. Sci., Progress in cryptology (INDOCRYPT 2004), 3348, Springer, Berlin, 2004, 218–229
Э. М. Габидулин, Н. И. Пилипчук, “Симметричные ранговые коды”, Пробл. передачи информ., 40:2 (2004), 3–18 ; È. M. Gabidulin, N. I. Pilipchuk, “Symmetric Rank Codes”, Problems Inform. Transmission, 40:2 (2004), 103–117
Gabidulin, EM, “Reducible rank codes and their applications to cryptography”, IEEE Transactions on Information Theory, 49:12 (2003), 3289
Э. М. Габидулин, В. А. Обернихин, “Коды в $\mathcal F$-метрике Вандермонда и их применение”, Пробл. передачи информ., 39:2 (2003), 3–14 ; È. M. Gabidulin, V. A. Obernikhin, “Codes in the Vandermonde $\mathcal F$-Metric and Their Applications”, Problems Inform. Transmission, 39:2 (2003), 159–169