New Multicomponent Network Subspace Codes: Construction and Decoding

Abstract

In this paper we consider multicomponent network codes for a channel with random linear transformations and packet errors. 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 greedy algorithm, when selecting the code components. It allows us to increase code cardinality compared with the previously known constructions. We present an efficient algorithm of decoding the new code for both erasures and packet errors. Finally, we give some examples of the code construction and decoding.