RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 1985, Volume 21, Issue 1, Pages 3–16 (Mi ppi967)  

This article is cited in 36 scientific papers (total in 36 papers)

Information Theory and Coding Theory

Theory of Codes with Maximum Rank Distance

È. M. Gabidulin


Abstract: The article considers codes over $GF(q^N)$. A new metric, called the rank metric, is introduced; the maximum number of coordinates of vector $\mathbf{x}=(x_1,…,x_n)$ that are linearly dependent over $GF(q)$ is called its norm. For this metric a theory analogous to the theory of MDS codes is formulated. Codes with maximum rank distance are described; their spectrum is obtained; and encoding and decoding algorithms are given.

Full text: PDF file (1379 kB)

English version:
Problems of Information Transmission, 1985, 21:1, 1–12

Bibliographic databases:

UDC: 621.391.15
Received: 17.09.1984

Citation: È. M. Gabidulin, “Theory of Codes with Maximum Rank Distance”, Probl. Peredachi Inf., 21:1 (1985), 3–16; Problems Inform. Transmission, 21:1 (1985), 1–12

Citation in format AMSBIB
\Bibitem{Gab85}
\by \`E.~M.~Gabidulin
\paper Theory of Codes with Maximum Rank Distance
\jour Probl. Peredachi Inf.
\yr 1985
\vol 21
\issue 1
\pages 3--16
\mathnet{http://mi.mathnet.ru/ppi967}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=791529}
\zmath{https://zbmath.org/?q=an:0585.94013}
\transl
\jour Problems Inform. Transmission
\yr 1985
\vol 21
\issue 1
\pages 1--12


Linking options:
  • http://mi.mathnet.ru/eng/ppi967
  • http://mi.mathnet.ru/eng/ppi/v21/i1/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. V. Urivskii, T. Johansson, “New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications”, Problems Inform. Transmission, 38:3 (2002), 237–246  mathnet  crossref  mathscinet  zmath
    2. Manoj K.N., Rajan B.S., “Full rank distance codes and optimal STBC for BPSK modulation”, ISIT: 2002 IEEE International Symposium on Information Theory, Proceedings, 2002, 276–276  crossref  isi
    3. Gabidulin, EM, “Reducible rank codes and their applications to cryptography”, IEEE Transactions on Information Theory, 49:12 (2003), 3289  crossref  mathscinet  isi
    4. È. M. Gabidulin, V. A. Obernikhin, “Codes in the Vandermonde $\mathcal F$-Metric and Their Applications”, Problems Inform. Transmission, 39:2 (2003), 159–169  mathnet  crossref  mathscinet  zmath
    5. 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  crossref  mathscinet  zmath  isi
    6. È. M. Gabidulin, N. I. Pilipchuk, “Symmetric Rank Codes”, Problems Inform. Transmission, 40:2 (2004), 103–117  mathnet  crossref  mathscinet  zmath
    7. Pilipchuk, NI, “On codes correcting symmetric rank errors”, Coding and Cryptography, 3969 (2006), 14  crossref  mathscinet  zmath  isi
    8. Loidreau, P, “A Welch-Berlekamp like algorithm for decoding Gabidulin codes”, Coding and Cryptography, 3969 (2006), 36  crossref  mathscinet  zmath  isi
    9. Overbeck, R, “Extending Gibson's attacks on the GPT cryptosystem”, Coding and Cryptography, 3969 (2006), 178  crossref  mathscinet  zmath  isi
    10. Faure, C, “A new public-key cryptosystem based on the problem of reconstructing p-polynomials”, Coding and Cryptography, 3969 (2006), 304  crossref  mathscinet  zmath  isi
    11. Gabidulin, EM, “Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound”, Discrete Applied Mathematics, 154:2 (2006), 305  crossref  mathscinet  zmath  isi  elib
    12. Gadouleau M., Yan Zh., “Decoder error probability of MRD codes”, Proceedings of 2006 IEEE Information Theory Workshop, 2006, 264–268  crossref  isi
    13. Gadouleau M., Yan Zh., “Security of the GPT-type cryptosystems”, 2006 IEEE International Symposium on Information Theory, 2006, 724–728  crossref  isi
    14. Gabidulin, EM, “Error and erasure correcting algorithms for rank codes”, Designs Codes and Cryptography, 49:1–3 (2008), 105  crossref  mathscinet  isi
    15. Gabidulin, EM, “Properties of subspace subcodes of Gabidulin codes”, Advances in Mathematics of Communications, 2:2 (2008), 147  crossref  mathscinet  zmath  isi
    16. Gabidulin E.M., Rashwan H., Honary B., “On improving security of GPT cryptosystems”, 2009 IEEE International Symposium on Information Theory, 2009, 1110–1114  crossref  isi
    17. Bossert M., Gabidulin E.M., “One family of Algebraic Codes for Network Coding”, 2009 IEEE International Symposium on Information Theory, 2009, 2863–2866  crossref  isi
    18. E. M. Gabidulin, N. I. Pilipchuk, M. Bossert, “Decoding of random network codes”, Problems Inform. Transmission, 46:4 (2010), 300–320  mathnet  crossref  mathscinet  isi
    19. 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  isi
    20. Loidreau P., “Designing a Rank Metric Based McEliece Cryptosystem”, Post-Quantum Cryptography, Proceedings, Lecture Notes in Computer Science, 6061, 2010, 142–152  crossref  isi
    21. A. Wachter, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “On (partial) unit memory codes based on Gabidulin codes”, Problems Inform. Transmission, 47:2 (2011), 117–129  mathnet  crossref  mathscinet  isi
    22. B. A. Pogorelov, M. A. Pudovkina, “Naturalnye metriki i ikh svoistva. Ch. 1. Podmetriki i nadmetriki”, Matem. vopr. kriptogr., 2:4 (2011), 49–74  mathnet  crossref
    23. Sidorenko V., Richter G., Bossert M., “Linearized Shift-Register Synthesis”, IEEE Trans Inform Theory, 57:9 (2011), 6025–6032  crossref  isi  elib
    24. Rashwan H., Gabidulin E.M., Honary B., “Security of the GPT cryptosystem and its applications to cryptography”, Security and Communication Networks, 4:8 (2011), 937–946  crossref  isi
    25. Etzion T., “Sequence Folding, Lattice Tiling, and Multidimensional Coding”, IEEE Trans Inform Theory, 57:7 (2011), 4383–4400  crossref  isi  elib
    26. 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  crossref  isi
    27. Yang Sh., Honold T., “Good Random Matrices Over Finite Fields”, Adv. Math. Commun., 6:2 (2012), 203–227  crossref  isi  elib
    28. Tan V.Y.F., Balzano L., Draper S.C., “Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations”, IEEE Trans. Inf. Theory, 58:4 (2012), 2018–2039  crossref  isi  elib
    29. E. M. Gabidulin, N. I. Pilipchuk, “Rank subcodes in multicomponent network coding”, Problems Inform. Transmission, 49:1 (2013), 40–53  mathnet  crossref  isi
    30. E. M. Gabidulin, N. I. Pilipchuk, B. Honary, H. Rashwan, “Information security in a random network coding network”, Problems Inform. Transmission, 49:2 (2013), 179–191  mathnet  crossref  isi
    31. Gaborit Ph., Ruatta O., Schrek J., Zemor G., “Ranksign: An Efficient Signature Algorithm Based on the Rank Metric”, Post-Quantum Cryptography, Pqcrypto 2014, Lecture Notes in Computer Science, 8772, ed. Mosca M., Springer-Verlag Berlin, 2014, 88–107  crossref  isi
    32. Gaborit Ph., Ruatta O., Schrek J., Zemor G., “New Results For Rank-Based Cryptography”, Progress in Cryptology - Africacrypt 2014, Lecture Notes in Computer Science, 8469, eds. Pointcheval D., Vergnaud D., Springer-Verlag Berlin, 2014, 1–12  crossref  isi
    33. O. V. Trushina, E. M. Gabidulin, “A new method for ensuring anonymity and security in network coding”, Problems Inform. Transmission, 51:1 (2015), 75–81  mathnet  crossref  isi  elib
    34. E. M. Gabidulin, N. I. Pilipchuk, “Multicomponent codes with maximum code distance”, Problems Inform. Transmission, 52:3 (2016), 276–283  mathnet  crossref  isi  elib
    35. Pilipchuk N.I., “Cardinality of Subspace Multicomponent Codes”, 2017 Fourth International Conference on Engineering and Telecommunication (En&T), ed. Pavlyukova E. Uzhinskaya L. Suroegina Z., IEEE, 2017, 11–14  crossref  isi
    36. Puchinger S., Nielsen Johan Rosenkilde Ne, Li W., Sidorenko V., “Row Reduction Applied to Decoding of Rank-Metric and Subspace Codes”, Designs Codes Cryptogr., 82:1-2, SI (2017), 389–409  crossref  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:6857
    Full text:2427
    First page:14

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019