Ernst M. Gabidulin

O. V. Trushina

Probl. Inf. Transm., 2021

2017

Anonymous Coherent Network Coding Against Eavesdropping and Jamming.

[BibT_eX]

[DOI]

O. V. Trushina

Electron. Notes Discret. Math., 2017

2016

Multicomponent codes with maximum code distance.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2016

2015

A new method for ensuring anonymity and security in network coding.

[BibT_eX]

[DOI]

O. V. Trushina

Probl. Inf. Transm., 2015

2014

Modified Niederreiter type of GPT cryptosystem based on reducible rank codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

2013

Information security in a random network coding network.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

Rank subcodes in multicomponent network coding.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

2012

Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks.

[BibT_eX]

[DOI]

IET Wirel. Sens. Syst., 2012

2011

Schemes Based on Rank Codes.

[BibT_eX]

[DOI]

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

Rank Codes.

[BibT_eX]

[DOI]

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

Security of the GPT cryptosystem and its applications to cryptography.

[BibT_eX]

[DOI]

Haitham Rashwan

Secur. Commun. Networks, 2011

Maximum Rank Distance Codes for Space Time Block Coding: A Comparative Study.

[BibT_eX]

[DOI]

Hafiz M. Asif

Proceedings of the 5th International Conference on Next Generation Mobile Applications, 2011

2010

Decoding of random network codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2010

Quotients of Gaussian graphs and their application to perfect codes.

[BibT_eX]

[DOI]

J. Symb. Comput., 2010

A Smart approach for GPT cryptosystem based on rank codes.

[BibT_eX]

[DOI]

Haitham Rashwan

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Perfect codes from Cayley graphs over Lipschitz integers.

[BibT_eX]

[DOI]

Carmen Martínez

Ramón Beivide

IEEE Trans. Inf. Theory, 2009

Algebraic codes for network coding.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2009

On improving security of GPT cryptosystems.

[BibT_eX]

[DOI]

Haitham Rashwan

Proceedings of the IEEE International Symposium on Information Theory, 2009

Rank q-cyclic and pseudo-q-cyclic codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

One family of algebraic codes for network coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Modeling Toroidal Networks with the Gaussian Integers.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2008

Modeling hexagonal constellations with Eisenstein-Jacobi graphs.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2008

Error and erasure correcting algorithms for rank codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

Attacks and counter-attacks on the GPT public key cryptosystem.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

Properties of subspace subcodes of Gabidulin codes.

[BibT_eX]

[DOI]

Pierre Loidreau

Adv. Math. Commun., 2008

Graph-based metrics over QAM constellations.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Codes for network coding.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Perfect Codes for Metrics Induced by Circulant Graphs.

[BibT_eX]

[DOI]

Carmen Martínez

Ramón Beivide

IEEE Trans. Inf. Theory, 2007

Perfect Codes over Lipschitz Integers.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Properties of subspace subcodes of optimum codes in rank metric

[BibT_eX]

[DOI]

Pierre Loidreau

CoRR, 2006

A Generalization of Perfect Lee Codes over Gaussian Integers.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices.

[BibT_eX]

[DOI]

Abdi Moinian

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.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Public Key Cryptosystem based metrics associated with GRS Codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Unimodular perfect sequences of length ps.

[BibT_eX]

[DOI]

Vitaly V. Shorin

IEEE Trans. Inf. Theory, 2005

On Codes Correcting Symmetric Rank Errors.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptography, International Workshop, 2005

On polyalphabetic block codes.

[BibT_eX]

[DOI]

Valentin B. Afanassiev

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.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The new construction of rank codes.

[BibT_eX]

[DOI]

Alexander Kshevetskiy

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On subcodes of codes in rank metric.

[BibT_eX]

[DOI]

Pierre Loidreau

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Symmetric Rank Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2004

2003

Maximum rank distance codes as space-time codes.

[BibT_eX]

[DOI]

Paul Lusina

IEEE Trans. Inf. Theory, 2003

Reducible rank codes and their applications to cryptography.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Codes in the Vandermonde F-Metric and Their Application.

[BibT_eX]

[DOI]

Vitaly A. Obernikhin

Probl. Inf. Transm., 2003

Column Scrambler for the GPT Cryptosystem.

[BibT_eX]

[DOI]

Alexei V. Ourivski

Discret. Appl. Math., 2003

2002

New Sequences with Zero Autocorrelation.

[BibT_eX]

[DOI]

Vitaly V. Shorin

Probl. Inf. Transm., 2002

2001

Linear and Differential Cryptanalysis of Russian GOST.

[BibT_eX]

[DOI]

Vitaly V. Shorin

Vadim V. Jelezniakov

Electron. Notes Discret. Math., 2001

Modified GPT PKC with Right Scrambler.

[BibT_eX]

[DOI]

Alexei V. Ourivski

Electron. Notes Discret. Math., 2001

1999

On the Newton and covering radii of linear codes.

[BibT_eX]

[DOI]

Torleiv Kløve

IEEE Trans. Inf. Theory, 1999

1998

Metrics Generated by Families of Subspaces.

[BibT_eX]

[DOI]

Juriaan Simonis

IEEE Trans. Inf. Theory, 1998

1993

Codes that Correct Two-Dimensional Burst Errors.

[BibT_eX]

[DOI]

Vitaly V. Zanin

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

How to Avoid the Sidel'nikov-Shestakov Attack.

[BibT_eX]

[DOI]

Olaf Kjelsen

Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1992

Comments on 'Maximum-rank array codes and their application to crisscross error correction'.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

1991

Linear codes with covering radius 2 and other new covering codes.

[BibT_eX]

[DOI]

Alexander A. Davydov

Leonid M. Tombak

IEEE Trans. Inf. Theory, 1991

A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1991

Ideals over a Non-Commutative Ring and thier Applications in Cryptology.

[BibT_eX]

[DOI]