dblp.uni-trier.dewww.uni-trier.de

Ernst M. Gabidulin

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
21EEErnst M. Gabidulin: Attacks and counter-attacks on the GPT public key cryptosystem. Des. Codes Cryptography 48(2): 171-177 (2008)
20EEErnst M. Gabidulin, Nina I. Pilipchuk: Error and erasure correcting algorithms for rank codes. Des. Codes Cryptography 49(1-3): 105-122 (2008)
19EECarmen Martínez, Ramón Beivide, E. Stafford, Miquel Moretó, Ernst M. Gabidulin: Modeling Toroidal Networks with the Gaussian Integers. IEEE Trans. Computers 57(8): 1046-1056 (2008)
2007
18EECarmen Martínez, Ramón Beivide, Ernst M. Gabidulin: Perfect Codes for Metrics Induced by Circulant Graphs. IEEE Transactions on Information Theory 53(9): 3042-3052 (2007)
2006
17EEErnst M. Gabidulin, Pierre Loidreau: Properties of subspace subcodes of optimum codes in rank metric CoRR abs/cs/0607108: (2006)
16EEErnst M. Gabidulin, Nina I. Pilipchuk: Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound. Discrete Applied Mathematics 154(2): 305-312 (2006)
2005
15EENina I. Pilipchuk, Ernst M. Gabidulin: On Codes Correcting Symmetric Rank Errors. WCC 2005: 14-21
14EEErnst M. Gabidulin, Vitaly V. Shorin: Unimodular perfect sequences of length p/sup s/. IEEE Transactions on Information Theory 51(3): 1163-1166 (2005)
2003
13EEAlexei V. Ourivski, Ernst M. Gabidulin: Column Scrambler for the GPT Cryptosystem. Discrete Applied Mathematics 128(1): 207-221 (2003)
12 P. Lusina, Ernst M. Gabidulin, Martin Bossert: Maximum rank distance codes as space-time codes. IEEE Transactions on Information Theory 49(10): 2757-2760 (2003)
11 Ernst M. Gabidulin, Alexei V. Ourivski, Bahram Honary, Bassem Ammar: Reducible rank codes and their applications to cryptography. IEEE Transactions on Information Theory 49(12): 3289-3293 (2003)
2001
10EEErnst M. Gabidulin, Alexei V. Ourivski: Modified GPT PKC with Right Scrambler. Electronic Notes in Discrete Mathematics 6: 168-177 (2001)
9EEVitaly V. Shorin, Vadim V. Jelezniakov, Ernst M. Gabidulin: Linear and Differential Cryptanalysis of Russian GOST. Electronic Notes in Discrete Mathematics 6: 538-547 (2001)
1999
8 Ernst M. Gabidulin, Torleiv Kløve: On the Newton and covering radii of linear codes. IEEE Transactions on Information Theory 45(7): 2534-2536 (1999)
1998
7 Ernst M. Gabidulin, Juriaan Simonis: Metrics Generated by Families of Subspaces. IEEE Transactions on Information Theory 44(3): 1336-1341 (1998)
1993
6 Ernst M. Gabidulin, Olaf Kjelsen: How to Avoid the Sidel'nikov-Shestakov Attack. Error Control, Cryptology, and Speech Compression 1993: 25-32
5 Ernst M. Gabidulin, Vitaly V. Zanin: Codes that Correct Two-Dimensional Burst Errors. Error Control, Cryptology, and Speech Compression 1993: 53-62
1992
4 Ernst M. Gabidulin: Comments on 'Maximum-rank array codes and their application to crisscross error correction'. IEEE Transactions on Information Theory 38(3): 1183- (1992)
1991
3 Ernst M. Gabidulin: A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes. Algebraic Coding 1991: 126-133
2EEErnst M. Gabidulin, A. V. Paramonov, O. V. Tretjakov: Ideals over a Non-Commutative Ring and thier Applications in Cryptology. EUROCRYPT 1991: 482-489
1 Ernst M. Gabidulin, Alexander A. Davydov, Leonid M. Tombak: Linear codes with covering radius 2 and other new covering codes. IEEE Transactions on Information Theory 37(1): 219- (1991)

Coauthor Index

1Bassem Ammar [11]
2Ramón Beivide [18] [19]
3Martin Bossert [12]
4Alexander A. Davydov [1]
5Bahram Honary [11]
6Vadim V. Jelezniakov [9]
7Olaf Kjelsen [6]
8Torleiv Kløve [8]
9Pierre Loidreau [17]
10P. Lusina [12]
11Carmen Martínez [18] [19]
12Miquel Moretó [19]
13Alexei V. Ourivski [10] [11] [13]
14A. V. Paramonov [2]
15Nina I. Pilipchuk [15] [16] [20]
16Vitaly V. Shorin [9] [14]
17Juriaan Simonis [7]
18E. Stafford [19]
19Leonid M. Tombak [1]
20O. V. Tretjakov [2]
21Vitaly V. Zanin [5]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)