Nina I. Pilipchuk

According to our database, Nina I. Pilipchuk authored at least 9 papers between 2004 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance.

Ernst M. Gabidulin, Nina I. Pilipchuk, O. V. Trushina

Probl. Inf. Transm., 2021

2016

Multicomponent codes with maximum code distance.

Ernst M. Gabidulin, Nina I. Pilipchuk

Probl. Inf. Transm., 2016

2013

Information security in a random network coding network.

Ernst M. Gabidulin, Nina I. Pilipchuk, Bahram Honary, Haitham Rashwan

Probl. Inf. Transm., 2013

Rank subcodes in multicomponent network coding.

Ernst M. Gabidulin, Nina I. Pilipchuk

Probl. Inf. Transm., 2013

2010

Decoding of random network codes.

Ernst M. Gabidulin, Nina I. Pilipchuk, Martin Bossert

Probl. Inf. Transm., 2010

2008

Error and erasure correcting algorithms for rank codes.

Ernst M. Gabidulin, Nina I. Pilipchuk

Des. Codes Cryptogr., 2008

2006

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

Ernst M. Gabidulin, Nina I. Pilipchuk

Discret. Appl. Math., 2006

2005

On Codes Correcting Symmetric Rank Errors.

Nina I. Pilipchuk, Ernst M. Gabidulin

Proceedings of the Coding and Cryptography, International Workshop, 2005

2004

Symmetric Rank Codes.

Ernst M. Gabidulin, Nina I. Pilipchuk

Probl. Inf. Transm., 2004