Apr 13, 2013 · A new class of subcodes in rank metric is proposed; based on it, multicomponent network codes are constructed. Basic properties of subspace ...
E. M. Gabidulin, N. I. Pilipchuk, “Rank subcodes in multicomponent ...
www.mathnet.ru › eng › ppi2101
Abstract: A new class of subcodes in rank metric is proposed; based on it, multicomponent network codes are constructed. Basic properties of subspace ...
Rank subcodes in multicomponent network coding E. M. Gabidulin, N. I. Pilipchuk This publication is cited in the following articles: Sergey Vladimirov, EAI ...
Aug 11, 2011 · Iterative decoding algorithm is proposed. A few examples are given. Keywords: Network coding, subspace distance, rank-metric codes, de- coding.
Jun 21, 2012 · We consider decoding algorithm of multicomponent codes based on subspace rank subcodes [1]. These codes are constructed by combinatorial incom-.
We present a new code construction, which is a generalization of MZP network codes, and similarly uses rank codes as subcodes. In the new construction we use a ...
We construct multicomponent code based on subspace rank sub- codes which is assigned to random network coding. This code is a union of codes. Minimal code ...
Current applications of rank-metric codes include network coding, code-based cryptography, criss-cross error correction in memory chips, distributed data ...
Oct 29, 2015 · In this paper, we propose so-called multicomponent codes with the prescribed subspace metric distance. This class is a generaliza-tion of ...
Rank metric codes such as Gabidulin codes are known to be able to protect packets in such a scenario. We call these codes one-shot codes, as they use the ( ...