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 proving some network capacity theorems: structured coding arguments, such as random linear or lattice codes, attain higher rates. Historically, structured codes have been studied as a stepping stone to practical constructions. However, K

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Bobak Nazer, Michael Gastpar
• Keywords: Capacity Achievability Proofs, CORR 2008, Education, Random Coding Arguments, Structured