Ernst M. Gabidulin

	2011
35		Hafiz M. Asif, Ernst M. Gabidulin, Bahram Honary: Maximum Rank Distance Codes for Space Time Block Coding: A Comparative Study. NGMAST 2011: 206-211
34		Ernst M. Gabidulin: Rank Codes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1028-1031
33		Ernst M. Gabidulin: Schemes Based on Rank Codes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1079-1082
32		Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary: Security of the GPT cryptosystem and its applications to cryptography. Security and Communication Networks 4(8): 937-946 (2011)
	2010
31		Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary: A Smart approach for GPT cryptosystem based on rank codes. ISIT 2010: 2463-2467
30		Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary: A Smart Approach for GPT Cryptosystem Based on Rank Codes CoRR abs/1006.0386: (2010)
29		Ernst M. Gabidulin, Haitham Rashwan, Bahram Honary: On improving security of GPT cryptosystems CoRR abs/1006.1057: (2010)
28		Carmen Martínez, Ramón Beivide, Cristobal Camarero, Esteban Stafford, Ernst M. Gabidulin: Quotients of Gaussian graphs and their application to perfect codes. J. Symb. Comput. 45(7): 813-824 (2010)
	2009
27		Haitham Rashwan, Bahram Honary, Ernst M. Gabidulin: On improving security of GPT cryptosystems. ISIT 2009: 1110-1114
26		Ernst M. Gabidulin: Rank q-cyclic and pseudo-q-cyclic codes. ISIT 2009: 2799-2802
25		Martin Bossert, Ernst M. Gabidulin: One family of algebraic codes for network coding. ISIT 2009: 2863-2866
24		Carmen Martínez, Ramón Beivide, Ernst M. Gabidulin: Perfect codes from Cayley graphs over Lipschitz integers. IEEE Transactions on Information Theory 55(8): 3552-3562 (2009)
	2008
23		Carmen Martínez, Esteban Stafford, Ramón Beivide, Cristobal Camarero, Fernando Vallejo, Ernst M. Gabidulin: Graph-based metrics over QAM constellations. ISIT 2008: 2494-2498
22		Ernst M. Gabidulin, Martin Bossert: Codes for network coding. ISIT 2008: 867-870
21		Ernst M. Gabidulin: Attacks and counter-attacks on the GPT public key cryptosystem. Des. Codes Cryptography 48(2): 171-177 (2008)
20		Ernst M. Gabidulin, Nina I. Pilipchuk: Error and erasure correcting algorithms for rank codes. Des. Codes Cryptography 49(1-3): 105-122 (2008)
19		Carmen Martínez, Ramón Beivide, Esteban Stafford, Miquel Moretó, Ernst M. Gabidulin: Modeling Toroidal Networks with the Gaussian Integers. IEEE Trans. Computers 57(8): 1046-1056 (2008)
	2007
18		Carmen 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
17		Ernst M. Gabidulin, Pierre Loidreau: Properties of subspace subcodes of optimum codes in rank metric CoRR abs/cs/0607108: (2006)
16		Ernst 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
15		Nina I. Pilipchuk, Ernst M. Gabidulin: On Codes Correcting Symmetric Rank Errors. WCC 2005: 14-21
14		Ernst M. Gabidulin, Vitaly V. Shorin: Unimodular perfect sequences of length p/sup s/. IEEE Transactions on Information Theory 51(3): 1163-1166 (2005)
	2003
13		Alexei 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
10		Ernst M. Gabidulin, Alexei V. Ourivski: Modified GPT PKC with Right Scrambler. Electronic Notes in Discrete Mathematics 6: 168-177 (2001)
9		Vitaly 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
2		Ernst 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-224 (1991)

Coauthor Index

1	Bassem Ammar	[11]
2	Hafiz M. Asif	[35]
3	Ramón Beivide	[18] [19] [23] [24] [28]
4	Martin Bossert	[12] [22] [25]
5	Cristobal Camarero	[23] [28]
6	Alexander A. Davydov	[1]
7	Bahram Honary	[11] [27] [29] [30] [31] [32] [35]
8	Vadim V. Jelezniakov	[9]
9	Olaf Kjelsen	[6]
10	Torleiv Kløve	[8]
11	Pierre Loidreau	[17]
12	P. Lusina	[12]
13	Carmen Martínez	[18] [19] [23] [24] [28]
14	Miquel Moretó	[19]
15	Alexei V. Ourivski	[10] [11] [13]
16	A. V. Paramonov	[2]
17	Nina I. Pilipchuk	[15] [16] [20]
18	Haitham Rashwan	[27] [29] [30] [31] [32]
19	Vitaly V. Shorin	[9] [14]
20	Juriaan Simonis	[7]
21	Esteban Stafford	[19] [23] [28]
22	Leonid M. Tombak	[1]
23	O. V. Tretjakov	[2]
24	Fernando Vallejo	[23]
25	Vitaly V. Zanin	[5]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page