Rotational coding achieves multicast capacity of deterministic wireless networks

In this paper we study the maximum throughput of network coding schemes for a single multicast session in wireless networks. We adapt ¿deterministic channel model¿ proposed in for modeling wireless interference. We introduce a novel rotational coding scheme that can achieve the well-known minimum cutset bound. This coding scheme has lower encoding complexity in comparison with the existing random linear coding schemes which makes it a good candidate for practical systems. Moreover, we present a fundamental result on the rate of information that can be sent through any cutset. This can be used as criteria for analyzing the maximum throughput of linear network codes.