{"id":"https://openalex.org/W3196987148","doi":"https://doi.org/10.1109/isit45174.2021.9517809","title":"Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage","display_name":"Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3196987148","doi":"https://doi.org/10.1109/isit45174.2021.9517809","mag":"3196987148"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 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/A5068437513","display_name":"Francisco Maturana","orcid":"https://orcid.org/0000-0002-7532-8399"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Francisco Maturana","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA","Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109919225","display_name":"K. V. Rashmi","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. V. Rashmi","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA","Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068437513"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14807235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3002","last_page":"3007"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.994700014591217,"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.7191852927207947},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6471014022827148},{"id":"https://openalex.org/keywords/distributed-data-store","display_name":"Distributed data store","score":0.6117799878120422},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5744980573654175},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5352222919464111},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4821181297302246},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.45541974902153015},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.4296976327896118},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.42598482966423035},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4072182774543762},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38507336378097534},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3462560772895813},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2861994504928589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23170062899589539},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.15608695149421692},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08925026655197144}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7191852927207947},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6471014022827148},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.6117799878120422},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5744980573654175},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5352222919464111},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4821181297302246},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.45541974902153015},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.4296976327896118},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42598482966423035},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4072182774543762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38507336378097534},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3462560772895813},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2861994504928589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23170062899589539},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.15608695149421692},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08925026655197144},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit45174.2021.9517809","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4899946149","display_name":null,"funder_award_id":"CNS-1901410","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W51265332","https://openalex.org/W1441763937","https://openalex.org/W1515040589","https://openalex.org/W1531592115","https://openalex.org/W1625022824","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2001163076","https://openalex.org/W2022619326","https://openalex.org/W2048731384","https://openalex.org/W2048762830","https://openalex.org/W2050500290","https://openalex.org/W2052375105","https://openalex.org/W2055835320","https://openalex.org/W2056826630","https://openalex.org/W2062295219","https://openalex.org/W2069026918","https://openalex.org/W2086523507","https://openalex.org/W2104812861","https://openalex.org/W2105185344","https://openalex.org/W2109333427","https://openalex.org/W2126295689","https://openalex.org/W2132560739","https://openalex.org/W2134243579","https://openalex.org/W2137291643","https://openalex.org/W2139389739","https://openalex.org/W2147343704","https://openalex.org/W2150777202","https://openalex.org/W2151897964","https://openalex.org/W2154063365","https://openalex.org/W2166011389","https://openalex.org/W2167592273","https://openalex.org/W2167801604","https://openalex.org/W2383970358","https://openalex.org/W2606114015","https://openalex.org/W2625724326","https://openalex.org/W2740961148","https://openalex.org/W2745015092","https://openalex.org/W2784258310","https://openalex.org/W2789573885","https://openalex.org/W2963568514","https://openalex.org/W2963754880","https://openalex.org/W2963781977","https://openalex.org/W2970808367","https://openalex.org/W2976081876","https://openalex.org/W3011746500","https://openalex.org/W3081222034","https://openalex.org/W3100004208","https://openalex.org/W3100222086","https://openalex.org/W3100282565","https://openalex.org/W3101824114","https://openalex.org/W3106482607","https://openalex.org/W3137759927","https://openalex.org/W4237774489","https://openalex.org/W6602073716","https://openalex.org/W6680407667","https://openalex.org/W6741830073","https://openalex.org/W6775193826","https://openalex.org/W6785086341"],"related_works":["https://openalex.org/W2963163039","https://openalex.org/W2982181605","https://openalex.org/W3102119340","https://openalex.org/W2807749388","https://openalex.org/W2137028263","https://openalex.org/W2031335939","https://openalex.org/W1947543223","https://openalex.org/W2744779861","https://openalex.org/W2623177195","https://openalex.org/W4287065415"],"abstract_inverted_index":{"Distributed":[0],"storage":[1,80,122,169,198,218,254],"systems":[2],"typically":[3],"use":[4],"erasure":[5,14],"codes":[6,45,95,203,222,229,261],"to":[7,70,107,134,189,246,262],"provide":[8],"tolerance":[9],"against":[10],"node":[11],"failures.":[12],"An":[13],"code":[15],"encodes":[16],"a":[17,20,141,148,213,235],"message":[18],"into":[19],"codeword":[21],"made":[22],"up":[23],"of":[24,58,63,85,100,116,150,220,227,260],"several":[25],"symbols,":[26],"which":[27,51],"are":[28,46,105,175,182],"then":[29],"distributed":[30],"among":[31],"nodes":[32,67],"in":[33,49,75,186,192,250],"the":[34,53,72,151,190,217,225,258,263],"system.":[35],"Maximum":[36],"distance":[37],"separable":[38],"(MDS)":[39],"<tex":[40,59,64],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[41,60,65],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$[n,":[42],"k]$</tex>":[43],"scalar":[44],"commonly":[47],"used":[48],"practice,":[50],"have":[52],"property":[54],"that":[55,130,157,180,242],"any":[56],"subset":[57],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k$</tex>":[61],"out":[62],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n$</tex>":[66],"is":[68,88,132,159,244],"enough":[69],"decode":[71],"message.":[73],"However,":[74],"applications":[76],"such":[77],"as":[78,147],"geo-distributed":[79],"systems,":[81],"decodability":[82],"from":[83],"many":[84],"these":[86,126],"subsets":[87,99],"unnecessary.":[89],"In":[90],"this":[91,231],"paper,":[92],"we":[93,128,178,200,211],"study":[94],"where":[96],"only":[97],"certain":[98],"nodes,":[101],"named":[102],"access":[103,153,265],"sets,":[104],"required":[106,152,264],"satisfy":[108],"decodability.":[109],"Our":[110,238],"analysis":[111],"focuses":[112],"on":[113,144,168,202,216],"two":[114],"metrics":[115],"practical":[117],"importance:":[118],"update":[119,145,206,251],"cost":[120,146,196,207,252],"and":[121,155,223,253],"overhead.":[123,170],"For":[124],"minimizing":[125],"metrics,":[127],"show":[129,156,179,224,241],"it":[131,158,243],"necessary":[133],"employ":[135],"irregular":[136],"array":[137],"codes.":[138],"We":[139],"derive":[140,212],"lower":[142,166,173,214,232],"bound":[143,167,215,233],"function":[149],"sets":[154],"achievable.":[160],"Existing":[161],"work":[162],"provides":[163],"an":[164],"achievable":[165,185],"While":[171],"both":[172],"bounds":[174],"individually":[176],"achievable,":[177],"they":[181],"not":[183],"simultaneously":[184],"general.":[187],"Due":[188],"premium":[191],"wide-area":[193],"network":[194],"bandwidth":[195],"over":[197],"cost,":[199],"focus":[201],"with":[204],"minimum":[205],"(termed":[208],"MUC).":[209],"Finally,":[210],"overhead":[219,255],"MUC":[221,228],"existence":[226],"meeting":[230],"via":[234],"randomized":[236],"construction.":[237],"results":[239],"thus":[240],"possible":[245],"achieve":[247],"significant":[248],"savings":[249],"by":[256],"tailoring":[257],"design":[259],"sets.":[266]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}
