The Case for Structured Random Codes in Network Capacity Theorems

Bobak Nazer, Michael Gastpar

Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for prov…