Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Ernst M. Gabidulin"'
Publikováno v:
Problems of Information Transmission. 57:241-247
We study subspace codes with nonmaximum code distance. As opposed to spreads, i.e., codes with the maximum subspace distance, we refer to them as nonspreads here. We consider families of nonspreads based on using the Silva–Kotter–Kschischang (SKK
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b059b013b6e1e1801aadafd73da9a6ec
https://doi.org/10.1134/s0032946021030030
https://doi.org/10.1134/s0032946021030030
Autor:
Ernst M. Gabidulin, Oksana Trushina
Publikováno v:
Electronic Notes in Discrete Mathematics. 57:199-204
This paper considers a problem of anonymous transmission against eavesdropping and jamming in coherent network coding. We propose an information-theoretical message unlinkability scheme based on coset coding. We show that if an incoming message is tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::520fbe7f524b476fcf8e412ed9759a25
https://doi.org/10.1016/j.endm.2017.02.033
https://doi.org/10.1016/j.endm.2017.02.033
Autor:
Nina I. Pilipchuk, Ernst M. Gabidulin
Publikováno v:
Problems of Information Transmission. 52:276-283
We consider subspace codes, called multicomponent codes with zero prefix (MZP codes), whose subspace code distance is twice their dimension. We find values of parameters for which the codes are of the maximum cardinality. We construct combined codes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e8cc9ce230480d2de227f76e1f11822
https://doi.org/10.1134/s0032946016030054
https://doi.org/10.1134/s0032946016030054
Autor:
Ernst M. Gabidulin, N.I. Pilipchuk
Publikováno v:
2018 Engineering and Telecommunication (EnT-MIPT).
This paper is devoted to multicomponent subspace codes with zero prefix (MZP) and their role in network coding. In fact, it is a collection of our results about multicomponent codes for last years. The MZP construction is described. The cardinality f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfcfbfa54e381ffdb21770e6574d4bf7
https://doi.org/10.1109/ent-mipt.2018.00016
https://doi.org/10.1109/ent-mipt.2018.00016
Autor:
Ernst M. Gabidulin, O. V. Trushina
Publikováno v:
Problems of Information Transmission. 51:75-81
We propose a method for providing anonymity and security of data transmission in networks with network coding with multiple sources and receivers. An external passive adversary is assumed to be present in the network. It is required to organize messa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff686bdb8f2cb935f7a75a2b417da21d
https://doi.org/10.1134/s0032946015010081
https://doi.org/10.1134/s0032946015010081
Autor:
Ernst M. Gabidulin, Nina I. Pilipchuk
Publikováno v:
International Journal for Information Security Research. 4:432-438
To provide information security in network we use the public key GPT (Gabidulin–Paramonov–Tretiyakov) cryptosystem based on rank codes. This cryptosystem was the subject of several attacks. Some of them were structural attacks, others were decodi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c30a33aa3b34aaca7f315884a27c44a1
https://doi.org/10.20533/ijisr.2042.4639.2014.0050
https://doi.org/10.20533/ijisr.2042.4639.2014.0050
Publikováno v:
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY. 11:2457-2475
The concept of Public key cryptosystems based on error correcting codes was invented by McEliece in 1978. In 1991 Gabidulin, Paramonov and Tretjakov proposed a new mversion of the McEliece cryptosystem (GPT) based on maximum rank distance codes inste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::901eeb9399afafbca066c8c26ab58fbb
https://doi.org/10.24297/ijct.v11i4.3130
https://doi.org/10.24297/ijct.v11i4.3130
Publikováno v:
Problems of Information Transmission. 49:179-191
We consider a communication network with random network coding which can be attacked by adversaries of two types. One of them can wiretap original packets outgoing from source to destination. The other can insert its own packets into information flow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::710a4cde145cc7864fcf99fc1e63dc24
https://doi.org/10.1134/s0032946013020075
https://doi.org/10.1134/s0032946013020075
Autor:
Nina I. Pilipchuk, Ernst M. Gabidulin
Publikováno v:
Problems of Information Transmission. 49:40-53
A new class of subcodes in rank metric is proposed; based on it, multicomponent network codes are constructed. Basic properties of subspace subcodes are considered for the family of rank codes with maximum rank distance (MRD codes). It is shown that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7dd4fdbe425910e8efbe41f6338d76ab
https://doi.org/10.1134/s0032946013010043
https://doi.org/10.1134/s0032946013010043
Autor:
Ernst M. Gabidulin, N.I. Pilipchuk
Publikováno v:
2016 International Conference on Engineering and Telecommunication (EnT).
The problems of subspace coding of large cardinality are considered. The main most interesting results which were published to this time are presented. A few directions of the development of this scientific area are mentioned. One of the direction wa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2ac2ca313821a59b8cbaf7bfada6375
https://doi.org/10.1109/ent.2016.021
https://doi.org/10.1109/ent.2016.021