The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ernst M. Gabidulin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ernst M. Gabidulin, Olaf Kjelsen
    How to Avoid the Sidel'nikov-Shestakov Attack. [Citation Graph (0, 0)][DBLP]
    Error Control, Cryptology, and Speech Compression, 1993, pp:25-32 [Conf]
  2. Ernst M. Gabidulin, Vitaly V. Zanin
    Codes that Correct Two-Dimensional Burst Errors. [Citation Graph (0, 0)][DBLP]
    Error Control, Cryptology, and Speech Compression, 1993, pp:53-62 [Conf]
  3. Ernst M. Gabidulin, A. V. Paramonov, O. V. Tretjakov
    Ideals over a Non-Commutative Ring and thier Applications in Cryptology. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:482-489 [Conf]
  4. Ernst M. Gabidulin
    A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:126-133 [Conf]
  5. Nina I. Pilipchuk, Ernst M. Gabidulin
    On Codes Correcting Symmetric Rank Errors. [Citation Graph (0, 0)][DBLP]
    WCC, 2005, pp:14-21 [Conf]
  6. Ernst M. Gabidulin, Nina I. Pilipchuk
    Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:2, pp:305-312 [Journal]
  7. Alexei V. Ourivski, Ernst M. Gabidulin
    Column Scrambler for the GPT Cryptosystem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:207-221 [Journal]
  8. Ernst M. Gabidulin
    Comments on 'Maximum-rank array codes and their application to crisscross error correction'. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1183-0 [Journal]
  9. Ernst M. Gabidulin, Alexander A. Davydov, Leonid M. Tombak
    Linear codes with covering radius 2 and other new covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:1, pp:219-0 [Journal]
  10. Ernst M. Gabidulin, Torleiv Kløve
    On the Newton and covering radii of linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2534-2536 [Journal]
  11. Ernst M. Gabidulin, Alexei V. Ourivski, Bahram Honary, Bassem Ammar
    Reducible rank codes and their applications to cryptography. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3289-3293 [Journal]
  12. Ernst M. Gabidulin, Vitaly V. Shorin
    Unimodular perfect sequences of length p/sup s/. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1163-1166 [Journal]
  13. Ernst M. Gabidulin, Juriaan Simonis
    Metrics Generated by Families of Subspaces. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1336-1341 [Journal]
  14. P. Lusina, Ernst M. Gabidulin, Martin Bossert
    Maximum rank distance codes as space-time codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:10, pp:2757-2760 [Journal]
  15. Ernst M. Gabidulin, Pierre Loidreau
    Properties of subspace subcodes of optimum codes in rank metric [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  16. A Smart Approach for GPT Cryptosystem Based on Rank Codes [Citation Graph (, )][DBLP]


  17. On improving security of GPT cryptosystems [Citation Graph (, )][DBLP]


  18. Attacks and counter-attacks on the GPT public key cryptosystem. [Citation Graph (, )][DBLP]


  19. Error and erasure correcting algorithms for rank codes. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002