{"id":"https://openalex.org/W4289655028","doi":"https://doi.org/10.1109/isit50566.2022.9834735","title":"Subspace Decomposition of Extreme-Rate Secrecy Codes","display_name":"Subspace Decomposition of Extreme-Rate Secrecy Codes","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655028","doi":"https://doi.org/10.1109/isit50566.2022.9834735"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834735","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834735","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5026938106","display_name":"David Hunn","orcid":null},"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":"David Hunn","raw_affiliation_strings":["Brigham Young University,Department of Electrical and Computer Engineering,Provo,Utah,84602"],"affiliations":[{"raw_affiliation_string":"Brigham Young University,Department of Electrical and Computer Engineering,Provo,Utah,84602","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":["Brigham Young University,Department of Electrical and Computer Engineering,Provo,Utah,84602"],"affiliations":[{"raw_affiliation_string":"Brigham Young University,Department of Electrical and Computer Engineering,Provo,Utah,84602","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026938106"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0756396,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1235","last_page":"1240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998000264167786,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/code","display_name":"Code (set theory)","score":0.7159168720245361},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.6628457307815552},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5833581686019897},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5415525436401367},{"id":"https://openalex.org/keywords/generator-matrix","display_name":"Generator matrix","score":0.5264202952384949},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.49800944328308105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45644906163215637},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.437583863735199},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4338432550430298},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.41081470251083374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.352535218000412},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.23163071274757385},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2007465660572052},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.12198355793952942},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08405613899230957},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07454270124435425}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.7159168720245361},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.6628457307815552},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5833581686019897},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5415525436401367},{"id":"https://openalex.org/C1842014","wikidata":"https://www.wikidata.org/wiki/Q1502046","display_name":"Generator matrix","level":3,"score":0.5264202952384949},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.49800944328308105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45644906163215637},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.437583863735199},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4338432550430298},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.41081470251083374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.352535218000412},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.23163071274757385},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2007465660572052},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.12198355793952942},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08405613899230957},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07454270124435425},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834735","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834735","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"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":16,"referenced_works":["https://openalex.org/W182801106","https://openalex.org/W949353694","https://openalex.org/W1553965766","https://openalex.org/W2043769961","https://openalex.org/W2044126357","https://openalex.org/W2062612962","https://openalex.org/W2124602541","https://openalex.org/W2127558904","https://openalex.org/W2211831180","https://openalex.org/W2233598973","https://openalex.org/W2582151064","https://openalex.org/W2912183452","https://openalex.org/W2914714618","https://openalex.org/W2963183582","https://openalex.org/W2976127079","https://openalex.org/W3123299285"],"related_works":["https://openalex.org/W4247927056","https://openalex.org/W2131338819","https://openalex.org/W2052380558","https://openalex.org/W4237142313","https://openalex.org/W4288278449","https://openalex.org/W2966039054","https://openalex.org/W1487470402","https://openalex.org/W2099549796","https://openalex.org/W2974676816","https://openalex.org/W2373785022"],"abstract_inverted_index":{"The":[0],"performance":[1,27],"and":[2,16],"structure":[3],"of":[4,12,34,36,55],"wiretap":[5],"codes":[6],"are":[7],"analyzed":[8],"in":[9],"the":[10,32,37],"limit":[11],"large":[13],"code":[14,26,39,45],"size":[15],"very":[17,20],"low-":[18],"or":[19],"high-rate":[21],"codes.":[22],"Under":[23],"these":[24],"conditions,":[25],"may":[28],"be":[29,61],"calculated":[30],"using":[31],"properties":[33],"subspaces":[35],"available":[38],"space.":[40],"Using":[41],"this":[42],"technique,":[43],"a":[44,48,52],"defined":[46],"by":[47],"generator":[49],"matrix":[50],"with":[51],"uniform":[53],"distribution":[54],"nonzero":[56],"columns":[57],"is":[58],"proven":[59],"to":[60],"locally":[62],"optimal.":[63]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}