Ernst M. Gabidulin

According to our database1, Ernst M. Gabidulin authored at least 58 papers between 1991 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Anonymous Coherent Network Coding Against Eavesdropping and Jamming.
Electronic Notes in Discrete Mathematics, 2017

2016
Multicomponent codes with maximum code distance.
Probl. Inf. Transm., 2016

2015
A new method for ensuring anonymity and security in network coding.
Probl. Inf. Transm., 2015

2014
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes.
Des. Codes Cryptogr., 2014

2013
Information security in a random network coding network.
Probl. Inf. Transm., 2013

Rank subcodes in multicomponent network coding.
Probl. Inf. Transm., 2013

2012
Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks.
IET Wireless Sensor Systems, 2012

2011
Schemes Based on Rank Codes.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Rank Codes.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Security of the GPT cryptosystem and its applications to cryptography.
Security and Communication Networks, 2011

Maximum Rank Distance Codes for Space Time Block Coding: A Comparative Study.
Proceedings of the 5th International Conference on Next Generation Mobile Applications, 2011

2010
Decoding of random network codes.
Probl. Inf. Transm., 2010

Quotients of Gaussian graphs and their application to perfect codes.
J. Symb. Comput., 2010

On improving security of GPT cryptosystems
CoRR, 2010

A Smart Approach for GPT Cryptosystem Based on Rank Codes
CoRR, 2010

A Smart approach for GPT cryptosystem based on rank codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Perfect codes from Cayley graphs over Lipschitz integers.
IEEE Trans. Information Theory, 2009

Algebraic codes for network coding.
Probl. Inf. Transm., 2009

On improving security of GPT cryptosystems.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Rank q-cyclic and pseudo-q-cyclic codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

One family of algebraic codes for network coding.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Modeling Toroidal Networks with the Gaussian Integers.
IEEE Trans. Computers, 2008

Modeling hexagonal constellations with Eisenstein-Jacobi graphs.
Probl. Inf. Transm., 2008

Error and erasure correcting algorithms for rank codes.
Des. Codes Cryptogr., 2008

Attacks and counter-attacks on the GPT public key cryptosystem.
Des. Codes Cryptogr., 2008

Properties of subspace subcodes of Gabidulin codes.
Adv. in Math. of Comm., 2008

Graph-based metrics over QAM constellations.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Codes for network coding.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Perfect Codes for Metrics Induced by Circulant Graphs.
IEEE Trans. Information Theory, 2007

Perfect Codes over Lipschitz Integers.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound.
Discrete Applied Mathematics, 2006

Properties of subspace subcodes of optimum codes in rank metric
CoRR, 2006

A Generalization of Perfect Lee Codes over Gaussian Integers.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the rank of LDPC matrices constructed by Vandermonde matrices and RS codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Public Key Cryptosystem based metrics associated with GRS Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Unimodular perfect sequences of length p/sup s/.
IEEE Trans. Information Theory, 2005

On Codes Correcting Symmetric Rank Errors.
Proceedings of the Coding and Cryptography, International Workshop, 2005

On polyalphabetic block codes.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

On the perfect t-dominating set problem in circulant graphs and codes over gaussian integers.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The new construction of rank codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On subcodes of codes in rank metric.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Symmetric Rank Codes.
Probl. Inf. Transm., 2004

2003
Maximum rank distance codes as space-time codes.
IEEE Trans. Information Theory, 2003

Reducible rank codes and their applications to cryptography.
IEEE Trans. Information Theory, 2003

Codes in the Vandermonde F-Metric and Their Application.
Probl. Inf. Transm., 2003

Column Scrambler for the GPT Cryptosystem.
Discrete Applied Mathematics, 2003

2002
New Sequences with Zero Autocorrelation.
Probl. Inf. Transm., 2002

2001
Linear and Differential Cryptanalysis of Russian GOST.
Electronic Notes in Discrete Mathematics, 2001

Modified GPT PKC with Right Scrambler.
Electronic Notes in Discrete Mathematics, 2001

1999
On the Newton and covering radii of linear codes.
IEEE Trans. Information Theory, 1999

1998
Metrics Generated by Families of Subspaces.
IEEE Trans. Information Theory, 1998

1993
Codes that Correct Two-Dimensional Burst Errors.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

How to Avoid the Sidel'nikov-Shestakov Attack.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1992
Comments on 'Maximum-rank array codes and their application to crisscross error correction'.
IEEE Trans. Information Theory, 1992

1991
Linear codes with covering radius 2 and other new covering codes.
IEEE Trans. Information Theory, 1991

A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes.
Proceedings of the Algebraic Coding, 1991

Ideals over a Non-Commutative Ring and thier Applications in Cryptology.
Proceedings of the Advances in Cryptology, 1991


  Loading...