{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T10:11:38Z","timestamp":1766139098130,"version":"3.38.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"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":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3545301","type":"journal-article","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T18:46:10Z","timestamp":1740509170000},"page":"2450-2463","source":"Crossref","is-referenced-by-count":2,"title":["Secrecy Coding for the Binary Symmetric Wiretap Channel via Linear Programming"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8883-6926","authenticated-orcid":false,"given":"Ali","family":"Nikkhah","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, K. N. Toosi University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4152-0163","authenticated-orcid":false,"given":"Morteza","family":"Shoushtari","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3199-0161","authenticated-orcid":false,"given":"Bahareh","family":"Akhbari","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering, K. N. Toosi University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9375-9440","authenticated-orcid":false,"given":"Willie K.","family":"Harrison","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055892"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055917"},{"key":"ref6","first-page":"1","article-title":"Secrecy coding in the integrated network enhanced telemetry (iNET)","volume-title":"Proc. Int. Telemetering Conf. (ITC)","author":"Shoushtari"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2904968"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/WTS51064.2021.9433710"},{"key":"ref9","first-page":"1","article-title":"Post-quantum cryptography based on codes: A game changer for secrecy in aeronautical mobile telemetry","volume-title":"Proc. Int. Telemetering Conf. (ITC)","author":"Shoushtari"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2694-0_27"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611443"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1800181"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/e25101456"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3062755"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2024.3400601"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2265141"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2463678"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901143"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2148715"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASID.2016.7873916"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611479"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.08.100875"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592878"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162275"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/GIIS.2013.6684342"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996925"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3237259"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635841"},{"key":"ref30","first-page":"146","article-title":"On optimal finite-length binary codes of four codewords for binary symmetric channels","volume-title":"Proc. Int. Symp. Inf. Theory Appl. (ISITA)","author":"Dong"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2697427"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4376-z"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904500"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006906"},{"article-title":"Finite blocklength secrecy coding","year":"2018","author":"Pfister","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592770"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761418"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10902583.pdf?arnumber=10902583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T18:35:22Z","timestamp":1741372522000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10902583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3545301","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}