{"id":"https://openalex.org/W2886907271","doi":"https://doi.org/10.1109/isit.2018.8437869","title":"Optimal Regenerating Codes for Cooperative Repair","display_name":"Optimal Regenerating Codes for Cooperative Repair","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886907271","doi":"https://doi.org/10.1109/isit.2018.8437869","mag":"2886907271"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5100725244","display_name":"Min Ye","orcid":"https://orcid.org/0000-0003-1351-8880"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Min Ye","raw_affiliation_strings":["Princeton University, Department of EE, Princeton, NJ","Department of EE, Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Department of EE, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of EE, Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004622357","display_name":"Alexander Barg","orcid":"https://orcid.org/0000-0002-8972-4413"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Barg","raw_affiliation_strings":["University of Maryland, College Park, Dept. of ECE and ISR, MD, 20742","Dept. of ECE and ISR, University of Maryland, MD"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Dept. of ECE and ISR, MD, 20742","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of ECE and ISR, University of Maryland, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100725244"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10211102,"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":"1939","last_page":"1943"},"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.9988999962806702,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9926000237464905,"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.6238870024681091},{"id":"https://openalex.org/keywords/distributed-data-store","display_name":"Distributed data store","score":0.579166829586029},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5625337362289429},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5426443815231323},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5409063100814819},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47218242287635803},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47003549337387085},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42189115285873413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3932138979434967},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3788091242313385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3217756748199463},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0806313157081604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6238870024681091},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.579166829586029},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5625337362289429},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5426443815231323},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5409063100814819},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47218242287635803},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47003549337387085},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42189115285873413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3932138979434967},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3788091242313385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3217756748199463},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0806313157081604},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/isit.2018.8437869","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1977073502","https://openalex.org/W2052678402","https://openalex.org/W2069026918","https://openalex.org/W2105185344","https://openalex.org/W2134191435","https://openalex.org/W2150777202","https://openalex.org/W2166589659","https://openalex.org/W2291936214","https://openalex.org/W2492240243","https://openalex.org/W2742312334","https://openalex.org/W2765604633","https://openalex.org/W2796225713","https://openalex.org/W2962858508","https://openalex.org/W2963007332","https://openalex.org/W2963754880","https://openalex.org/W2963781977","https://openalex.org/W3101824114","https://openalex.org/W3106482607","https://openalex.org/W4300140697"],"related_works":["https://openalex.org/W4394650907","https://openalex.org/W154364797","https://openalex.org/W4254119641","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864"],"abstract_inverted_index":{"Two":[0],"widely":[1],"studied":[2],"models":[3],"of":[4,48,72,117,134,169,187,193,239],"multiple-node":[5],"repair":[6,13,57,96,140,175,185,232],"in":[7,28,55,88,123,209],"distributed":[8],"storage":[9],"systems":[10],"are":[11,26,43],"centralized":[12,18,86],"and":[14,45,208],"cooperative":[15,33,73,80,139],"repair.":[16,74],"The":[17,184],"model":[19,81,101],"assumes":[20],"that":[21,36,78,91,154,172,226],"all":[22,142],"the":[23,32,37,46,56,69,79,85,89,99,103,107,115,166,196,205,210,220,230,235],"failed":[24,38,200,214,222],"nodes":[25,39],"recreated":[27],"one":[29,34],"location,":[30],"while":[31],"stipulates":[35],"may":[40],"communicate":[41],"but":[42],"distinct,":[44],"amount":[47],"data":[49],"exchanged":[50],"between":[51],"them":[52],"is":[53,82,121],"included":[54],"bandwidth.":[58],"As":[59,126],"our":[60,124,127,188,227],"first":[61,197],"result,":[62,129],"we":[63,130,159],"prove":[64],"a":[65],"lower":[66],"bound":[67],"on":[68],"minimum":[70],"bandwidth":[71,97,233],"We":[75],"also":[76],"show":[77],"stronger":[83],"than":[84],"one,":[87,212],"sense":[90],"MDS":[92,135,163],"codes":[93,136,164,189,228],"with":[94,137],"optimal":[95,138,231],"under":[98,106,114],"former":[100],"have":[102],"same":[104],"property":[105],"latter":[108],"one.":[109],"These":[110],"results":[111],"were":[112],"known":[113],"assumption":[116],"uniform":[118],"download":[119],"which":[120],"removed":[122],"proofs.":[125],"main":[128],"give":[131],"explicit":[132],"constructions":[133],"for":[141],"possible":[143,237],"parameters.":[144],"More":[145],"precisely,":[146],"given":[147],"any":[148,176,180],"n,":[149],"k,":[150],"h,":[151],"d":[152,181],"such":[153],"2\\leqslant":[155],"h\\leqslant":[156],"n-d\\leqslant":[157],"n-k":[158],"construct":[160],"(n,":[161],"k)":[162],"over":[165],"field":[167],"F":[168],"size":[170],"|F|\\geqslant(d+1-k)n":[171],"can":[173],"optimally":[174],"h":[177],"erasures":[178],"from":[179,204,219],"helper":[182,206],"nodes.":[183,223],"scheme":[186],"involves":[190],"two":[191],"rounds":[192],"communication.":[194],"In":[195],"round,":[198],"each":[199,213],"node":[201,215],"downloads":[202,216],"information":[203,218],"nodes,":[207],"second":[211],"additional":[217],"other":[221],"This":[224],"implies":[225],"achieve":[229],"using":[234],"smallest":[236],"number":[238],"rounds.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}