2000 character limit reached
Toward Fast Reliable Communication at Rates Near Capacity with Gaussian Noise
Published 19 Jun 2010 in cs.IT, cs.LG, math.IT, math.ST, and stat.TH | (1006.3870v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.