{"id":"https://openalex.org/W3216271775","doi":"https://doi.org/10.1109/itw48936.2021.9611443","title":"New Dual Relationships for Error-Correcting Wiretap Codes","display_name":"New Dual Relationships for Error-Correcting Wiretap Codes","publication_year":2021,"publication_date":"2021-10-17","ids":{"openalex":"https://openalex.org/W3216271775","doi":"https://doi.org/10.1109/itw48936.2021.9611443","mag":"3216271775"},"language":"en","primary_location":{"id":"doi:10.1109/itw48936.2021.9611443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT, 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 K. Harrison","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT, USA","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049419980"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.4585,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66772652,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"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/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/equivocation","display_name":"Equivocation","score":0.883912205696106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6486478447914124},{"id":"https://openalex.org/keywords/coset","display_name":"Coset","score":0.5722876787185669},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5127378702163696},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4928598403930664},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.48046058416366577},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47223684191703796},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.4663509428501129},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4381575584411621},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4044334888458252},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2784041166305542},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23793858289718628},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.15757933259010315},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.12165823578834534}],"concepts":[{"id":"https://openalex.org/C17859611","wikidata":"https://www.wikidata.org/wiki/Q10797615","display_name":"Equivocation","level":2,"score":0.883912205696106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6486478447914124},{"id":"https://openalex.org/C85307737","wikidata":"https://www.wikidata.org/wiki/Q751969","display_name":"Coset","level":2,"score":0.5722876787185669},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5127378702163696},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4928598403930664},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.48046058416366577},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47223684191703796},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.4663509428501129},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4381575584411621},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4044334888458252},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2784041166305542},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23793858289718628},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.15757933259010315},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.12165823578834534},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw48936.2021.9611443","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W949353694","https://openalex.org/W1536930200","https://openalex.org/W1553965766","https://openalex.org/W2043769961","https://openalex.org/W2044126357","https://openalex.org/W2045008027","https://openalex.org/W2056327536","https://openalex.org/W2062612962","https://openalex.org/W2108233162","https://openalex.org/W2124602541","https://openalex.org/W2127558904","https://openalex.org/W2143439424","https://openalex.org/W2211831180","https://openalex.org/W2582151064","https://openalex.org/W2912183452","https://openalex.org/W2914714618","https://openalex.org/W2976127079","https://openalex.org/W3081299694","https://openalex.org/W3123299285"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2140357074","https://openalex.org/W2002203372","https://openalex.org/W2113562070","https://openalex.org/W2810502498","https://openalex.org/W2743670993","https://openalex.org/W2028268383","https://openalex.org/W2809708642"],"abstract_inverted_index":{"In":[0,69,117],"this":[1,118],"paper,":[2,119],"we":[3,120],"consider":[4],"the":[5,23,39,51,55,66,76,102,127,148,158,161,172,176,190,201,213,219],"equivocation":[6,24,79,162,173,191],"of":[7,22,78,92,160,175,192,223],"finite":[8,207],"blocklength":[9,208],"coset":[10,95,143,229],"codes":[11,28,96,144,193,225],"when":[12,140],"used":[13,146],"over":[14,231],"binary":[15,56],"erasure":[16,57],"wiretap":[17,58,98],"channels.":[18,234],"We":[19],"make":[20],"use":[21],"matrix":[25,163,174],"in":[26,50,197],"comparing":[27],"that":[29,70,138,157,216],"are":[30,145,168],"suitable":[31],"for":[32,37,54,65,81,97,126,147,164,203,226],"scenarios":[33],"with":[34,61],"noisy":[35,110,149],"channels":[36,99,112],"both":[38],"intended":[40,67],"receiver":[41],"and":[42,84,107,132,194],"an":[43,72],"eavesdropper.":[44],"Equivocation":[45],"matrices":[46,80],"have":[47],"been":[48],"studied":[49],"past":[52],"only":[53,100],"channel":[59,64,105,130,151],"model":[60],"a":[62,82,122,134,165],"noiseless":[63,128],"recipient.":[68],"case,":[71,106,131],"exact":[73],"relationship":[74,137],"between":[75],"elements":[77,159],"code":[83,87,167,178],"its":[85],"dual":[86,136,166,224],"was":[88],"identified.":[89],"The":[90,153],"majority":[91],"work":[93,215],"on":[94],"addresses":[101],"noise-free":[103],"main":[104,111,129,150,233],"extensions":[108],"to":[109,180,188],"require":[113],"multi-edge":[114],"type":[115,142,228],"codes.":[116,209],"supply":[121],"more":[123],"insightful":[124],"proof":[125],"identify":[133],"new":[135],"applies":[139],"two-edge":[141,227],"case.":[152],"end":[154],"result":[155],"is":[156,212],"known":[169],"precisely":[170],"from":[171],"original":[177],"according":[179],"fixed":[181],"reordering":[182],"patterns.":[183],"Such":[184],"relationships":[185],"allow":[186],"one":[187],"study":[189],"their":[195],"duals":[196],"tandem,":[198],"which":[199],"simplifies":[200],"search":[202],"best":[204],"and/or":[205],"good":[206],"This":[210],"paper":[211],"first":[214],"succinctly":[217],"links":[218],"equivocation/error":[220],"correction":[221],"capabilities":[222],"coding":[230],"erasure-prone":[232]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
