Sciweavers

CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 11 months ago
The Case for Structured Random Codes in Network Capacity Theorems
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 pro...
Bobak Nazer, Michael Gastpar