{"id":"https://openalex.org/W2912183452","doi":"https://doi.org/10.1109/allerton.2018.8635841","title":"On Dual Relationships of Secrecy Codes","display_name":"On Dual Relationships of Secrecy Codes","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2912183452","doi":"https://doi.org/10.1109/allerton.2018.8635841","mag":"2912183452"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2018.8635841","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8635841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"conference-paper","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/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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Brigham Young University, Provo, UT","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055689993","display_name":"Matthieu R. Bloch","orcid":"https://orcid.org/0000-0001-9315-9050"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]},{"id":"https://openalex.org/I4210089931","display_name":"Georgia Tech-CNRS Laboratory","ror":"https://ror.org/00avmbz91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1288283403","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I130701444","https://openalex.org/I4210089931","https://openalex.org/I4210095849","https://openalex.org/I4405256580","https://openalex.org/I90183372"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Matthieu R. Bloch","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA","Georgia Institute of Technology [Atlanta]","Georgia Tech Lorraine [Metz]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology [Atlanta]","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Tech Lorraine [Metz]","institution_ids":["https://openalex.org/I4210089931"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2861,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.95827993,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"366","last_page":"372"},"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/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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9987999796867371,"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/generator-matrix","display_name":"Generator matrix","score":0.7095260620117188},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6524165868759155},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.6183853149414062},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5630823373794556},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5423139333724976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4665828347206116},{"id":"https://openalex.org/keywords/equivocation","display_name":"Equivocation","score":0.4665600657463074},{"id":"https://openalex.org/keywords/information-theoretic-security","display_name":"Information-theoretic security","score":0.4588968753814697},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4558301568031311},{"id":"https://openalex.org/keywords/coset","display_name":"Coset","score":0.45325690507888794},{"id":"https://openalex.org/keywords/secrecy","display_name":"Secrecy","score":0.43755829334259033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4129164218902588},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3742715120315552},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2779849171638489},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.20944613218307495},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.19258472323417664}],"concepts":[{"id":"https://openalex.org/C1842014","wikidata":"https://www.wikidata.org/wiki/Q1502046","display_name":"Generator matrix","level":3,"score":0.7095260620117188},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6524165868759155},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6183853149414062},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5630823373794556},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5423139333724976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4665828347206116},{"id":"https://openalex.org/C17859611","wikidata":"https://www.wikidata.org/wiki/Q10797615","display_name":"Equivocation","level":2,"score":0.4665600657463074},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.4588968753814697},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4558301568031311},{"id":"https://openalex.org/C85307737","wikidata":"https://www.wikidata.org/wiki/Q751969","display_name":"Coset","level":2,"score":0.45325690507888794},{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.43755829334259033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4129164218902588},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3742715120315552},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2779849171638489},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.20944613218307495},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.19258472323417664},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2018.8635841","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8635841","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02443278v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02443278","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Oct 2018, Monticello, France. IEEE, pp.366-372, 2018, ⟨10.1109/ALLERTON.2018.8635841⟩","raw_type":"Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W58580312","https://openalex.org/W252932944","https://openalex.org/W949353694","https://openalex.org/W1553965766","https://openalex.org/W2029720112","https://openalex.org/W2043769961","https://openalex.org/W2044126357","https://openalex.org/W2062612962","https://openalex.org/W2124602541","https://openalex.org/W2127558904","https://openalex.org/W2128153585","https://openalex.org/W2144007657","https://openalex.org/W2273078522","https://openalex.org/W2289891760","https://openalex.org/W2478708596","https://openalex.org/W2582151064","https://openalex.org/W2914714618","https://openalex.org/W2963877571","https://openalex.org/W4234572373","https://openalex.org/W6694492181"],"related_works":["https://openalex.org/W2145668821","https://openalex.org/W2151991716","https://openalex.org/W2147348113","https://openalex.org/W2154731600","https://openalex.org/W2160347734","https://openalex.org/W2052380558","https://openalex.org/W2099549796","https://openalex.org/W2007470205","https://openalex.org/W4297081108","https://openalex.org/W197063267"],"abstract_inverted_index":{"We":[0,22,60,102],"investigate":[1],"properties":[2],"of":[3,30,32,54,89],"finite":[4],"blocklength":[5,50],"codes":[6,37,47,69,80,90,108],"and":[7,51,74,106],"their":[8],"duals":[9],"when":[10,111],"used":[11,112],"for":[12,72,123],"coset":[13,120],"coding":[14,121],"over":[15,125],"the":[16,28,42,55,97,114,126],"binary":[17,64],"erasure":[18,58],"wiretap":[19],"channel":[20,57],"(BEWC).":[21],"identify":[23],"sufficient":[24],"conditions,":[25],"related":[26],"to":[27,40],"ranks":[29],"sub-matrices":[31],"a":[33,92,119],"generator":[34,98],"matrix":[35,99],"that":[36,63,78,104],"may":[38],"satisfy":[39],"achieve":[41],"maximum":[43,65],"equivocation":[44,86],"among":[45],"all":[46],"with":[48,91],"given":[49],"dimension,":[52],"irrespective":[53],"eavesdropper's":[56],"probability.":[59],"point":[61],"out":[62],"distance":[66],"separable":[67],"(MDS)":[68],"are":[70,109],"optimal":[71,110],"secrecy":[73,124],"we":[75],"also":[76],"show":[77],"simplex":[79,105],"(and":[81],"Hamming":[82,107],"codes)":[83],"have":[84],"higher":[85],"than":[87],"families":[88],"single":[93],"repeated":[94],"column":[95],"in":[96,118],"(parity-check":[100],"matrix).":[101],"conjecture":[103],"as":[113],"base":[115],"linear":[116],"code":[117],"scheme":[122],"BEWC.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}