{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:20:39Z","timestamp":1772104839433,"version":"3.50.1"},"reference-count":115,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Physical-layer security (PLS) provides an information-theoretic framework for securing wireless communications by exploiting channel and signal-structure asymmetries, thereby avoiding reliance on computational hardness assumptions. Within this setting, lattice codes and their algebraic constructions play a central role in achieving secrecy over Gaussian and fading wiretap channels. This article offers a comprehensive survey of lattice-based wiretap coding, covering foundational concepts in algebraic number theory, Construction A over number fields, and the structure of modular and unimodular lattice families. We review key secrecy metrics, including secrecy gain, flatness factor, and equivocation, and consolidate classical and recent results to provide a unified perspective that links wireless-channel models with their underlying algebraic lattice structures. In addition, we review a newly proposed family of p-modular lattices in Khodaiemehr, H., 2018 constructed from cyclotomic fields Q(\u03b6p) for primes p\u22611(mod4) via a generalized Construction A framework. We characterize their algebraic and geometric properties and establish a non-existence theorem showing that such constructions cannot be extended to prime-power cyclotomic fields Q(\u03b6pn) with n&gt;1. Finally, motivated by the fact that these p-modular lattices naturally yield mixed-signature structures for which classical theta series diverge, we integrate recent advances on indefinite theta series and modular completions. Drawing on Vign\u00e9ras\u2019 differential framework and generalized error functions, we outline how modularly completed indefinite theta series provide a principled analytic foundation for defining secrecy-relevant quantities in the indefinite setting. Overall, this work serves both as a survey of algebraic lattice techniques for PLS and as a source of new design insights for secure wireless communication systems.<\/jats:p>","DOI":"10.3390\/e28020235","type":"journal-article","created":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T07:50:30Z","timestamp":1771401030000},"page":"235","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Survey of Lattice-Based Physical-Layer Security for Wireless Systems with p-Modular Lattice Constructions"],"prefix":"10.3390","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0489-8546","authenticated-orcid":false,"given":"Hassan","family":"Khodaiemehr","sequence":"first","affiliation":[{"name":"School of Engineering, Faculty of Applied Science, University of British Columbia (UBC), Okanagan Campus, Kelowna, BC V1V 1V7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1434-8062","authenticated-orcid":false,"given":"Khadijeh","family":"Bagheri","sequence":"additional","affiliation":[{"name":"School of Engineering, Faculty of Applied Science, University of British Columbia (UBC), Okanagan Campus, Kelowna, BC V1V 1V7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9618-1189","authenticated-orcid":false,"given":"Amin","family":"Mohajer","sequence":"additional","affiliation":[{"name":"School of Engineering, Faculty of Applied Science, University of British Columbia (UBC), Okanagan Campus, Kelowna, BC V1V 1V7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6726-0259","authenticated-orcid":false,"given":"Chen","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Engineering, Faculty of Applied Science, University of British Columbia (UBC), Okanagan Campus, Kelowna, BC V1V 1V7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3551-4063","authenticated-orcid":false,"given":"Daniel","family":"Panario","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Carleton University, Ottawa, ON K1S 5B6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3529-2640","authenticated-orcid":false,"given":"Victor C. M.","family":"Leung","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of British Columbia (UBC), Vancouver, BC V6T 1Z4, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,2,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1561\/0100000036","article-title":"Information theoretic security","volume":"5","author":"Liang","year":"2009","journal-title":"Found. Trends Commun. Inf. Theory"},{"key":"ref_2","unstructured":"Menezes, A.J., van Oorschot, P.C., and Vanstone, S.A. (1996). Handbook of Applied Cryptography, CRC Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","article-title":"The wire-tap channel","volume":"54","author":"Wyner","year":"1975","journal-title":"Bell Syst. Tech. J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","article-title":"Broadcast channels with confidential messages","volume":"24","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1109\/TIT.2004.834787","article-title":"Achieving 12log(1+SNR) on the AWGN Channel with Lattice Encoding and Decoding","volume":"50","author":"Erez","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1109\/18.841165","article-title":"Sphere-bound-achieving coset codes and multilevel coset codes","volume":"46","author":"Forney","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/18.651040","article-title":"Lattice codes can achieve capacity on the AWGN channel","volume":"44","author":"Urbanke","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"4481","DOI":"10.1109\/TIT.2006.881720","article-title":"Low-density parity-check lattices: Construction and decoding analysis","volume":"52","author":"Sadeghi","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Khodaiemehr, H., Kiani, D., and Sadeghi, M.R. (2015). One-level LDPC lattice codes for the relay channels. Proceedings of the 2015 Iran Workshop on Communication and Information Theory (IWCIT), IEEE.","DOI":"10.1109\/IWCIT.2015.7140213"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Khodaiemehr, H., Sadeghi, M.R., and Panario, D. (2016). Construction of full-diversity 1-level LDPC lattices for block-fading channels. 2016 IEEE International Symposium on Information Theory (ISIT), IEEE.","DOI":"10.1109\/ISIT.2016.7541792"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TIT.2020.3008973","article-title":"Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels","volume":"67","author":"Khodaiemehr","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"13146","DOI":"10.1109\/TCOMM.2025.3615774","article-title":"Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels","volume":"73","author":"Sadeghi","year":"2025","journal-title":"IEEE Trans. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Sadeghi, M., Khodaiemehr, H., and Feng, C. (2025). Design and Decoding of Full-Diversity Construction-D Lattices on Block-Fading Channels. 2025 IEEE International Symposium on Information Theory (ISIT), IEEE.","DOI":"10.1109\/ISIT63088.2025.11195519"},{"key":"ref_14","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. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"di Pietro, N., Boutros, J.J., Zemor, G., and Brunel, L. (2012). Integer low-density lattices based on construction A. 2012 IEEE Information Theory Workshop (ITW), IEEE.","DOI":"10.1109\/ITW.2012.6404707"},{"key":"ref_16","unstructured":"Yan, Y., and Ling, C. (2012). A construction of lattices from polar codes. 2012 IEEE Information Theory Workshop (ITW), IEEE."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/TCOMM.2013.13.120317","article-title":"Gr\u00f6bner bases for lattices and an algebraic decoding algorithm","volume":"61","author":"Aliasgari","year":"2013","journal-title":"IEEE Trans. Commun."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"851","DOI":"10.3934\/amc.2016045","article-title":"Computing Gr\u00f6bner bases associated with lattices","volume":"10","author":"Panario","year":"2016","journal-title":"Adv. Math. Commun."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Oggier, F., and Viterbo, E. (2004). Algebraic Number Theory and Code Design for Rayleigh Fading Channels, Now Publishers. Foundations and Trends in Communications and Information Theory.","DOI":"10.1561\/9781933019550"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Berhuy, G., and Oggier, F. (2013). An Introduction to Central Simple Algebras and Their Applications to Wireless Communication, American Mathematical Society. Mathematical Surveys and Monographs.","DOI":"10.1090\/surv\/191"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2596","DOI":"10.1109\/TIT.2003.817831","article-title":"Full-diversity, high-rate space-time block codes from division algebras","volume":"49","author":"Sethuraman","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1109\/TIT.2005.844069","article-title":"The golden code: A 2\u00d72 full rate space-time code with non vanishing determinants","volume":"51","author":"Belfiore","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1109\/18.986032","article-title":"A construction of a space-time code based on number theory","volume":"48","author":"Damen","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3853","DOI":"10.1109\/TIT.2007.907502","article-title":"Perfect space-time codes for any number of antennas","volume":"53","author":"Elia","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"5231","DOI":"10.1109\/TIT.2008.929963","article-title":"Construction of space-time codes from division algebras with roots of unity as non-norm elements","volume":"54","author":"Lahtonen","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3885","DOI":"10.1109\/TIT.2006.880010","article-title":"Perfect space-time block codes","volume":"52","author":"Oggier","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"6148","DOI":"10.1109\/TIT.2011.2161909","article-title":"Quadratic forms and space-time block codes from generalized quaternion and biquaternion algebras","volume":"57","author":"Unger","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2682","DOI":"10.1109\/TIT.2009.2018172","article-title":"High-rate, multi-symbol-decodable STBCs from Clifford algebras","volume":"55","author":"Karmakar","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"3913","DOI":"10.1109\/TIT.2006.880049","article-title":"Information-lossless space-time block codes from crossed-product algebras","volume":"52","author":"Vummintala","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s00200-015-0267-2","article-title":"2- and 3-modular lattice wiretap codes in small dimensions","volume":"26","author":"Lin","year":"2015","journal-title":"AAECC"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1109\/TIT.1978.1055917","article-title":"The Gaussian wire-tap channel","volume":"24","author":"Hellman","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/TIFS.2011.2134093","article-title":"LDPC codes for the Gaussian wiretap channel","volume":"6","author":"Klinc","year":"2011","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Liu, R., Poor, H.V., Spasojevic, P., and Liang, Y. (2008). Nested codes for secure transmission. 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, IEEE.","DOI":"10.1109\/PIMRC.2008.4699910"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Belfiore, J.C., and Oggier, F. (2010). Secrecy gain: A wiretap lattice code design. 2010 International Symposium On Information Theory & Its Applications (ISITA), IEEE.","DOI":"10.1109\/ISITA.2010.5650095"},{"key":"ref_35","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_36","doi-asserted-by":"crossref","unstructured":"Belfiore, J.C., and Sol\u00e9, P. (2010). Unimodular lattices for the Gaussian wiretap channel. 2010 IEEE Information Theory Workshop (ITW), IEEE.","DOI":"10.1109\/CIG.2010.5592923"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"5690","DOI":"10.1109\/TIT.2015.2494594","article-title":"Lattice codes for the wiretap Gaussian channel: Construction and analysis","volume":"62","author":"Oggier","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"5950","DOI":"10.1109\/TIT.2012.2201915","article-title":"On a conjecture by Belfiore and Sol\u00e9 on some lattices","volume":"58","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"2805","DOI":"10.1109\/TIT.2014.2311075","article-title":"Some results related to the conjecture by Belfiore and Sol\u00e9","volume":"60","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"3295","DOI":"10.1109\/TIT.2013.2246814","article-title":"A classification of unimodular lattice wiretap codes in small dimensions","volume":"59","author":"Lin","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Lin, F., and Oggier, F. (2012). Gaussian wiretap lattice codes from binary self-dual codes. 2012 IEEE Information Theory Workshop (ITW), IEEE.","DOI":"10.1109\/ITW.2012.6404761"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Pinchak, J. (2013). Wiretap codes: Families of lattices satisfying the Belfiore-Sol\u00e9 secrecy function conjecture. 2013 IEEE International Symposium on Information Theory (ISIT), IEEE.","DOI":"10.1109\/ISIT.2013.6620700"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Pinchak, J., and Sethuraman, B.A. (2014). The Belfiore-Sol\u00e9 conjecture and a certain technique for verifying it for a given lattice. 2014 Information Theory and Applications Workshop (ITA), IEEE.","DOI":"10.1109\/ITA.2014.6804279"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Ernvall-Hyt\u00f6nen, A.M., and Sethuraman, B.A. (2015). Counterexample to the generalized Belfiore-Sol\u00e9 secrecy function conjecture for \u2113-modular lattices. 2015 IEEE International Symposium on Information Theory (ISIT), IEEE.","DOI":"10.1109\/ISIT.2015.7282899"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Lin, F., and Oggier, F. (2012). Secrecy gain of Gaussian wiretap codes from 2-and 3-modular lattices. 2012 IEEE International Symposium on Information Theory (ISIT), IEEE.","DOI":"10.1109\/ISIT.2012.6283577"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Conway, J.H., and Sloane, N.J.A. (1988). Sphere Packings, Lattices and Groups, Springer.","DOI":"10.1007\/978-1-4757-2016-7"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Ebeling, W. (2013). Lattices and Codes: A Course Partially Based on Lecturers by F. Hirzebruch, Springer. Advanced Lectures in Mathematics.","DOI":"10.1007\/978-3-658-00360-9"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Kositwattanarerk, W., Ong, S.S., and Oggier, F. (2013). Wiretap encoding of lattices from number fields using codes over Fp. 2013 IEEE International Symposium on Information Theory, IEEE.","DOI":"10.1109\/ISIT.2013.6620699"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1109\/TIT.2015.2416340","article-title":"Construction A of lattices over number fields and block fading wiretap coding","volume":"61","author":"Kositwattanarerk","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Belfiore, J.C., and Oggier, F. (2011). Lattice code design for the Rayleigh fading wiretap channel. 2011 IEEE International Conference on Communications Workshops (ICC), IEEE.","DOI":"10.1109\/iccw.2011.5963544"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Oggier, F., and Belfiore, J.C. (2013). Enabling multiplication in lattice codes via Construction A. 2013 IEEE Information Theory Workshop (ITW), IEEE.","DOI":"10.1109\/ITW.2013.6691274"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Hou, X., Lin, F., and Oggier, F. (2014). Construction and secrecy gain of a family of 5-modular lattices. 2014 IEEE Information Theory Workshop (ITW), IEEE.","DOI":"10.1109\/ITW.2014.6970804"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"719","DOI":"10.3934\/amc.2017053","article-title":"Modular lattices from a variation of Construction A over number fields","volume":"11","author":"Hou","year":"2017","journal-title":"Adv. Math. Commun."},{"key":"ref_54","first-page":"227","article-title":"S\u00e9ries th\u00eata des formes quadratiques ind\u00e9finies","volume":"Volume 627","year":"1977","journal-title":"S\u00e9minaire Delange\u2013Pisot\u2013Poitou, Th\u00e9orie des Nombres"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"3927","DOI":"10.1007\/s00029-018-0444-9","article-title":"Indefinite theta series and generalized error functions","volume":"24","author":"Alexandrov","year":"2018","journal-title":"Sel. Math."},{"key":"ref_56","unstructured":"Zwegers, S.P. (2002). Mock Theta Functions. [Ph.D. Thesis, Utrecht University]."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jnth.1998.2306","article-title":"The shadow theory of modular and unimodular lattices","volume":"73","author":"Rains","year":"1998","journal-title":"J. Number Theory"},{"key":"ref_58","first-page":"265","article-title":"On theta series attached to maximal lattices and their adjoints","volume":"3","author":"Nebe","year":"2009","journal-title":"J. Ramanujan Math. Soc."},{"key":"ref_59","first-page":"2135","article-title":"Wire-tap channel II","volume":"63","author":"Ozarow","year":"1984","journal-title":"Bell Syst. Tech. J."},{"key":"ref_60","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"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TCOMM.2016.2633343","article-title":"Practical Encoder and Decoder for Power Constrained QC LDPC-Lattice Codes","volume":"65","author":"Khodaiemehr","year":"2017","journal-title":"IEEE Trans. Commun."},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Lin, F., Ling, C., and Belfiore, J.C. (2014). Secrecy gain, flatness factor, and secrecy-goodness of even unimodular lattices. 2014 IEEE International Symposium on Information Theory, IEEE.","DOI":"10.1109\/ISIT.2014.6874977"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Stewart, I.N., and Tall, D.O. (1979). Algebraic Number Theory, Chapman and Hall.","DOI":"10.1007\/978-1-4615-6412-6"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Lang, S. (1994). Algebraic Number Theory, Springer.","DOI":"10.1007\/978-1-4612-0853-2"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Narkiewicz, W. (2004). Elementary and Analytic Theory of Algebraic Numbers, Springer. Springer Monographs in Mathematics.","DOI":"10.1007\/978-3-662-07001-7"},{"key":"ref_66","unstructured":"Conrad, K. (2026, February 11). Cyclotomic Extensions. Available online: https:\/\/kconrad.math.uconn.edu\/blurbs\/galoistheory\/cyclotomic.pdf."},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Washington, L.C. (1997). Introduction to Cyclotomic Fields, Volume 83 of Graduate Texts in Mathematics, Springer Science & Business Media.","DOI":"10.1007\/978-1-4612-1934-7"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1142\/S0219498803000611","article-title":"The discriminant of subfields of Q(\u03b62r)","volume":"2","author":"Lopes","year":"2003","journal-title":"J. Algebra Its Appl."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1006\/jnth.2002.2796","article-title":"On computing discriminants of subfields of Q(\u03b6pr)","volume":"96","author":"Interlando","year":"2002","journal-title":"J. Number Theory"},{"key":"ref_70","unstructured":"Samuel, P. (1971). Th\u00e9orie Alg\u00e9brique des Nombres, Hermann."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1109\/18.21245","article-title":"Coset codes-Part I: Introduction and geometrical classification","volume":"34","author":"Forney","year":"1988","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"73","DOI":"10.5802\/jtnb.347","article-title":"2-modular lattices from ternary codes","volume":"14","author":"Chapman","year":"2002","journal-title":"J. Th\u00e9orie Nombres Bordx."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0195-6698(03)00098-2","article-title":"Eisenstein lattices, Galois rings, and theta series","volume":"25","author":"Chua","year":"2004","journal-title":"Eur. J. Comb."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1006\/jcta.1996.2763","article-title":"Applications of coding theory to the construction of modular lattices","volume":"78","author":"Bachoc","year":"1997","journal-title":"J. Comb. Theory Ser. A"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0021-8693(78)90266-1","article-title":"Codes over GF(4) and complex lattices","volume":"52","author":"Sloane","year":"1978","journal-title":"J. Algebra"},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0097-3165(82)90019-X","article-title":"Self-dual codes over GF(5)","volume":"32","author":"Leon","year":"1982","journal-title":"J. Comb. Theory Ser. A"},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(72)90021-0","article-title":"On weights in quadratic-residue codes","volume":"3","author":"Assmus","year":"1972","journal-title":"Discret. Math."},{"key":"ref_78","unstructured":"MacWilliams, F.J., and Sloane, N.J.A. (1977). The Theory of Error-Correcting Codes, North-Holland."},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"273","DOI":"10.5802\/jtnb.279","article-title":"Cyclotomic modular lattices","volume":"12","year":"2000","journal-title":"J. Th\u00e9orie Nombres Bordx."},{"key":"ref_80","doi-asserted-by":"crossref","unstructured":"Khodaiemehr, H., Panario, D., and Sadeghi, M.R. (2018). Modular Construction A Lattices from Cyclotomic Fields and their Applications in Information Security. 2018 15th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC), IEEE.","DOI":"10.1109\/ISCISC.2018.8546855"},{"key":"ref_81","unstructured":"Conrad, K. (2026, February 11). History of Class Field Theory. Available online: https:\/\/www.math.uconn.edu\/~kconrad\/blurbs\/gradnumthy\/cfthistory.pdf."},{"key":"ref_82","unstructured":"Milne, J. (2026, February 11). Class Field Theory, Version 4.02. Available online: https:\/\/www.jmilne.org\/math\/CourseNotes\/CFT.pdf."},{"key":"ref_83","unstructured":"Shemanske, T.R. (2026, February 11). An Overview of Class Field Theory. Available online: https:\/\/math.dartmouth.edu\/~trs\/expository-papers\/CFT.pdf."},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"Ireland, K., and Rosen, M. (1990). A Classical Introduction to Modern Number Theory, Springer. [2nd ed.].","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/10586458.1995.10504319","article-title":"Computations of cyclotomic lattices","volume":"4","author":"Batut","year":"1995","journal-title":"Exp. Math."},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Bayer-Fluckiger, E. (2002). Ideal lattices. A Panorama of Number Theory or the View from Bakers Garden, Cambridge University Press.","DOI":"10.1017\/CBO9780511542961.012"},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.jnt.2004.10.005","article-title":"Modular lattices over cyclotomic fields","volume":"114","author":"Suarez","year":"2005","journal-title":"J. Number Theory"},{"key":"ref_88","doi-asserted-by":"crossref","unstructured":"Apostol, T.M. (1977). Modular Functions and Dirichlet Series in Number Theory, Springer.","DOI":"10.1007\/978-1-4684-9910-0"},{"key":"ref_89","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","article-title":"The Magma algebra system. I. The user language","volume":"24","author":"Bosma","year":"1997","journal-title":"J. Symb. Comput."},{"key":"ref_90","unstructured":"Wolfram Research Inc. (2010). Mathematica, Wolfram Research Inc.. version 8.0."},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"1901","DOI":"10.1109\/OJCOMS.2021.3103735","article-title":"Physical-Layer Security in 6G Networks","volume":"2","author":"Mucchi","year":"2021","journal-title":"IEEE Open J. Commun. Soc."},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"4801","DOI":"10.1109\/ACCESS.2023.3344654","article-title":"Physical Layer Security With Near-Field Beamforming","volume":"12","author":"Ferreira","year":"2024","journal-title":"IEEE Access"},{"key":"ref_93","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/PIMRC54779.2022.9978125","article-title":"Physical Layer Security in Spherical-Wave Channel Using Massive MIMO","volume":"Volume 33","author":"Yu","year":"2022","journal-title":"2022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)"},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"4553","DOI":"10.1109\/TVT.2022.3221866","article-title":"Massive MIMO and Secrecy Guard Zone Based Improving Physical Layer Security in UAV-Enabled uRLLC Networks","volume":"72","author":"Ji","year":"2023","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_95","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":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_96","doi-asserted-by":"crossref","first-page":"4724","DOI":"10.1109\/TCOMM.2018.2837132","article-title":"Cell-free massive MIMO networks: Optimal power control against active eavesdropping","volume":"66","author":"Hoang","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_97","doi-asserted-by":"crossref","first-page":"18788","DOI":"10.1109\/TWC.2024.3476485","article-title":"Enhancing secrecy in hardware-impaired cell-free massive MIMO by RSMA","volume":"23","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_98","doi-asserted-by":"crossref","unstructured":"Mirghasemi, H., and Belfiore, J.C. (2015). Lattice code design criterion for MIMO wiretap channels. 2015 IEEE Information Theory Workshop (ITW), IEEE.","DOI":"10.1109\/ITWF.2015.7360779"},{"key":"ref_99","doi-asserted-by":"crossref","first-page":"3167","DOI":"10.1109\/LWC.2024.3457158","article-title":"Secure Nested Lattices for MIMO Broadcast Channel with Confidential Messages","volume":"13","author":"Wang","year":"2024","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_100","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/TIT.2004.828067","article-title":"Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels","volume":"50","author":"Gamal","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_101","doi-asserted-by":"crossref","unstructured":"Abughalwa, M., Nguyen, D.N., Hoang, D.T., and Dutkiewicz, E. (2024). Multi-user secrecy rate maximization in IRS-aided systems. GLOBECOM 2024\u20142024 IEEE Global Communications Conference, IEEE.","DOI":"10.1109\/GLOBECOM52923.2024.10901599"},{"key":"ref_102","doi-asserted-by":"crossref","first-page":"10404","DOI":"10.1109\/TCE.2025.3597084","article-title":"Enhancing Security in Near-Field RIS Communications Assisted by UAV","volume":"71","author":"Haq","year":"2025","journal-title":"IEEE Trans. Consum. Electron."},{"key":"ref_103","first-page":"7079","article-title":"Secrecy Performance Analysis of RIS-Aided Communication System with Randomly Flying Eavesdroppers","volume":"71","author":"Wei","year":"2023","journal-title":"IEEE Trans. Commun."},{"key":"ref_104","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1109\/TCOMM.2021.3136563","article-title":"IRS-Assisted Secure UAV Transmission via Joint Trajectory and Beamforming Design","volume":"70","author":"Pang","year":"2022","journal-title":"IEEE Trans. Commun."},{"key":"ref_105","doi-asserted-by":"crossref","first-page":"54808","DOI":"10.1109\/ACCESS.2025.3553540","article-title":"Secrecy Capacity and Efficiency Outage Analysis of Cooperative PHY-Secure Wireless Systems and Secrecy Capacity-Based RIS Design","volume":"13","author":"Jain","year":"2025","journal-title":"IEEE Access"},{"key":"ref_106","doi-asserted-by":"crossref","unstructured":"Rasheed, I., and Mostafa, H. (2025). EP-SeaAKA: Enhanced Privacy-Preserving Quantum-Resistant Authentication and Key Agreement for RIS-assisted 6G Networks. IEEE Commun. Lett.","DOI":"10.1109\/LCOMM.2025.3599193"},{"key":"ref_107","doi-asserted-by":"crossref","first-page":"111037","DOI":"10.1109\/ACCESS.2025.3583557","article-title":"Integrated WHT-and DFT-based Multiuser Massive MIMO System for Secure RIS-enabled mmWave Communications","volume":"13","author":"Hossain","year":"2025","journal-title":"IEEE Access"},{"key":"ref_108","first-page":"3451","article-title":"RIS-Aided Cell-Free Massive MIMO Systems for 6G: Fundamentals, System Design, and Applications","volume":"72","author":"Shi","year":"2024","journal-title":"IEEE Trans. Commun."},{"key":"ref_109","doi-asserted-by":"crossref","first-page":"26042","DOI":"10.1109\/JIOT.2025.3553176","article-title":"Efficient Optimization in RIS-Assisted UAV System Using Deep Reinforcement Learning for mmWave-NOMA 6G Communications","volume":"12","author":"Nouri","year":"2025","journal-title":"IEEE Internet Things J."},{"key":"ref_110","doi-asserted-by":"crossref","unstructured":"Corlay, V., Boutros, J.J., Ciblat, P., and Brunel, L. (2018). Neural Lattice Decoders. 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), IEEE.","DOI":"10.1109\/GlobalSIP.2018.8646560"},{"key":"ref_111","doi-asserted-by":"crossref","unstructured":"Sadeghi, M.R., Amirzade, F., Panario, D., and Sakzad, A. (2018). A Neural Network Lattice Decoding Algorithm. 2018 IEEE Information Theory Workshop (ITW), IEEE.","DOI":"10.1109\/ITW.2018.8613440"},{"key":"ref_112","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1109\/TDSC.2023.3288228","article-title":"Dynamic range query privacy-preserving scheme for blockchain-enhanced smart grid based on lattice","volume":"21","author":"Li","year":"2023","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_113","doi-asserted-by":"crossref","first-page":"128048","DOI":"10.1109\/ACCESS.2025.3591009","article-title":"Reinforcement Learning-Driven Secrecy Energy Efficiency Maximization in RIS-Enabled Communication Systems","volume":"13","author":"Sarhan","year":"2025","journal-title":"IEEE Access"},{"key":"ref_114","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1109\/COMST.2024.3486690","article-title":"Privacy-Preserving Data-Driven Learning Models for Emerging Communication Networks: A Comprehensive Survey","volume":"27","author":"Fouda","year":"2025","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_115","doi-asserted-by":"crossref","first-page":"1908","DOI":"10.1109\/JSAC.2025.3560012","article-title":"Decentralized Federated Graph Learning With Lightweight Zero Trust Architecture for Next-Generation Networking Security","volume":"43","author":"Zhou","year":"2025","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/235\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T10:37:03Z","timestamp":1772102223000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/28\/2\/235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,18]]},"references-count":115,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["e28020235"],"URL":"https:\/\/doi.org\/10.3390\/e28020235","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,18]]}}}