{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:44:34Z","timestamp":1760240674230,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Department of the Air Force","award":["FA8702-15-D-0001"],"award-info":[{"award-number":["FA8702-15-D-0001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>A scheme for recovery of a signal by distributed listeners in the presence of Gaussian interference is constructed by exhausting an \u201citerative power reduction\u201d property. An upper bound for the scheme\u2019s achieved mean-squared-error distortion is derived. The strategy exposes a parameter search problem, which, when solved, causes the scheme to outperform others of its kind. Performance of a blocklength-one scheme is simulated and is seen to improve over plain source coding without compression in the presence of many interferers, and experiences less outages over ensembles of channels.<\/jats:p>","DOI":"10.3390\/e21090845","type":"journal-article","created":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T10:31:17Z","timestamp":1567161077000},"page":"845","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Recovery of a Gaussian Source in Interference with Successive Lattice Processing"],"prefix":"10.3390","volume":"21","author":[{"given":"Christian","family":"Chapman","sequence":"first","affiliation":[{"name":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85281, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Kinsinger","sequence":"additional","affiliation":[{"name":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85281, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ameya","family":"Agaskar","sequence":"additional","affiliation":[{"name":"MIT Lincoln Laboratory, Lexington, MT 02420, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel W.","family":"Bliss","sequence":"additional","affiliation":[{"name":"School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ 85281, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/TIT.2009.2034791","article-title":"The Gaussian many-help-one distributed source coding problem","volume":"56","author":"Tavildar","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1109\/18.490552","article-title":"The CEO Problem [multiterminal source coding]","volume":"42","author":"Berger","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Maddah-Ali, M.A., and Tse, D. (2010, January 12\u201318). Interference neutralization in distributed lossy source coding. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Austin, TX, USA.","DOI":"10.1109\/ISIT.2010.5513259"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TIT.2010.2090225","article-title":"On Distributed Compression of Linear Functions","volume":"57","author":"Wagner","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/ett.1284","article-title":"The Case for Structured Random Codes in Network Capacity Theorems","volume":"19","author":"Nazer","year":"2008","journal-title":"Eur. Trans. Telecommun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1109\/TIT.2010.2103852","article-title":"Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region","volume":"57","author":"Krithivasan","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"4879","DOI":"10.1109\/TIT.2016.2593633","article-title":"Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations","volume":"62","author":"Nazer","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1109\/TIT.2016.2629491","article-title":"Integer-forcing source coding","volume":"63","author":"Ordentlich","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zamir, R. (2014). Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139045520"},{"key":"ref_10","unstructured":"Teixeira, P.J.M. (2018). Distributed Source Coding Based on Integer-Forcing. [Master\u2019s Thesis, T\u00e9cnico Lisboa]."},{"key":"ref_11","unstructured":"Griffin, J.C. (2017). Exploring Data Compression for a Distributed Aerial Relay Application. [Master\u2019s Thesis, Massachusetts Institute of Technology]."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"He, W., and Nazer, B. (2016, January 10\u201315). Integer-Forcing Source Coding: Successive Cancellation and Source-Channel Duality. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541280"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Krithivasan, D., and Pradhan, S.S. (2007). Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function. International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Springer.","DOI":"10.1007\/978-3-540-77224-8_22"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Yang, Y., and Xiong, Z. (2011, January 6\u201311). An improved lattice-based scheme for lossy distributed compression of linear functions. Proceedings of the Information Theory and Applications Workshop, San Diego, CA, USA.","DOI":"10.1109\/ITA.2011.5743626"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2835","DOI":"10.1109\/TIT.2014.2311809","article-title":"Distributed Compression of Linear Functions: Partial Sum-Rate Tightness and Gap to Optimal Sum-Rate","volume":"60","author":"Yang","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.2018.2864638","article-title":"Generalized Compute-Compress-and-Forward","volume":"65","author":"Cheng","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01581144","article-title":"Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems","volume":"66","author":"Schnorr","year":"1994","journal-title":"Math. Program."},{"key":"ref_18","unstructured":"Buchmann, J., and Pohst, M. (1987). Computing a Lattice Basis from a System of Generating Vectors. European Conference on Computer Algebra, Springer."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3246","DOI":"10.1109\/TIT.2018.2883119","article-title":"Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction D\u2032","volume":"65","author":"Silva","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1109\/TCOMM.2018.2876113","article-title":"Construction of capacity-achieving lattice codes: Polar lattices","volume":"67","author":"Liu","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Chapman, C.D., Mittelmann, H., Margetts, A.R., and Bliss, D.W. (2018). A Decentralized Receiver in Gaussian Interference. Entropy, 20.","DOI":"10.3390\/e20040269"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"El Gamal, A., and Kim, Y.H. (2011). Network Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139030687"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"4439","DOI":"10.1109\/TIT.2016.2571719","article-title":"A simple proof for the existence of \u201cgood\u201d pairs of nested lattices","volume":"62","author":"Ordentlich","year":"2016","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/9\/845\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:15:19Z","timestamp":1760188519000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/9\/845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,30]]},"references-count":23,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2019,9]]}},"alternative-id":["e21090845"],"URL":"https:\/\/doi.org\/10.3390\/e21090845","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,8,30]]}}}