On network coding capacity under on-off scheduling

We investigate the tradeoffs between rate (bits per channel use) and throughput (bits per time) in network coding over networks of independent noisy or noiseless channels under on-off scheduling. While some networks exhibit an inherent tradeoff between rate and throughput at finite blocklengths, our main result shows that rate and throughput can be simultaneously maximized in the limit of large blocklengths.