{"id":"https://openalex.org/W4415366823","doi":"https://doi.org/10.1109/isit63088.2025.11195618","title":"Best Linear Wiretap Coset Codes Must Maximize Minimum Distance","display_name":"Best Linear Wiretap Coset Codes Must Maximize Minimum Distance","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415366823","doi":"https://doi.org/10.1109/isit63088.2025.11195618"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5105658113","display_name":"Andrew Swain","orcid":"https://orcid.org/0009-0000-0471-5407"},"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":"Andrew Swain","raw_affiliation_strings":["Brigham Young University,Department of Electrical and Computer Engineering,Provo,UT,USA"],"affiliations":[{"raw_affiliation_string":"Brigham Young University,Department of Electrical and Computer Engineering,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":["Brigham Young University,Department of Electrical and Computer Engineering,Provo,UT,USA"],"affiliations":[{"raw_affiliation_string":"Brigham Young University,Department of Electrical and Computer Engineering,Provo,UT,USA","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5105658113"],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.8194,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79934621,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9664000272750854,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9664000272750854,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9646999835968018,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9477999806404114,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.42309999465942383},{"id":"https://openalex.org/keywords/coset","display_name":"Coset","score":0.3912000060081482},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.3479999899864197},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.3416999876499176},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.32010000944137573}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4738999903202057},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4287000000476837},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.42309999465942383},{"id":"https://openalex.org/C85307737","wikidata":"https://www.wikidata.org/wiki/Q751969","display_name":"Coset","level":2,"score":0.3912000060081482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3905999958515167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37459999322891235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3571000099182129},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.26840001344680786},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195618","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W949353694","https://openalex.org/W1553965766","https://openalex.org/W2029720112","https://openalex.org/W2043769961","https://openalex.org/W2062612962","https://openalex.org/W2124602541","https://openalex.org/W2127558904","https://openalex.org/W2211831180","https://openalex.org/W2582151064","https://openalex.org/W2912183452","https://openalex.org/W2976127079","https://openalex.org/W3081299694"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}