Fast Sparse Superposition Codes Have Near Exponential Error Probability for <formula formulatype="inline"><tex Notation="TeX">$R<{\cal C}$</tex></formula>

DOI10.1109/TIT.2013.2289865zbMath1364.94402MaRDI QIDQ5346103

Andrew R. Barron, Antony Joseph

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Source coding (94A29)

Related Items (5)

Sparse high-dimensional linear regression. Estimating squared error and a phase transition ⋮ Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ An improved analysis of least squares superposition codes with Bernoulli dictionary ⋮ The all-or-nothing phenomenon in sparse linear regression

This page was built for publication: Fast Sparse Superposition Codes Have Near Exponential Error Probability for <formula formulatype="inline"><tex Notation="TeX">$R&lt;{\cal C}$</tex></formula>