default search action
Ernst M. Gabidulin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j33]Ernst M. Gabidulin, Nina I. Pilipchuk, O. V. Trushina:
Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance. Probl. Inf. Transm. 57(3): 241-247 (2021)
2010 – 2019
- 2017
- [j32]O. V. Trushina, Ernst M. Gabidulin:
Anonymous Coherent Network Coding Against Eavesdropping and Jamming. Electron. Notes Discret. Math. 57: 199-204 (2017) - 2016
- [j31]Ernst M. Gabidulin, Nina I. Pilipchuk:
Multicomponent codes with maximum code distance. Probl. Inf. Transm. 52(3): 276-283 (2016) - 2015
- [j30]O. V. Trushina, Ernst M. Gabidulin:
A new method for ensuring anonymity and security in network coding. Probl. Inf. Transm. 51(1): 75-81 (2015) - 2014
- [j29]Eraj Khan, Ernst M. Gabidulin, Bahram Honary, Hassan Ahmed:
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes. Des. Codes Cryptogr. 70(1-2): 231-239 (2014) - 2013
- [j28]Ernst M. Gabidulin, Nina I. Pilipchuk:
Rank subcodes in multicomponent network coding. Probl. Inf. Transm. 49(1): 40-53 (2013) - [j27]Ernst M. Gabidulin, Nina I. Pilipchuk, Bahram Honary, Haitham Rashwan:
Information security in a random network coding network. Probl. Inf. Transm. 49(2): 179-191 (2013) - 2012
- [j26]Eraj Khan, Ernst M. Gabidulin, Bahram Honary, Hassan Ahmed:
Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks. IET Wirel. Sens. Syst. 2(2): 108-114 (2012) - 2011
- [j25]Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary:
Security of the GPT cryptosystem and its applications to cryptography. Secur. Commun. Networks 4(8): 937-946 (2011) - [c21]Hafiz M. Asif
, Ernst M. Gabidulin, Bahram Honary:
Maximum Rank Distance Codes for Space Time Block Coding: A Comparative Study. NGMAST 2011: 206-211 - [r2]Ernst M. Gabidulin:
Rank Codes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1028-1031 - [r1]Ernst M. Gabidulin:
Schemes Based on Rank Codes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1079-1082 - 2010
- [j24]Carmen Martínez
Quotients of Gaussian graphs and their application to perfect codes. J. Symb. Comput. 45(7): 813-824 (2010) - [j23]Ernst M. Gabidulin, Nina I. Pilipchuk, Martin Bossert:
Decoding of random network codes. Probl. Inf. Transm. 46(4): 300-320 (2010) - [c20]Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary:
A Smart approach for GPT cryptosystem based on rank codes. ISIT 2010: 2463-2467 - [i3]Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary:
A Smart Approach for GPT Cryptosystem Based on Rank Codes. CoRR abs/1006.0386 (2010) - [i2]Ernst M. Gabidulin, Haitham Rashwan, Bahram Honary:
On improving security of GPT cryptosystems. CoRR abs/1006.1057 (2010)
2000 – 2009
- 2009
- [j22]Ernst M. Gabidulin, Martin Bossert:
Algebraic codes for network coding. Probl. Inf. Transm. 45(4): 343-356 (2009) - [j21]Carmen Martínez
Perfect codes from Cayley graphs over Lipschitz integers. IEEE Trans. Inf. Theory 55(8): 3552-3562 (2009) - [c19]Haitham Rashwan, Bahram Honary, Ernst M. Gabidulin:
On improving security of GPT cryptosystems. ISIT 2009: 1110-1114 - [c18]Ernst M. Gabidulin:
Rank q-cyclic and pseudo-q-cyclic codes. ISIT 2009: 2799-2802 - [c17]Martin Bossert, Ernst M. Gabidulin:
One family of algebraic codes for network coding. ISIT 2009: 2863-2866 - 2008
- [j20]Ernst M. Gabidulin, Pierre Loidreau:
Properties of subspace subcodes of Gabidulin codes. Adv. Math. Commun. 2(2): 147-157 (2008) - [j19]Ernst M. Gabidulin:
Attacks and counter-attacks on the GPT public key cryptosystem. Des. Codes Cryptogr. 48(2): 171-177 (2008) - [j18]Ernst M. Gabidulin, Nina I. Pilipchuk:
Error and erasure correcting algorithms for rank codes. Des. Codes Cryptogr. 49(1-3): 105-122 (2008) - [j17]Carmen Martínez
Modeling hexagonal constellations with Eisenstein-Jacobi graphs. Probl. Inf. Transm. 44(1): 1-11 (2008) - [j16]Carmen Martínez
Modeling Toroidal Networks with the Gaussian Integers. IEEE Trans. Computers 57(8): 1046-1056 (2008) - [c16]Ernst M. Gabidulin, Martin Bossert:
Codes for network coding. ISIT 2008: 867-870 - [c15]Carmen Martínez
Graph-based metrics over QAM constellations. ISIT 2008: 2494-2498 - 2007
- [j15]Carmen Martínez
Perfect Codes for Metrics Induced by Circulant Graphs. IEEE Trans. Inf. Theory 53(9): 3042-3052 (2007) - [c14]Carmen Martínez
Perfect Codes over Lipschitz Integers. ISIT 2007: 1366-1370 - 2006
- [j14]Ernst M. Gabidulin, Nina I. Pilipchuk:
Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound. Discret. Appl. Math. 154(2): 305-312 (2006) - [c13]Ernst M. Gabidulin, Abdi Moinian, Bahram Honary:
Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices. ISIT 2006: 679-683 - [c12]N. Catterall, Ernst M. Gabidulin, Bahram Honary, Vitaly A. Obernikhin:
Public Key Cryptosystem based metrics associated with GRS Codes. ISIT 2006: 729-733 - [c11]Ernst M. Gabidulin, Martin Bossert:
On the rank of LDPC matrices constructed by Vandermonde matrices and RS codes. ISIT 2006: 861-865 - [c10]Carmen Martínez
A Generalization of Perfect Lee Codes over Gaussian Integers. ISIT 2006: 1070-1074 - [i1]Ernst M. Gabidulin, Pierre Loidreau:
Properties of subspace subcodes of optimum codes in rank metric. CoRR abs/cs/0607108 (2006) - 2005
- [j13]Ernst M. Gabidulin, Vitaly V. Shorin:
Unimodular perfect sequences of length ps. IEEE Trans. Inf. Theory 51(3): 1163-1166 (2005) - [c9]Ernst M. Gabidulin, Pierre Loidreau:
On subcodes of codes in rank metric. ISIT 2005: 121-123 - [c8]Carmen Martínez
On the perfect t-dominating set problem in circulant graphs and codes over gaussian integers. ISIT 2005: 254-258 - [c7]Alexander Kshevetskiy, Ernst M. Gabidulin:
The new construction of rank codes. ISIT 2005: 2105-2108 - [c6]Vladimir Sidorenko
On polyalphabetic block codes. ITW 2005: 207-210 - [c5]Nina I. Pilipchuk, Ernst M. Gabidulin:
On Codes Correcting Symmetric Rank Errors. WCC 2005: 14-21 - 2004
- [j12]Ernst M. Gabidulin, Nina I. Pilipchuk:
Symmetric Rank Codes. Probl. Inf. Transm. 40(2): 103-117 (2004) - 2003
- [j11]Alexei V. Ourivski, Ernst M. Gabidulin:
Column Scrambler for the GPT Cryptosystem. Discret. Appl. Math. 128(1): 207-221 (2003) - [j10]Ernst M. Gabidulin, Vitaly A. Obernikhin:
Codes in the Vandermonde F-Metric and Their Application. Probl. Inf. Transm. 39(2): 159-169 (2003) - [j9]Paul Lusina, Ernst M. Gabidulin, Martin Bossert:
Maximum rank distance codes as space-time codes. IEEE Trans. Inf. Theory 49(10): 2757-2760 (2003) - [j8]Ernst M. Gabidulin, Alexei V. Ourivski, Bahram Honary, Bassem Ammar:
Reducible rank codes and their applications to cryptography. IEEE Trans. Inf. Theory 49(12): 3289-3293 (2003) - 2002
- [j7]Ernst M. Gabidulin, Vitaly V. Shorin:
New Sequences with Zero Autocorrelation. Probl. Inf. Transm. 38(4): 255-267 (2002) - 2001
- [j6]Ernst M. Gabidulin, Alexei V. Ourivski:
Modified GPT PKC with Right Scrambler. Electron. Notes Discret. Math. 6: 168-177 (2001) - [j5]Vitaly V. Shorin, Vadim V. Jelezniakov, Ernst M. Gabidulin:
Linear and Differential Cryptanalysis of Russian GOST. Electron. Notes Discret. Math. 6: 538-547 (2001)
1990 – 1999
- 1999
- [j4]Ernst M. Gabidulin, Torleiv Kløve:
On the Newton and covering radii of linear codes. IEEE Trans. Inf. Theory 45(7): 2534-2536 (1999) - 1998
- [j3]Ernst M. Gabidulin, Juriaan Simonis:
Metrics Generated by Families of Subspaces. IEEE Trans. Inf. Theory 44(3): 1336-1341 (1998) - 1993
- [c4]Ernst M. Gabidulin, Olaf Kjelsen:
How to Avoid the Sidel'nikov-Shestakov Attack. Error Control, Cryptology, and Speech Compression 1993: 25-32 - [c3]Ernst M. Gabidulin, Vitaly V. Zanin:
Codes that Correct Two-Dimensional Burst Errors. Error Control, Cryptology, and Speech Compression 1993: 53-62 - 1992
- [j2]Ernst M. Gabidulin:
Comments on 'Maximum-rank array codes and their application to crisscross error correction'. IEEE Trans. Inf. Theory 38(3): 1183- (1992) - 1991
- [j1]Ernst M. Gabidulin, Alexander A. Davydov
Linear codes with covering radius 2 and other new covering codes. IEEE Trans. Inf. Theory 37(1): 219-224 (1991) - [c2]Ernst M. Gabidulin, A. V. Paramonov, O. V. Tretjakov:
Ideals over a Non-Commutative Ring and thier Applications in Cryptology. EUROCRYPT 1991: 482-489 - [c1]Ernst M. Gabidulin:
A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes. Algebraic Coding 1991: 126-133
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: