{"id":"https://openalex.org/W4401692225","doi":"https://doi.org/10.1109/isit57864.2024.10619536","title":"Non-Binary Covering Codes for Low-Access Computations","display_name":"Non-Binary Covering Codes for Low-Access Computations","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401692225","doi":"https://doi.org/10.1109/isit57864.2024.10619536"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 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/A5091221122","display_name":"Vinayak Ramkumar","orcid":"https://orcid.org/0000-0001-5223-5643"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Vinayak Ramkumar","raw_affiliation_strings":["Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048888817","display_name":"Netanel Raviv","orcid":"https://orcid.org/0000-0002-1686-1994"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Netanel Raviv","raw_affiliation_strings":["Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,MO,USA"],"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,MO,USA","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085150941","display_name":"Itzhak Tamo","orcid":"https://orcid.org/0000-0002-8000-0419"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Itzhak Tamo","raw_affiliation_strings":["Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091221122"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.0958,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78674068,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2772","last_page":"2777"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9987000226974487,"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.9987000226974487,"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.9973999857902527,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9961000084877014,"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/computer-science","display_name":"Computer science","score":0.6853268146514893},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.45472872257232666},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4365043044090271},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4204446077346802},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38921207189559937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2436310350894928},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15683671832084656},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14961129426956177}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6853268146514893},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.45472872257232666},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4365043044090271},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4204446077346802},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38921207189559937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2436310350894928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15683671832084656},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14961129426956177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2863868470","display_name":null,"funder_award_id":"852953","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W599939251","https://openalex.org/W2136319083","https://openalex.org/W2153535269","https://openalex.org/W2157562358","https://openalex.org/W2171921705","https://openalex.org/W2560674852","https://openalex.org/W2962850796","https://openalex.org/W3021481267","https://openalex.org/W3185166384","https://openalex.org/W4289655165","https://openalex.org/W4386057529","https://openalex.org/W4388675146","https://openalex.org/W4389072102","https://openalex.org/W4401692225"],"related_works":["https://openalex.org/W2134880816","https://openalex.org/W2111298487","https://openalex.org/W2055498716","https://openalex.org/W4386075138","https://openalex.org/W1984130439","https://openalex.org/W3016499519","https://openalex.org/W2371359060","https://openalex.org/W2562873141","https://openalex.org/W2510680828","https://openalex.org/W2141478371"],"abstract_inverted_index":{"Given":[0],"a":[1,5,17,32,54,63,67,87,92,105,134],"real":[2,58],"dataset":[3,15],"and":[4,12,121,140],"computation":[6,23],"family,":[7],"we":[8,40,116],"wish":[9],"to":[10,53,99,144],"encode":[11],"store":[13],"the":[14,25,43,49,75,113,126,145],"in":[16],"distributed":[18],"system":[19],"so":[20],"that":[21,69,124],"any":[22],"from":[24],"family":[26],"can":[27],"be":[28],"performed":[29],"by":[30],"accessing":[31],"small":[33],"number":[34],"of":[35,45,57],"nodes.":[36],"In":[37,91,112],"this":[38,95],"work,":[39,94],"focus":[41],"on":[42,74,82],"families":[44],"linear":[46],"computations":[47],"where":[48],"coefficients":[50],"are":[51],"restricted":[52],"finite":[55,101],"set":[56],"values.":[59],"For":[60],"two-valued":[61],"computations,":[62],"recent":[64],"work":[65],"presented":[66],"scheme":[68,79,96],"gives":[70],"good":[71],"feasible":[72],"points":[73],"access-redundancy":[76],"tradeoff.":[77,148],"This":[78],"is":[80],"based":[81],"binary":[83],"covering":[84,119],"codes":[85,120],"having":[86],"certain":[88],"closure":[89],"property.":[90],"follow-up":[93],"was":[97],"extended":[98],"all":[100],"coefficient":[102,110,130,137],"sets,":[103],"using":[104],"new":[106],"additive-combinatorics":[107],"notion":[108],"called":[109],"complexity.":[111],"present":[114],"paper,":[115],"explore":[117],"non-binary":[118],"develop":[122],"schemes":[123],"outperform":[125],"state-of-the-art":[127],"for":[128],"some":[129],"sets.":[131],"We":[132],"provide":[133],"more":[135],"general":[136],"complexity":[138],"definition":[139],"show":[141],"its":[142],"applicability":[143],"access-":[146],"redundancy":[147]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}