On the Capacity of Noncoherent Network Coding

• Published in: IEEE transactions on information theory 2011-02, Vol.57 (2), p.1046-1066
• Main Authors: Siavoshani, M J, Mohajer, S, Fragouli, C, Diggavi, S N
• Format: Article
• Language: English
• Subjects: Algorithms; Approximation methods; Channel capacity; Channel models; Channels; Coding; Encoding; Guidelines; Linear matrix inequalities; Mathematical analysis; Mathematical models; Multiple access; multisource multicast; Network coding; Networks; noncoherent communication; randomized network coding; Receivers; subspace coding; Subspaces; Vectors
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2010.2094813

We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoherent network coding introduced by Koetter and Kschischang in , that captures the essence of such a network operation, and calculate the capacity as a function of network parameters. We prove that use of subspace coding is optimal, and show that, in some cases, the capacity-achieving distribution uses subspaces of several dimensions, where the employed dimensions depend on the packet length. This model and the results also allow us to give guidelines on when subspace coding is beneficial for the proposed model and by how much, in comparison to a coding vector approach, from a capacity viewpoint. We extend our results to the case of multiple source multicast that creates a virtual multiple access channel.