Nonlinear Network Coding:A Case Study
Lingxiong Li, Kai Bo Fan, lt, strong gt, Dongyang lt Long · 2008
Abstract—In the area of network coding, linear code can achieve the maximum capacity of multicast networks by a large enough alphabet. And it is insufficient for non-multicast networks. Meanwhile nonlinear code is of interest for its possibility to achieve the network coding capacity by small alphabet, or its possibility to deal with other networks. In this paper, a novel polynomial code is proposed. We show that a kind of polynomial code can be induced from linear code, and it has the same coding ability with linear code. We also show the existence of another kind of polynomial code. 1 x