Low-Complexity Near-Optimal Codes for Gaussian Relay Networks

Details Low-Complexity Near-Optimal Codes for Gaussian Relay Networks Low-Complexity Near-Optimal Codes for Gaussian Relay Networks

2011-02-25

arxiv.org/abs/1102.5138v1

Computer Science

Information Theory

Scientific paper

We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However, our proposed codes are also computationally tractable. Our main technique is to use the codes of Avestimehr \emph{et al.} as inner codes in a concatenated coding scheme.

Affiliated with

Also associated with

No associations

Rating

Low-Complexity Near-Optimal Codes for Gaussian Relay Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Low-Complexity Near-Optimal Codes for Gaussian Relay Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-Complexity Near-Optimal Codes for Gaussian Relay Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709171