{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:13:01Z","timestamp":1760145181338,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"ANID (ex CONICYT), FONDECYT Postdoctorado","award":["3180323"],"award-info":[{"award-number":["3180323"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this study, we work with lattice Gaussian coding for a K-user Gaussian interference channel. Following the procedure of Etkin et al., in which the capacity is found to be within 1 bit\/s\/Hz of the capacity of a two-user Gaussian interference channel for each type of interference using random codes, we work with lattices to take advantage of their structure and potential for interference alignment. We mimic random codes using a Gaussian distribution over the lattice. Imposing constraints on the flatness factor of the lattices, the common and private message powers, and the channel coefficients, we find the conditions to obtain the same constant gap to the optimal rate for the two-user weak Gaussian interference channel and the generalized degrees of freedom as those obtained with random codes, as found by Etkin et al. Finally, we show how it is possible to extend these results to a K-user weak Gaussian interference channel using lattice alignment.<\/jats:p>","DOI":"10.3390\/e26070575","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T12:28:48Z","timestamp":1720009728000},"page":"575","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Superposition Lattice Codes for the K-User Gaussian Interference Channel"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7201-8339","authenticated-orcid":false,"given":"Mar\u00eda Constanza","family":"Estela","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Universidad de Santiago de Chile (USACH), Santiago 9170022, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0010-5817","authenticated-orcid":false,"given":"Claudio","family":"Valencia-Cordero","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Universidad de Santiago de Chile (USACH), Santiago 9170022, Chile"}]}],"member":"1968","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TIT.1975.1055432","article-title":"A case where interference does not reduce capacity (corresp.)","volume":"21","author":"Carleial","year":"1975","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3425","DOI":"10.1109\/TIT.2008.926344","article-title":"Interference alignment and degrees of freedom of the K-user interference channel","volume":"54","author":"Cadambe","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/TIT.1981.1056307","article-title":"A new achievable rate region for the interference channel","volume":"27","author":"Han","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4566","DOI":"10.1109\/TIT.2010.2054590","article-title":"The approximate capacity of the many-to-one and one-to-many Gaussian interference channels","volume":"56","author":"Bresler","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TIT.2008.2008116","article-title":"Interference alignment on the deterministic channel and application to fully connected Gaussian interference networks","volume":"55","author":"Cadambe","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"3297","DOI":"10.1109\/TIT.2010.2048494","article-title":"Generalized degrees of freedom of the symmetric Gaussian K user interference channel","volume":"56","author":"Jafar","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Sridharan, S., Jafarian, A., Vishwanath, S., and Jafar, S. (December, January 30). Capacity of symmetric k-user gaussian very strong interference channels. Proceedings of the IEEE GLOBECOM 2008\u20142008 IEEE Global Telecommunications Conference, New Orleans, LA, USA.","DOI":"10.1109\/GLOCOM.2008.ECP.180"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sridharan, S., Jafarian, A., Vishwanath, S., Jafar, S., and Shamai, S. (2008, January 23\u201326). A layered lattice coding scheme for a class of three user Gaussian interference channel. Proceedings of the 46th Annual Allerton Conference on Communication, Control, and Computing 2008, Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2008.4797604"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"5534","DOI":"10.1109\/TIT.2008.2006447","article-title":"Gaussian interference channel capacity to within one bit","volume":"54","author":"Etkin","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1753","DOI":"10.1109\/TIT.2015.2408342","article-title":"On the optimality of treating interference as noise","volume":"61","author":"Geng","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3986","DOI":"10.1109\/TIT.2021.3071037","article-title":"Multi-layer interference alignment and GDoF of the k-user asymmetric interference channel","volume":"67","author":"Chen","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Peng, S., Chen, X., Lu, W., Deng, C., and Chen, J. (2022). Spatial Interference Alignment with Limited Precoding Matrix Feedback in a Wireless Multi-User Interference Channel for Smart Grids. Energies, 15.","DOI":"10.3390\/en15051820"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/TVT.2023.3306359","article-title":"UAV-Assisted Heterogeneous Cloud Radio Access Network With Comprehensive Interference Management","volume":"73","author":"Lu","year":"2024","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Li, J., Chen, G., Zhang, T., Feng, W., Jiang, W., Quek, T.Q.S., and Tafazolli, R. (IEEE Trans. Wirel. Commun., 2024). UAV-RIS-Aided Space-Air-Ground Integrated Network: Interference Alignment Design and DoF Analysis, IEEE Trans. Wirel. Commun., early access.","DOI":"10.1109\/TWC.2024.3384257"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"6399","DOI":"10.1109\/TIT.2014.2343226","article-title":"Semantically Secure Lattice Codes for the Gaussian Wiretap Channel","volume":"60","author":"Ling","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1109\/TIT.2019.2953929","article-title":"Semantically Secure Lattice Codes for Compound MIMO Channels","volume":"66","author":"Campello","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1109\/TIT.2015.2411260","article-title":"Secure Degrees of Freedom of K -User Gaussian Interference Channels: A Unified View","volume":"61","author":"Xie","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","unstructured":"Estela, M. (2014). Interference Management for Interference Channels: Performance Improvement and Lattice Techniques. [Ph.D. Thesis, Imperial College London]. Available online: http:\/\/hdl.handle.net\/10044\/1\/24678."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5918","DOI":"10.1109\/TIT.2014.2332343","article-title":"Achieving AWGN channel capacity with lattice Gaussian coding","volume":"60","author":"Ling","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","unstructured":"Etkin, R. (2006). Spectrum Sharing: Fundamental Limits, Scaling Laws, and Self-Enforcing Protocols. [Ph.D. Thesis, University of California at Berkeley]."},{"key":"ref_21","unstructured":"Han, T., and Kobayashi, K. (February, January 29). A further consideration of the HK and CMG regions for the interference channel. Proceedings of the ITA Workshop 2007, San Diego, CA, USA."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Oggier, F., and Viterbo, E. (2004). Algebraic Number Theory and Code Design for Rayleigh Fading Channels, Now Foundations and Trends.","DOI":"10.1561\/9781933019550"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Estela, M., Luzzi, L., Ling, C., and Belfiore, J. (2012, January 3\u20137). Analysis of lattice codes for the many-to-one interference channel. Proceedings of the 2012 IEEE Information Theory Workshop, Lausanne, Switzerland.","DOI":"10.1109\/ITW.2012.6404706"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Belfiore, J.-C. (2011, January 6\u201320). Lattice codes for the compute-and-forward protocol: The flatness factor. Proceedings of the 2011 IEEE Information Theory Workshop, Paraty, Brazil.","DOI":"10.1109\/ITW.2011.6089376"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1109\/18.641543","article-title":"Averaging bounds for lattices and linear codes","volume":"43","author":"Loeliger","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Zamir, R. (2014). Lattice Coding for Signal and Networks, Cambridge University Press.","DOI":"10.1017\/CBO9781139045520"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/7\/575\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:09:53Z","timestamp":1760108993000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/7\/575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":26,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2024,7]]}},"alternative-id":["e26070575"],"URL":"https:\/\/doi.org\/10.3390\/e26070575","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2024,7,3]]}}}