Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CORR
2008
Springer

favoriteEmaildiscussreport

104views Education» more CORR 2008»

The Case for Structured Random Codes in Network Capacity Theorems

13 years 4 months ago

The Case for Structured Random Codes in Network Capacity Theorems

Download www.eecs.berkeley.edu

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

Bobak Nazer, Michael Gastpar

Real-time Traffic

Capacity Achievability Proofs | CORR 2008 | Education | Random Coding Arguments | Structured |

claim paper

Related Content

» On the capacity of wireless networks The relay case

» On the Capacity of NonCoherent Network Coding

» Concatenated codes can achieve listdecoding capacity

» A coding theorem for distributed computation

» Approximately achieving Gaussian relay network capacity with lattice codes

» A MaxFlowMinCut Algorithm for a Class of Wireless Networks

» On the Capacity of Wireless Multicast Networks

» On the scaling laws of dense wireless sensor networks

» Distributed Source Coding using Abelian Group Codes

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Bobak Nazer, Michael Gastpar

Comments (0)