{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T22:32:57Z","timestamp":1777761177811,"version":"3.51.4"},"reference-count":122,"publisher":"Emerald","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6,20]]},"abstract":"<jats:p>Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this goal in the last couple of decades, with the emergence of turbo codes, sparsegraph codes, and polar codes. These codes are designed primarily for discrete-alphabet channels and sources. For Gaussian channels and sources, where the alphabet is inherently continuous, Sparse Superposition Codes or Sparse Regression Codes (SPARCs) are a promising class of codes for achieving the Shannon limits.<\/jats:p>\n                  <jats:p>This monograph provides a unified and comprehensive over-view of sparse regression codes, covering theory, algorithms, and practical implementation aspects. The first part of the monograph focuses on SPARCs for AWGN channel coding, and the second part on SPARCs for lossy compression (with squared error distortion criterion). In the third part, SPARCs are used to construct codes for Gaussian multi-terminal channel and source coding models such as broadcast channels, multiple-access channels, and source and channel coding with side information. The monograph concludes with a discussion of open problems and directions for future work.<\/jats:p>","DOI":"10.1561\/0100000092","type":"journal-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T05:55:10Z","timestamp":1561010110000},"page":"1-195","source":"Crossref","is-referenced-by-count":39,"title":["Sparse Regression Codes"],"prefix":"10.1108","volume":"15","author":[{"given":"Ramji","family":"Venkataramanan","sequence":"first","affiliation":[{"name":"University of Cambridge"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sekhar","family":"Tatikonda","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Barron","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2019,6,20]]},"reference":[{"key":"2026032712273007200_ref001","unstructured":"131.0-B-2 TM Synchonization and Channel Coding. 2011. CCSDS. url: https:\/\/public.ccsds.org\/Pubs\/131x0b2ec1.pdf."},{"key":"2026032712273007200_ref002","first-page":"194","article-title":"Polar coding schemes for the AWGN channel","author":"Abbe","year":"2011","journal-title":"Proc. IEEE Int. Symp. Inf. Theory. IEEE"},{"issue":"7","key":"2026032712273007200_ref003","doi-asserted-by":"crossref","first-page":"3954","DOI":"10.1109\/TIT.2015.2434842","article-title":"Approaching the rate-distortion limit with spatial coupling, belief propagation, and decimation","volume":"61","author":"Aref","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"7","key":"2026032712273007200_ref004","doi-asserted-by":"crossref","first-page":"30513073","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels","volume":"55","author":"Arikan","year":"2009","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"11","key":"2026032712273007200_ref005","doi-asserted-by":"crossref","first-page":"2657","DOI":"10.1109\/TIT.2004.836693","article-title":"Extrinsic information transfer functions: model and erasure channel properties","volume":"50","author":"Ashikhmin","year":"2004","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"4","key":"2026032712273007200_ref006","doi-asserted-by":"crossref","DOI":"10.1214\/aoms\/1177705674","article-title":"On Deviations of the Sample Mean","volume":"31","author":"Bahadur","year":"1960","journal-title":"The Annals of Mathematical Statistics"},{"key":"2026032712273007200_ref007","article-title":"Universal Sparse Superposition Codes with Spatial Coupling and GAMP Decoding","author":"Barbier","year":"2017"},{"key":"2026032712273007200_ref008","article-title":"Proof of threshold saturation for spatially coupled sparse superposition codes","author":"Barbier","year":"2016","journal-title":"Proc. IEEE Int. Symp. Inf. Theory"},{"key":"2026032712273007200_ref009","article-title":"Threshold saturation of spatially coupled sparse superposition codes for all memoryless channels","author":"Barbier","year":"2016","journal-title":"IEEE Inf. Theory Workshop."},{"key":"2026032712273007200_ref010","article-title":"Replica Analysis and Approximate Message Passing Decoder for Sparse Superposition Codes","author":"Barbier","year":"2014","journal-title":"Proc. IEEE Int. Symp. Inf. Theory"},{"issue":"8","key":"2026032712273007200_ref011","doi-asserted-by":"crossref","first-page":"4894","DOI":"10.1109\/TIT.2017.2713833","article-title":"Approximate message passing decoder and capacity-achieving sparse superposition codes","volume":"63","author":"Barbier","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"5","key":"2026032712273007200_ref012","doi-asserted-by":"crossref","DOI":"10.1088\/1742-5468\/2015\/05\/P05013","article-title":"Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes","author":"Barbier","year":"2015","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"5","key":"2026032712273007200_ref013","doi-asserted-by":"crossref","first-page":"P05013","DOI":"10.1088\/1742-5468\/2015\/05\/P05013","article-title":"Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes","author":"Barbier","year":"2015","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"2026032712273007200_ref014","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2010.5513318","article-title":"Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity","author":"Barron","year":"2010"},{"issue":"5","key":"2026032712273007200_ref015","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1109\/TIT.2012.2184847","article-title":"Least Squares Superposition Codes of Moderate Dictionary Size Are Reliable at Rates up to Capacity","volume":"58","author":"Barron","year":"2012","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref016","article-title":"High-rate sparse superposition codes with iteratively optimal estimates","author":"Barron","year":"2012","journal-title":"Proc. IEEE Int. Symp. Inf. Theory"},{"issue":"5","key":"2026032712273007200_ref017","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1109\/TIT.2003.810639","article-title":"The duality between information embedding and source coding with side information and some applications","volume":"49","author":"Barron","year":"2003","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"4","key":"2026032712273007200_ref018","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1109\/TIT.2011.2174612","article-title":"The LASSO Risk for Gaussian Matrices","volume":"58","author":"Bayati","year":"2012","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref019","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1109\/TIT.2010.2094817","article-title":"The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing","author":"Bayati","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712273007200_ref020","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/26.539767","article-title":"Near optimum error correcting coding and decoding: turbo-codes","volume":"44","author":"Berrou","year":"1996","journal-title":"IEEE Trans. Commun."},{"key":"2026032712273007200_ref021","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800467","volume-title":"Algebraic codes for data transmission","author":"Blahut","year":"2003"},{"issue":"12","key":"2026032712273007200_ref022","doi-asserted-by":"crossref","first-page":"4651","DOI":"10.1109\/TCOMM.2015.2494016","article-title":"Bandwidth efficient and rate-matched low-density parity-check coded modulation","volume":"63","author":"B\u00f6cherer","year":"2015","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"2026032712273007200_ref023","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1109\/18.923725","article-title":"Quantization index modulation: a class of provably good methods for digital watermarking and information embedding","volume":"47","author":"Chen","year":"2001","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref024","volume-title":"PhD thesis","author":"Cho","year":"2014"},{"key":"2026032712273007200_ref025","article-title":"Approximate Iterative Bayes Optimal Estimates for High-Rate Sparse Superposition Codes","author":"Cho","year":"2013","journal-title":"Sixth Workshop on Information-Theoretic Methods in Science and Engineering"},{"key":"2026032712273007200_ref026","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1137\/1.9781611973099.22","article-title":"The condensation transition in random hypergraph 2-coloring","author":"Coja-Oghlan","year":"2012","journal-title":"Proc. 23rd Annual ACM-SIAM Symp. on Discrete Algorithms (SODA)"},{"issue":"3","key":"2026032712273007200_ref027","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TIT.1983.1056659","article-title":"Writing on dirty paper (Corresp.)","volume":"29","author":"Costa","year":"1983","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"6","key":"2026032712273007200_ref028","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1109\/JPROC.2007.895188","article-title":"Channel coding: The road to channel capacity","volume":"95","author":"Costello","year":"2007","journal-title":"Proc. IEEE"},{"issue":"1","key":"2026032712273007200_ref029","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","article-title":"Broadcast channels","volume":"18","author":"Cover","year":"1972","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref030","volume-title":"Elements of Information Theory","author":"Cover","year":"2012"},{"key":"2026032712273007200_ref031","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","volume-title":"Order Statistics","author":"David","year":"2003"},{"key":"2026032712273007200_ref032","volume-title":"Large deviations","author":"Den Hollander","year":"2008"},{"issue":"11","key":"2026032712273007200_ref033","doi-asserted-by":"crossref","first-page":"7434","DOI":"10.1109\/TIT.2013.2274513","article-title":"Inform-ation-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing","author":"Donoho","year":"2013","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"45","key":"2026032712273007200_ref034","doi-asserted-by":"crossref","first-page":"18914","DOI":"10.1073\/pnas.0909892106","article-title":"Messagepassing algorithms for compressed sensing","volume":"106","author":"Donoho","year":"2009","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2026032712273007200_ref035","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"El Gamal","year":"2011"},{"issue":"2","key":"2026032712273007200_ref036","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/18.75242","article-title":"Successive refinement of information","volume":"37","author":"Equitz","year":"1991","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"11","key":"2026032712273007200_ref037","doi-asserted-by":"crossref","first-page":"3820","DOI":"10.1109\/TIT.2005.856935","article-title":"Capacity and lattice strategies for canceling known interference","volume":"51","author":"Erez","year":"2005","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"10","key":"2026032712273007200_ref038","doi-asserted-by":"crossref","first-page":"3417","DOI":"10.1109\/TIT.2005.855586","article-title":"A close-to-capacity dirty paper coding scheme","volume":"51","author":"Erez","year":"2005","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"10","key":"2026032712273007200_ref039","doi-asserted-by":"crossref","first-page":"3401","DOI":"10.1109\/TIT.2005.855591","article-title":"Lattices which are good for (almost) everything","volume":"51","author":"Erez","year":"2005","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"10","key":"2026032712273007200_ref040","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1109\/TIT.2004.834787","article-title":"Achieving 1\/2 log (1 + snr) on the AWGN channel with lattice encoding and decoding","volume":"50","author":"Erez","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712273007200_ref041","doi-asserted-by":"crossref","first-page":"2181","DOI":"10.1109\/18.782171","article-title":"Time-varying periodic convolutional codes with low-density parity-check matrix","volume":"45","author":"Felstrom","year":"1999","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref042","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2019.8849802","article-title":"SPARCs for Unsourced Random Access","author":"Fengler","year":"2019"},{"issue":"6","key":"2026032712273007200_ref043","doi-asserted-by":"crossref","first-page":"2384","DOI":"10.1109\/18.720542","article-title":"Modulation and coding for linear Gaussian channels","volume":"44","author":"Forney","year":"1998","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref044","volume-title":"Information theory and reliable communication","author":"Gallager","year":"1968"},{"key":"2026032712273007200_ref045","first-page":"19","article-title":"Coding for a channel with random parameters","volume":"9","author":"Gelfand","year":"1980","journal-title":"Problems of Control and Information"},{"issue":"1","key":"2026032712273007200_ref046","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/JPROC.2004.839619","article-title":"Distributed Video Coding","volume":"93","author":"Girod","year":"2005","journal-title":"Proceedings of the IEEE"},{"issue":"5","key":"2026032712273007200_ref047","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TIT.1968.1054193","article-title":"Asymptotically efficient quantizing","volume":"14","author":"Gish","year":"1968","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref048","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511841224","volume-title":"Wireless communications","author":"Goldsmith","year":"2005"},{"issue":"3","key":"2026032712273007200_ref049","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TCOMM.2017.2776937","article-title":"Techniques for improving the finite length performance of sparse superposition codes","volume":"66","author":"Greig","year":"2018","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712273007200_ref050","volume-title":"Bitinterleaved coded modulation","author":"Guill\u00e9n i F\u00e0bregas","year":"2008"},{"issue":"5","key":"2026032712273007200_ref051","doi-asserted-by":"crossref","first-page":"1961","DOI":"10.1109\/TIT.2009.2016040","article-title":"Nonlinear Sparse-Graph Codes for Lossy Compression","volume":"55","author":"Gupta","year":"2009","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref052","article-title":"Rate-distortion in near-linear time","author":"Gupta","year":"2008","journal-title":"Proc. IEEE Int. Symp. on Inf. Theory"},{"issue":"1","key":"2026032712273007200_ref053","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TIT.2014.2371819","article-title":"Polar codes: Speed of polarization and polynomial gap to capacity","volume":"61","author":"Guruswami","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"2026032712273007200_ref054","doi-asserted-by":"crossref","first-page":"433","DOI":"10.2307\/3212912","article-title":"On the rate of convergence of normal extremes","volume":"16","author":"Hall","year":"1979","journal-title":"Journal of Applied Probability"},{"issue":"11","key":"2026032712273007200_ref055","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2002.804056","article-title":"Gaussian source coding with spherical codes","volume":"48","author":"Hamkins","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712273007200_ref056","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TIT.2015.2490660","article-title":"Relaxed recovery conditions for OMP\/OLS by exploiting both coherence and decay","volume":"62","author":"Herzet","year":"2016","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref057","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Hsieh","year":"2018"},{"issue":"10","key":"2026032712273007200_ref058","article-title":"Error exponent for coding of memoryless Gaussian sources with a fidelity criterion","volume":"E83-A","author":"Ihara","year":"2000","journal-title":"IEICE Trans. Fundamentals"},{"key":"2026032712273007200_ref059","first-page":"53","article-title":"The Dispersion of Lossy Source Coding","volume-title":"Data Compression Conference (DCC)","author":"Ingber","year":"2011"},{"key":"2026032712273007200_ref060","article-title":"Rate-Distortion via Markov Chain Monte Carlo","author":"Jalali","year":"2010","journal-title":"Proc. IEEE Int. Symp. on Inf. Theory"},{"key":"2026032712273007200_ref061","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"Janson","year":"2000"},{"key":"2026032712273007200_ref062","volume-title":"PhD thesis","author":"Joseph","year":"2012"},{"issue":"2","key":"2026032712273007200_ref063","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1109\/TIT.2013.2289865","article-title":"Fast Sparse Superposition Codes Have Near Exponential Error Probability for R &lt; C","volume":"60","author":"Joseph","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"2026032712273007200_ref064","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1109\/18.796370","article-title":"An implementable lossy version of the Lempel-Ziv algorithm-I: Optimality for memoryless sources","volume":"45","author":"Kontoyiannis","year":"1999","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref065","first-page":"236","article-title":"Efficient random codebooks and databases for lossy compression in near-linear time","author":"Kontoyiannis","year":"2009","journal-title":"IEEE Inf. Theory Workshop"},{"key":"2026032712273007200_ref066","article-title":"Sparse superposition codes for Gaussian vector quantization","volume":"1","author":"Kontoyiannis","year":"2010","journal-title":"IEEE Inf. Theory Workshop"},{"key":"2026032712273007200_ref067","article-title":"Polar codes for SlepianWolf, Wyner-Ziv, and Gelfand-Pinsker","author":"Korada","year":"2010","journal-title":"IEEE Inf. Theory Workshop."},{"issue":"4","key":"2026032712273007200_ref068","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","article-title":"Polar Codes are Optimal for Lossy Source Coding","volume":"56","author":"Korada","year":"2010","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"6","key":"2026032712273007200_ref069","doi-asserted-by":"crossref","first-page":"3309","DOI":"10.1109\/TIT.2012.2186786","article-title":"Fixed-Length Lossy Compression in the Finite Blocklength Regime","volume":"58","author":"Kostina","year":"2012","journal-title":"IEEE Trans. on Inf. Theory."},{"issue":"8","key":"2026032712273007200_ref070","doi-asserted-by":"crossref","DOI":"10.1088\/1742-5468\/2012\/08\/P08009","article-title":"Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices","author":"Krzakala","year":"2012","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"2026032712273007200_ref071","first-page":"347","article-title":"The effect of spatial coupling on compressive sensing","volume-title":"Proc. 48th Annual Allerton Conference on Communication, Control, and Computing","author":"Kudekar","year":"2010"},{"issue":"2","key":"2026032712273007200_ref072","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TIT.2010.2095072","article-title":"Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC","volume":"57","author":"Kudekar","year":"2011","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"12","key":"2026032712273007200_ref073","doi-asserted-by":"crossref","first-page":"7761","DOI":"10.1109\/TIT.2013.2280915","article-title":"Spatially Coupled Ensembles Universally Achieve Capacity under Belief Propagation","volume":"59","author":"Kudekar","year":"2013","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"12","key":"2026032712273007200_ref074","doi-asserted-by":"crossref","first-page":"7389","DOI":"10.1109\/TIT.2014.2360692","article-title":"Threshold saturation for spatially coupled LDPC and LDGM codes on BMS channels","volume":"60","author":"Kumar","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"1","key":"2026032712273007200_ref075","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/18.567644","article-title":"On the role of mismatch in rate distortion theory","volume":"43","author":"Lapidoth","year":"1997","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"10","key":"2026032712273007200_ref076","doi-asserted-by":"crossref","first-page":"5274","DOI":"10.1109\/TIT.2010.2059490","article-title":"Iterative decoding threshold analysis for LDPC convolutional codes","volume":"56","author":"Lentmaier","year":"2010","journal-title":"IEEE Trans. Inf. Thy."},{"issue":"12","key":"2026032712273007200_ref077","doi-asserted-by":"crossref","first-page":"2578","DOI":"10.1109\/LCOMM.2017.2754262","article-title":"Clipping Can Improve the Performance of Spatially Coupled Sparse Superposition Codes","volume":"21","author":"Liang","year":"2017","journal-title":"IEEE Commun. Letters."},{"key":"2026032712273007200_ref078","volume-title":"Error control coding","author":"Lin","year":"2004"},{"issue":"2","key":"2026032712273007200_ref079","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TIT.1974.1055204","article-title":"Error exponent for source coding with a fidelity criterion","volume":"20","author":"Marton","year":"1974","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"9","key":"2026032712273007200_ref080","doi-asserted-by":"crossref","first-page":"4866","DOI":"10.1109\/TIT.2015.2453267","article-title":"Spatially coupled LDPC codes constructed from protographs","volume":"61","author":"Mitchell","year":"2015","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref081","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1017\/CBO9780511794308.010","volume-title":"Compressed Sensing","author":"Montanari","year":"2012"},{"issue":"12","key":"2026032712273007200_ref082","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1109\/JPROC.2005.859599","article-title":"Data-Hiding Codes","volume":"93","author":"Moulin","year":"2005","journal-title":"Proc. IEEE"},{"issue":"10","key":"2026032712273007200_ref083","doi-asserted-by":"crossref","first-page":"5484","DOI":"10.1109\/TIT.2016.2598148","article-title":"Rateless lossy compression via the extremes","volume":"62","author":"No","year":"2016","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref084","article-title":"Information theoretic analysis of steganography","author":"O'Sullivan","year":"1998","journal-title":"IEEE Int. Symp. on Inf. Theory."},{"issue":"5","key":"2026032712273007200_ref085","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","article-title":"Channel coding rate in the finite blocklength regime","volume":"56","author":"Polyanskiy","year":"2010","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"5","key":"2026032712273007200_ref086","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1109\/TIT.2003.810622","article-title":"Duality between source coding and channel coding and its extension to the side information case","volume":"49","author":"Pradhan","year":"2003","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712273007200_ref087","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/TIT.2002.808103","article-title":"Distributed source coding using syndromes (DISCUS): design and construction","volume":"49","author":"Pradhan","year":"2003","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"10","key":"2026032712273007200_ref088","doi-asserted-by":"crossref","first-page":"2436","DOI":"10.1109\/TIP.2007.904949","article-title":"PRISM: A Video Coding Paradigm With Motion Estimation at the Decoder","volume":"16","author":"Puri","year":"2007","journal-title":"IEEE Trans. Image Process."},{"key":"2026032712273007200_ref089","unstructured":"Python script for SPARC with AMP decoding. url: https:\/\/github.com\/sigproc\/sparc-amp\/blob\/master\/sparc_amp.ipynb (accessed on 04\/26\/2017)."},{"key":"2026032712273007200_ref090","first-page":"2168","article-title":"Generalized approximate message passing for estimation with random linear mixing","author":"Rangan","year":"2011","journal-title":"Proc. IEEE Int. Symp. Inf. Theory"},{"key":"2026032712273007200_ref091","first-page":"13","article-title":"Design of optimal quantizers for distributed source coding","volume-title":"Data Compression Conference","author":"Rebollo-Monedero","year":"2003"},{"key":"2026032712273007200_ref092","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"Richardson","year":"2008"},{"issue":"1","key":"2026032712273007200_ref093","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1109\/18.272493","article-title":"Successive refinement of information: characterization of the achievable rates","volume":"40","author":"Rimoldi","year":"1994","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712273007200_ref094","doi-asserted-by":"crossref","first-page":"1476","DOI":"10.1109\/TIT.2017.2649460","article-title":"Capacityachieving Sparse Superposition Codes via Approximate Message Passing Decoding","volume":"63","author":"Rush","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref095","article-title":"Capacityachieving sparse regression codes via spatial coupling","author":"Rush","year":"2018","journal-title":"Proc. IEEE Inf. Theory Workshop"},{"key":"2026032712273007200_ref096","article-title":"The Error Probability of Sparse Superposition Codes with Approximate Message Passing Decoding","author":"Rush","year":"2017"},{"issue":"3","key":"2026032712273007200_ref097","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/TIT.1968.1054145","article-title":"A geometric treatment of the source encoding of a Gaussian random variable","volume":"14","author":"Sakrison","year":"1968","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"2026032712273007200_ref098","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0019-9958(69)90403-3","article-title":"The rate distortion function for a class of sources","volume":"15","author":"Sakrison","year":"1969","journal-title":"Information and Control"},{"issue":"1","key":"2026032712273007200_ref099","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/TIT.1970.1054394","article-title":"The rate of a class of random processes","volume":"16","author":"Sakrison","year":"1970","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"5","key":"2026032712273007200_ref100","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1109\/T-C.1969.222685","article-title":"Computation of the Fast Walsh-Fourier Transform","volume":"18","author":"Shanks","year":"1969","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"2026032712273007200_ref101","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1109\/TIT.2008.917684","article-title":"Low-Density Lattice Codes","volume":"54","author":"Sommer","year":"2008","journal-title":"IEEE Trans. on Inf. Theory."},{"issue":"10","key":"2026032712273007200_ref102","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/MCOM.2004.1341262","article-title":"An introduction to the multi-user MIMO downlink","volume":"42","author":"Spencer","year":"2004","journal-title":"IEEE Commun. Mag."},{"issue":"7","key":"2026032712273007200_ref103","doi-asserted-by":"crossref","first-page":"3013","DOI":"10.1109\/TIT.2009.2021319","article-title":"Near-Capacity Dirty-Paper Code Design: A Source-Channel Coding Approach","volume":"55","author":"Sun","year":"2009","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref104","doi-asserted-by":"crossref","first-page":"2737","DOI":"10.1109\/TIT.2014.2312728","article-title":"Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity","volume":"60","author":"Takeishi","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref105","first-page":"1168","article-title":"An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary","author":"Takeishi","year":"2016","journal-title":"IEEE Int. Symp. on Inf. Theory."},{"issue":"13","key":"2026032712273007200_ref106","first-page":"1117","article-title":"Convergence of iterative decoding","volume":"35","author":"ten Brink","year":"1999","journal-title":"Electronics letters"},{"issue":"4","key":"2026032712273007200_ref107","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1109\/TCOMM.2004.826370","article-title":"Design of low-density parity-check codes for modulation and detection","volume":"52","author":"ten Brink","year":"2004","journal-title":"IEEE Trans. Commun."},{"key":"2026032712273007200_ref108","unstructured":"The Coded Modulation Library. 2008. url: http:\/\/www.iterativesolutions.com\/Matlab.htm (accessed on 01\/16\/2017)."},{"key":"2026032712273007200_ref109","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the LASSO","author":"Tibshirani","year":"1996","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"2026032712273007200_ref110","volume-title":"Statistical learning with sparsity: the LASSO and generalizations","author":"Tibshirani","year":"2015"},{"key":"2026032712273007200_ref111","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807213","volume-title":"Fundamentals of wireless communication","author":"Tse","year":"2005"},{"issue":"6","key":"2026032712273007200_ref112","doi-asserted-by":"crossref","first-page":"3254","DOI":"10.1109\/TIT.2014.2313085","article-title":"Lossy Compression via Sparse Linear Regression: Performance under Minimum-distance Encoding","volume":"60","author":"Venkataramanan","year":"2014","journal-title":"IEEE Trans. Inf. Thy."},{"issue":"6","key":"2026032712273007200_ref113","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1109\/TIT.2014.2314676","article-title":"Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding","volume":"60","author":"Venkataramanan","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref114","doi-asserted-by":"crossref","DOI":"10.1109\/Allerton.2012.6483463","article-title":"Sparse Regression Codes for Multi-terminal Source and Channel Coding","volume-title":"50th Allerton Conf. on Commun., Control, and Computing","author":"Venkataramanan","year":"2012"},{"issue":"8","key":"2026032712273007200_ref115","doi-asserted-by":"crossref","first-page":"5228","DOI":"10.1109\/TIT.2017.2716360","article-title":"The Rate-Distortion Function and Excess-Distortion Exponent of Sparse Regression Codes with Optimal Encoding","volume":"63","author":"Venkataramanan","year":"2017","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"3","key":"2026032712273007200_ref116","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1109\/TIT.2009.2039160","article-title":"Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms","volume":"56","author":"Wainwright","year":"2010","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref117","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1976.1055508","article-title":"The rate-distortion function for source coding with side information at the decoder","volume":"22","author":"Wyner","year":"1976","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref118","article-title":"Construction of capacity-achieving lattice codes: Polar lattices","author":"Yan","year":"2014"},{"issue":"2","key":"2026032712273007200_ref119","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/TCOMM.2009.02.070287","article-title":"Wyner-Ziv coding based on TCQ and LDPC codes","volume":"57","author":"Yang","year":"2009","journal-title":"IEEE Trans. Commun."},{"issue":"11","key":"2026032712273007200_ref120","doi-asserted-by":"crossref","first-page":"6943","DOI":"10.1109\/TIT.2014.2352296","article-title":"A simple proof of Maxwell saturation for coupled scalar recursions","volume":"60","author":"Yedla","year":"2014","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"6","key":"2026032712273007200_ref121","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/TIT.2002.1003821","article-title":"Nested linear\/lattice codes for structured multiterminal binning","volume":"48","author":"Zamir","year":"2002","journal-title":"IEEE Trans. Inf. Theory."},{"key":"2026032712273007200_ref122","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139045520","volume-title":"Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory","author":"Zamir","year":"2014"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/15\/1-2\/1\/11146821\/0100000092en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/15\/1-2\/1\/11146821\/0100000092en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:33Z","timestamp":1777471833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/15\/1-2\/1\/1332137\/Sparse-Regression-Codes"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,20]]},"references-count":122,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,6,20]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000092","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,20]]}}}