{"id":"https://openalex.org/W2975007119","doi":"https://doi.org/10.1109/isit.2019.8849719","title":"Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization","display_name":"Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975007119","doi":"https://doi.org/10.1109/isit.2019.8849719","mag":"2975007119"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"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":"Venkatesan Guruswami","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101916384","display_name":"Haotian Jiang","orcid":"https://orcid.org/0000-0002-7501-2247"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haotian Jiang","raw_affiliation_strings":["Paul G. Allen School of Computer Science &#x0026; Engineering, University of Washington","Paul G. Allen School of Computer Science & Engineering, University of Washington"],"affiliations":[{"raw_affiliation_string":"Paul G. Allen School of Computer Science &#x0026; Engineering, University of Washington","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Paul G. Allen School of Computer Science & Engineering, University of Washington","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068388812"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.7413,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74928484,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1077","last_page":"1081"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9980000257492065,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.7353833913803101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7030435800552368},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.41801464557647705},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3644960820674896},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.35507291555404663},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3246329724788666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29577648639678955},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2604730725288391},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.24433323740959167},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23667383193969727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15439608693122864}],"concepts":[{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.7353833913803101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7030435800552368},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41801464557647705},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3644960820674896},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.35507291555404663},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3246329724788666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29577648639678955},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2604730725288391},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.24433323740959167},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23667383193969727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15439608693122864},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849719","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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":20,"referenced_works":["https://openalex.org/W2078872683","https://openalex.org/W2105185344","https://openalex.org/W2105695025","https://openalex.org/W2150620836","https://openalex.org/W2492240243","https://openalex.org/W2577154367","https://openalex.org/W2613593521","https://openalex.org/W2789573885","https://openalex.org/W2910298035","https://openalex.org/W2950353718","https://openalex.org/W2962858508","https://openalex.org/W2963282025","https://openalex.org/W2963559025","https://openalex.org/W2963582720","https://openalex.org/W2963781977","https://openalex.org/W3105184929","https://openalex.org/W3163634073","https://openalex.org/W6722678105","https://openalex.org/W6731868995","https://openalex.org/W6758116723"],"related_works":["https://openalex.org/W2083307409","https://openalex.org/W2121777163","https://openalex.org/W2132376394","https://openalex.org/W2951591976","https://openalex.org/W2056396287","https://openalex.org/W2547343543","https://openalex.org/W2100385353","https://openalex.org/W1971663761","https://openalex.org/W1917654808","https://openalex.org/W4293273086"],"abstract_inverted_index":{"Minimum":[0],"storage":[1],"regenerating":[2],"(MSR)":[3],"codes":[4,7,41,52,104],"are":[5,45],"MDS":[6],"which":[8,44,77],"allow":[9],"for":[10],"recovery":[11],"of":[12,27,33,50,74,81,94,100,108],"any":[13],"single":[14],"erased":[15],"symbol":[16],"with":[17,105],"optimal":[18,88],"repair":[19,89,121],"bandwidth,":[20,90],"based":[21],"on":[22],"the":[23,28,34,48,63,71,87,92,120],"smallest":[24],"possible":[25],"fraction":[26],"contents":[29],"downloaded":[30],"from":[31],"each":[32],"other":[35],"symbols.":[36],"Recently,":[37],"certain":[38],"Reed-":[39],"Solomon":[40],"were":[42],"constructed":[43],"MSR.":[46],"However,":[47],"sub-packetization":[49,107],"these":[51],"is":[53],"exponentially":[54],"large,":[55],"growing":[56],"like":[57],"n":[58,109],"<sup":[59,110],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[60,111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03a9(n)</sup>":[61],"in":[62,91],"constant-rate":[64,101],"regime.":[65],"In":[66],"this":[67],"work,":[68],"we":[69],"study":[70],"relaxed":[72],"notion":[73],"\u03f5-MSR":[75,102],"codes,":[76],"incur":[78],"a":[79],"factor":[80],"(1":[82],"+":[83],"\u03f5)":[84],"higher":[85],"than":[86],"context":[93],"Reed-Solomon":[95,103],"codes.":[96],"We":[97],"give":[98],"constructions":[99],"polynomial":[106],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">O(l/\u03f5)</sup>":[112],"and":[113,123],"thereby":[114],"giving":[115],"an":[116],"explicit":[117],"tradeoff":[118],"between":[119],"bandwidth":[122],"sub-packetization.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}