Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Barron et al. (2010) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: