{"id":"https://openalex.org/W4387706016","doi":"https://doi.org/10.3390/e25101456","title":"Optimizing Finite-Blocklength Nested Linear Secrecy Codes: Using the Worst Code to Find the Best Code","display_name":"Optimizing Finite-Blocklength Nested Linear Secrecy Codes: Using the Worst Code to Find the Best Code","publication_year":2023,"publication_date":"2023-10-17","ids":{"openalex":"https://openalex.org/W4387706016","doi":"https://doi.org/10.3390/e25101456","pmid":"https://pubmed.ncbi.nlm.nih.gov/37895576"},"language":"en","primary_location":{"id":"doi:10.3390/e25101456","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/e25101456","pdf_url":"https://www.mdpi.com/1099-4300/25/10/1456/pdf?version=1697528866","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1099-4300/25/10/1456/pdf?version=1697528866","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049419980","display_name":"Morteza Shoushtari","orcid":"https://orcid.org/0000-0002-4152-0163"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Morteza Shoushtari","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT 84602, USA"],"raw_orcid":"https://orcid.org/0000-0002-4152-0163","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT 84602, USA","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042317703","display_name":"Willie K. Harrison","orcid":"https://orcid.org/0000-0002-9375-9440"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Willie Harrison","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT 84602, USA"],"raw_orcid":"https://orcid.org/0000-0002-9375-9440","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT 84602, USA","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049419980"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":{"value":2000,"currency":"CHF","value_usd":2227},"apc_paid":{"value":2000,"currency":"CHF","value_usd":2227},"fwci":0.083,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.35388583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"25","issue":"10","first_page":"1456","last_page":"1456"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.6547988057136536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5985429883003235},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5836061835289001},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5646904706954956},{"id":"https://openalex.org/keywords/generator-matrix","display_name":"Generator matrix","score":0.45461899042129517},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.4472702741622925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.436772882938385},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4136177897453308},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4035758376121521},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.37994059920310974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3549652695655823},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.24294176697731018},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.18398374319076538},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.1370605230331421},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1022317111492157}],"concepts":[{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6547988057136536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5985429883003235},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5836061835289001},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5646904706954956},{"id":"https://openalex.org/C1842014","wikidata":"https://www.wikidata.org/wiki/Q1502046","display_name":"Generator matrix","level":3,"score":0.45461899042129517},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.4472702741622925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.436772882938385},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4136177897453308},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4035758376121521},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.37994059920310974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3549652695655823},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.24294176697731018},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.18398374319076538},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.1370605230331421},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1022317111492157},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.3390/e25101456","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/e25101456","pdf_url":"https://www.mdpi.com/1099-4300/25/10/1456/pdf?version=1697528866","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},{"id":"pmid:37895576","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/37895576","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy (Basel, Switzerland)","raw_type":null},{"id":"pmh:oai:pubmedcentral.nih.gov:10606228","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/10606228","pdf_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC10606228/pdf/entropy-25-01456.pdf","source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy (Basel)","raw_type":"Text"},{"id":"pmh:oai:doaj.org/article:1c771c39b4d5429da2c28ea417ccff88","is_oa":true,"landing_page_url":"https://doaj.org/article/1c771c39b4d5429da2c28ea417ccff88","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy, Vol 25, Iss 10, p 1456 (2023)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1099-4300/25/10/1456/","is_oa":true,"landing_page_url":"https://doi.org/10.3390/e25101456","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Entropy","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/e25101456","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/e25101456","pdf_url":"https://www.mdpi.com/1099-4300/25/10/1456/pdf?version=1697528866","source":{"id":"https://openalex.org/S195231649","display_name":"Entropy","issn_l":"1099-4300","issn":["1099-4300"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Entropy","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4505975952","display_name":"CIF: Small: Best Wiretap Codes for Real-world Physical-layer Security","funder_award_id":"1910812","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4387706016.pdf"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1969564787","https://openalex.org/W1973992189","https://openalex.org/W2043769961","https://openalex.org/W2045008027","https://openalex.org/W2062612962","https://openalex.org/W2078577886","https://openalex.org/W2097117337","https://openalex.org/W2106990489","https://openalex.org/W2111616448","https://openalex.org/W2111992817","https://openalex.org/W2120258386","https://openalex.org/W2124602541","https://openalex.org/W2127558904","https://openalex.org/W2133693898","https://openalex.org/W2144007657","https://openalex.org/W2173495775","https://openalex.org/W2249729912","https://openalex.org/W2582151064","https://openalex.org/W2792065030","https://openalex.org/W2912183452","https://openalex.org/W2914714618","https://openalex.org/W2963154570","https://openalex.org/W2963905861","https://openalex.org/W2976127079","https://openalex.org/W3081299694","https://openalex.org/W3132309366","https://openalex.org/W3165126682","https://openalex.org/W3197853773","https://openalex.org/W3200781720","https://openalex.org/W3216271775","https://openalex.org/W4381331932","https://openalex.org/W7014537374"],"related_works":["https://openalex.org/W2156055959","https://openalex.org/W1525070854","https://openalex.org/W2099549796","https://openalex.org/W2052380558","https://openalex.org/W2353665447","https://openalex.org/W2392521644","https://openalex.org/W3107393399","https://openalex.org/W2255365279","https://openalex.org/W1760355913","https://openalex.org/W4231546626"],"abstract_inverted_index":{"Nested":[0],"linear":[1,41,65,87,109,124],"coding":[2],"is":[3],"a":[4,69,90,101],"widely":[5],"used":[6,34],"technique":[7,140],"in":[8,71,127,141],"wireless":[9],"communication":[10],"systems":[11],"for":[12,104,112],"improving":[13],"both":[14],"security":[15,58],"and":[16,27,50,99,145],"reliability.":[17],"Some":[18],"parameters,":[19],"such":[20],"as":[21],"the":[22,28,37,45,72,83,94,106,113,121,128,138],"relative":[23,29,95],"generalized":[24,96],"Hamming":[25,97],"weight":[26],"dimension/length":[30],"profile,":[31],"can":[32,53],"be":[33],"to":[35],"characterize":[36,56],"performance":[38],"of":[39,48,85,93,143],"nested":[40,64,86,108,123],"codes.":[42],"In":[43],"addition,":[44],"rank":[46],"properties":[47,84],"generator":[49],"parity-check":[51],"matrices":[52],"also":[54],"precisely":[55],"their":[57],"performance.":[59],"Despite":[60],"this,":[61],"finding":[62,105],"optimal":[63],"secrecy":[66,110,125],"codes":[67],"remains":[68],"challenge":[70],"finite-blocklength":[73],"regime,":[74],"often":[75],"requiring":[76],"brute-force":[77,139],"search":[78],"methods.":[79],"This":[80],"paper":[81],"investigates":[82],"codes,":[88],"introduces":[89],"new":[91],"representation":[92],"weight,":[98],"proposes":[100],"novel":[102],"method":[103],"best":[107],"code":[111,126],"binary":[114],"erasure":[115],"wiretap":[116],"channel":[117],"by":[118],"working":[119],"from":[120],"worst":[122],"dual":[129],"space.":[130],"We":[131],"demonstrate":[132],"that":[133],"our":[134],"algorithm":[135],"significantly":[136],"outperforms":[137],"terms":[142],"speed":[144],"efficiency.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}
