Least squares superposition codes of moderate dictionary size, reliable at rates up to capacity
Least squares superposition codes of moderate dictionary size, reliable at rates up to capacity
复制标题
字典大小适中的最小二乘叠加码，在速率达到容量的情况下可靠
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Antony Joseph
中科院分区：
文献类型：
--
作者：
A. Barron;Antony Joseph
针对加性白色高斯噪声信道，提出了一种码字平均功率受限的稀疏叠加码。码字是向量子集的线性组合，可能的消息由子集的选择索引。解码是通过最小二乘法，适合于线性组合的假设形式。通信被证明是可靠的错误概率指数小的所有速率的香农容量。
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vectors, with the possible messages indexed by the choice of subset. Decoding is by least squares, tailored to the assumed form of linear combination. Communication is shown to be reliable with error probability exponentially small for all rates up to the Shannon capacity.
影响因子：
1.2
作者：
Blumensath, Thomas;Davies, Mike E.
通讯作者：
Davies, Mike E.