Computer Science – Information Theory
Scientific paper
2010-06-19
Computer Science
Information Theory
5 pages, 4 figures, conference submission
Scientific paper
For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by the choice of subset. A feasible decoding algorithm is presented. Communication is reliable with error probability exponentially small for all rates below the Shannon capacity.
Barron Andrew R.
Joseph Antony
No associations
LandOfFree
Toward Fast Reliable Communication at Rates Near Capacity with Gaussian Noise 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 Toward Fast Reliable Communication at Rates Near Capacity with Gaussian Noise, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Toward Fast Reliable Communication at Rates Near Capacity with Gaussian Noise will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-431605