{"id":"https://openalex.org/W4289655111","doi":"https://doi.org/10.1109/isit50566.2022.9834800","title":"On the Generalized Covering Radii of Reed-Muller Codes","display_name":"On the Generalized Covering Radii of Reed-Muller Codes","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655111","doi":"https://doi.org/10.1109/isit50566.2022.9834800"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834800","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/A5018957807","display_name":"Dor Elimelech","orcid":"https://orcid.org/0000-0002-9141-8669"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Dor Elimelech","raw_affiliation_strings":["Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061347472","display_name":"Hengjia Wei","orcid":"https://orcid.org/0000-0001-8136-1489"},"institutions":[{"id":"https://openalex.org/I4210136793","display_name":"Peng Cheng Laboratory","ror":"https://ror.org/03qdqbt06","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210136793"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hengjia Wei","raw_affiliation_strings":["Peng Cheng Laboratory,Shenzhen,China,518000"],"affiliations":[{"raw_affiliation_string":"Peng Cheng Laboratory,Shenzhen,China,518000","institution_ids":["https://openalex.org/I4210136793"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054043026","display_name":"Moshe Schwartz","orcid":"https://orcid.org/0000-0002-1449-0026"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Schwartz","raw_affiliation_strings":["Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev,Electrical and Computer Engineering,Beer Sheva,Israel,8410501","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018957807"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":0.2151,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.29575322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1749","last_page":"1754"},"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.9998000264167786,"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.9998000264167786,"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/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6586799621582031},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4634888470172882},{"id":"https://openalex.org/keywords/extreme-value-theory","display_name":"Extreme value theory","score":0.4302333891391754},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.4198182225227356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41817012429237366},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4124957323074341},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36186209321022034},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35729286074638367},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.28893613815307617},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2812756597995758},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12113520503044128},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08811157941818237}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6586799621582031},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4634888470172882},{"id":"https://openalex.org/C147581598","wikidata":"https://www.wikidata.org/wiki/Q729429","display_name":"Extreme value theory","level":2,"score":0.4302333891391754},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.4198182225227356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41817012429237366},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4124957323074341},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36186209321022034},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35729286074638367},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.28893613815307617},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2812756597995758},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12113520503044128},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08811157941818237}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834800","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/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W148590762","https://openalex.org/W1545614041","https://openalex.org/W1606480398","https://openalex.org/W1849282882","https://openalex.org/W1979853813","https://openalex.org/W2025123078","https://openalex.org/W2042588259","https://openalex.org/W2065404462","https://openalex.org/W2070729000","https://openalex.org/W2103387212","https://openalex.org/W2107415712","https://openalex.org/W2107899693","https://openalex.org/W2111194052","https://openalex.org/W2122045750","https://openalex.org/W2127558904","https://openalex.org/W2136435457","https://openalex.org/W2145819400","https://openalex.org/W2153589244","https://openalex.org/W2160136043","https://openalex.org/W2167026191","https://openalex.org/W2170147734","https://openalex.org/W2591190829","https://openalex.org/W3037718443","https://openalex.org/W3183871224","https://openalex.org/W3204834854","https://openalex.org/W3208419198","https://openalex.org/W4292717601","https://openalex.org/W6798460621","https://openalex.org/W6803084894"],"related_works":["https://openalex.org/W3045580795","https://openalex.org/W3021758908","https://openalex.org/W2293846540","https://openalex.org/W1511348214","https://openalex.org/W2041718794","https://openalex.org/W1976052006","https://openalex.org/W4386066307","https://openalex.org/W1998728561","https://openalex.org/W4248142543","https://openalex.org/W2579163092"],"abstract_inverted_index":{"We":[0,27],"study":[1],"generalized":[2,34],"covering":[3,35],"radii,":[4],"a":[5],"fundamental":[6],"property":[7],"of":[8,32,37],"linear":[9,21],"codes":[10,39],"that":[11],"characterizes":[12],"the":[13,29,33],"trade-off":[14],"between":[15],"storage,":[16],"latency,":[17],"and":[18,49],"access":[19],"in":[20,40,52],"data-query":[22],"protocols":[23],"such":[24],"as":[25,44,46],"PIR.":[26],"find":[28],"exact":[30],"value":[31],"radii":[36],"Reed-Muller":[38],"certain":[41],"extreme":[42],"cases,":[43],"well":[45],"proving":[47],"lower":[48],"upper":[50],"bounds":[51],"various":[53],"scenarios.":[54]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}