Multicomponent Subspace Codes in Network Coding

Abstract

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 for different parameters is calculated. The efficiency as a ratio cardinality to the upper bound is estimated. It is shown that MZP additional components can increase cardinality up to 30 percents. The iterative decoding algorithm is presented. At the first stage of decoding it is necessary to obtain a MZP component and then, at the next stage to apply the decoding algorithm of Silva-Koetter-Kschischang (SKK) codes.