JOSEPH, A., & BARRON, A. R. (2014). Fast Sparse Superposition Codes Have Near Exponential Error Probability for R < C. IEEE transactions on information theory, 60(2), 919-942. https://doi.org/10.1109/TIT.2013.2289865
Chicago Style (17th ed.) CitationJOSEPH, Antony, and Andrew R. BARRON. "Fast Sparse Superposition Codes Have Near Exponential Error Probability for R < C." IEEE Transactions on Information Theory 60, no. 2 (2014): 919-942. https://doi.org/10.1109/TIT.2013.2289865.
MLA (9th ed.) CitationJOSEPH, Antony, and Andrew R. BARRON. "Fast Sparse Superposition Codes Have Near Exponential Error Probability for R < C." IEEE Transactions on Information Theory, vol. 60, no. 2, 2014, pp. 919-942, https://doi.org/10.1109/TIT.2013.2289865.
Warning: These citations may not always be 100% accurate.