{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:46:05Z","timestamp":1760132765632,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T00:00:00Z","timestamp":1697500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1910812"],"award-info":[{"award-number":["1910812"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Nested linear coding is a widely used technique in wireless communication systems for improving both security and reliability. Some parameters, such as the relative generalized Hamming weight and the relative dimension\/length profile, can be used to characterize the performance of nested linear codes. In addition, the rank properties of generator and parity-check matrices can also precisely characterize their security performance. Despite this, finding optimal nested linear secrecy codes remains a challenge in the finite-blocklength regime, often requiring brute-force search methods. This paper investigates the properties of nested linear codes, introduces a new representation of the relative generalized Hamming weight, and proposes a novel method for finding the best nested linear secrecy code for the binary erasure wiretap channel by working from the worst nested linear secrecy code in the dual space. We demonstrate that our algorithm significantly outperforms the brute-force technique in terms of speed and efficiency.<\/jats:p>","DOI":"10.3390\/e25101456","type":"journal-article","created":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T08:08:33Z","timestamp":1697530113000},"page":"1456","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing Finite-Blocklength Nested Linear Secrecy Codes: Using the Worst Code to Find the Best Code"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4152-0163","authenticated-orcid":false,"given":"Morteza","family":"Shoushtari","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT 84602, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9375-9440","authenticated-orcid":false,"given":"Willie","family":"Harrison","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT 84602, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,10,17]]},"reference":[{"key":"ref_1","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_2","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_3","doi-asserted-by":"crossref","first-page":"2135","DOI":"10.1002\/j.1538-7305.1984.tb00072.x","article-title":"Wire-tap channel II","volume":"63","author":"Ozarow","year":"1984","journal-title":"AT&T Bell Lab. Tech. J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/JSAC.2015.2504275","article-title":"Polar Coding for the General Wiretap Channel With Extensions to Multiuser Scenarios","volume":"34","author":"Wei","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Harrison, W.K., and Shoushtari, M. (2021, January 21\u201323). On Caching with Finite Blocklength Coding for Secrecy over the Binary Erasure Wiretap Channel. Proceedings of the Wireless Telecommunications Symposium (WTS), San Francisco, CA, USA.","DOI":"10.1109\/WTS51064.2021.9433710"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Shoushtari, M., Arabian, F., and Harrison, W.K. (2023, January 12\u201313). On the Crucial Role of Information Theory in the Metaverse. Proceedings of the 2023 Intermountain Engineering, Technology and Computing (IETC), Provo, UT, USA.","DOI":"10.1109\/IETC57902.2023.10152191"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Sheng, Z., Tuan, H.D., Nasir, A.A., and Poor, H.V. (2020, January 7\u201311). PLS for Wireless Interference Networks in the Short Blocklength Regime with Strong Wiretap Channels. Proceedings of the IEEE Global Communications Conference, Taipei, Taiwan.","DOI":"10.1109\/GLOBECOM42002.2020.9348037"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Yang, W., Schaefer, R.F., and Poor, H.V. (2016, January 10\u201315). Finite-blocklength bounds for wiretap channels. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541867"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Taleb, K., and Benammar, M. (2021, January 12\u201320). On the information leakage of finite block-length wiretap polar codes. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Virtual Event.","DOI":"10.1109\/ISIT45174.2021.9518180"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Harrison, W.K., and Bloch, M.R. (2019, January 7\u201312). Attributes of Generators for Best Finite Blocklength Coset Wiretap Codes over Erasure Channels. Proceedings of the International Symposium on Information Theory (ISIT), Paris, France.","DOI":"10.1109\/ISIT.2019.8849625"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2267","DOI":"10.1109\/TIT.2018.2798669","article-title":"Achievable Rate Region for Three User Discrete Broadcast Channel Based on Coset Codes","volume":"64","author":"Padakandla","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Shoushtari, M., and Harrison, W. (2021, January 25\u201328). Secrecy coding in the integrated network enhanced telemetry (iNET). Proceedings of the International Telemetering Conference (ITC), International Foundation for Telemetering, Las Vegas, NV, USA.","DOI":"10.36227\/techrxiv.16608718.v1"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/MSP.2013.2265141","article-title":"Coding for Secrecy: An Overview of Error-Control Coding Techniques for Physical-Layer Security","volume":"30","author":"Harrison","year":"2013","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_14","unstructured":"Shoushtari, M., Arabian, F., and Harrison, W.K. (2022, January 25\u201328). Post-Quantum Cryptography Based on Codes: A Game Changer for Secrecy in Aeronautical Mobile Telemetry. Proceedings of the International Telemetering Conference (ITC), International Foundation for Telemetering, Phoenix, AZ, USA."},{"key":"ref_15","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":"ref_16","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/TIT.2004.842763","article-title":"Some new characters on the wire-tap channel of type II","volume":"51","author":"Luo","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Liu, R., Liang, Y., Poor, H.V., and Spasojevic, P. (2007, January 1\u20136). Secure Nested Codes for Type II Wiretap Channels. Proceedings of the IEEE Information Theory Workshop (ITW), Solstrand, Norway.","DOI":"10.1109\/ITW.2007.4313097"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2933","DOI":"10.1109\/TIT.2007.901143","article-title":"Applications of LDPC Codes to the Wiretap Channel","volume":"53","author":"Thangaraj","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1109\/18.133259","article-title":"Generalized Hamming weights for linear codes","volume":"37","author":"Wei","year":"1991","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1109\/18.340452","article-title":"Dimension\/length profiles and trellis complexity of linear block codes","volume":"40","author":"Forney","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/18.651015","article-title":"Generalized Hamming weights of q-ary Reed-Muller codes","volume":"44","author":"Heijnen","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/18.567718","article-title":"On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two","volume":"43","author":"Cheng","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/18.135653","article-title":"On the generalized Hamming weights of several classes of cyclic cods","volume":"38","author":"Feng","year":"1992","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Rajaraman, V., and Thangaraj, A. (2010, January 29\u201331). EG-LDPC codes for the erasure wiretap channel. Proceedings of the National Conference on Communications (NCC), Chennai, India.","DOI":"10.1109\/NCC.2010.5430240"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"5930","DOI":"10.1109\/TIT.2014.2343993","article-title":"New Lower Bounds on the Generalized Hamming Weights of AG Codes","volume":"60","author":"Lee","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"4905","DOI":"10.1109\/TIT.2015.2444013","article-title":"Generalized Hamming Weights of Irreducible Cyclic Codes","volume":"61","author":"Yang","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2067","DOI":"10.1587\/transfun.E95.A.2067","article-title":"Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight","volume":"E95.A","author":"Kurihara","year":"2012","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Al-Hassan, S., Ahmed, M., and Tomlinson, M. (2014, January 15\u201319). Extension of the parity check matrix to construct the best equivocation codes for syndrome coding. Proceedings of the Global Information Infrastructure and Networking Symposium (GIIS), Montreal, QC, Canada.","DOI":"10.1109\/GIIS.2014.6934260"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Harrison, W.K., and Bloch, M.R. (2018, January 2\u20135). On Dual Relationships of Secrecy Codes. Proceedings of the Allerton Conf. Communication, Control, Computing, Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2018.8635841"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Shoushtari, M., and Harrison, W.K. (2021, January 17\u201321). New Dual Relationships for Error-Correcting Wiretap Codes. Proceedings of the IEEE Information Theory Workshop (ITW), Kanazawa, Japan.","DOI":"10.1109\/ITW48936.2021.9611443"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Richardson, T., and Urbanke, R. (2008). Modern Coding Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511791338"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Pfister, J., Gomes, M.A.C., Vilela, J.P., and Harrison, W.K. (2017, January 21\u201325). Quantifying equivocation for finite blocklength wiretap codes. Proceedings of the IEEE International Conference on Communications (ICC), Paris, France.","DOI":"10.1109\/ICC.2017.7996925"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2687","DOI":"10.1109\/LCOMM.2020.3018686","article-title":"Exact Equivocation Expressions for Wiretap Coding Over Erasure Channel Models","volume":"24","author":"Harrison","year":"2020","journal-title":"IEEE Commun. Lett."},{"key":"ref_34","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley-Interscience. [2nd ed.]."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/10\/1456\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:08:15Z","timestamp":1760130495000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/10\/1456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,17]]},"references-count":34,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2023,10]]}},"alternative-id":["e25101456"],"URL":"https:\/\/doi.org\/10.3390\/e25101456","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,10,17]]}}}