{"id":"https://openalex.org/W2507181206","doi":"https://doi.org/10.1109/isit.2016.7541489","title":"Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth","display_name":"Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2507181206","doi":"https://doi.org/10.1109/isit.2016.7541489","mag":"2507181206"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/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":true,"raw_author_name":"Min Ye","raw_affiliation_strings":["Dept. of ECE and ISR, University of Maryland, College Park, 20742, United States","Dept. of ECE and ISR, University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"Dept. of ECE and ISR, University of Maryland, College Park, 20742, United States","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of ECE and ISR, University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"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":["Dept. of ECE and ISR, University of Maryland, College Park, 20742, United States","Dept. of ECE and ISR, University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"Dept. of ECE and ISR, University of Maryland, College Park, 20742, United States","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of ECE and ISR, University of Maryland, College Park, 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/I66946132"],"apc_list":null,"apc_paid":null,"fwci":10.3249,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.98360425,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1202","last_page":"1206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","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"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","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/T11130","display_name":"Coding theory and cryptography","score":0.9977999925613403,"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.993399977684021,"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/separable-space","display_name":"Separable space","score":0.622852087020874},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6034033894538879},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49067699909210205},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4883422553539276},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47204551100730896},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.4544832706451416},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4528430998325348},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4428786337375641},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.43999454379081726},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.4322478175163269},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.4163092374801636},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3833874464035034},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3281317353248596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2658851146697998},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.14702144265174866}],"concepts":[{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.622852087020874},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6034033894538879},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49067699909210205},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4883422553539276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47204551100730896},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.4544832706451416},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4528430998325348},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4428786337375641},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.43999454379081726},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.4322478175163269},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.4163092374801636},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3833874464035034},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3281317353248596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2658851146697998},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.14702144265174866},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":23,"referenced_works":["https://openalex.org/W764447330","https://openalex.org/W1678974983","https://openalex.org/W1842188052","https://openalex.org/W1964716404","https://openalex.org/W1977073502","https://openalex.org/W1991499930","https://openalex.org/W2056826630","https://openalex.org/W2069026918","https://openalex.org/W2102047288","https://openalex.org/W2105185344","https://openalex.org/W2126295689","https://openalex.org/W2136583008","https://openalex.org/W2150777202","https://openalex.org/W2154063365","https://openalex.org/W2207060061","https://openalex.org/W2963072024","https://openalex.org/W2963754880","https://openalex.org/W3101824114","https://openalex.org/W3106482607","https://openalex.org/W6622314485","https://openalex.org/W6637293350","https://openalex.org/W6638991018","https://openalex.org/W6703973578"],"related_works":["https://openalex.org/W4245031194","https://openalex.org/W2296600582","https://openalex.org/W2976106059","https://openalex.org/W2023731335","https://openalex.org/W2060232182","https://openalex.org/W2289440727","https://openalex.org/W2369782648","https://openalex.org/W2149696252","https://openalex.org/W2515824348","https://openalex.org/W2048873580"],"abstract_inverted_index":{"Given":[0],"any":[1,22,27,55],"r":[2,38],"and":[3,39,78,112],"n,":[4],"we":[5,137],"present":[6,90],"an":[7,139],"explicit":[8,101,140],"construction":[9,141],"of":[10,75,81,106,134,142],"high-rate":[11],"maximum":[12],"distance":[13],"separable":[14],"(MDS)":[15],"array":[16],"codes":[17,50,83,102,144],"that":[18],"can":[19,51,98,116],"optimally":[20,118],"repair":[21,74,119,148],"d":[23,43],"failed":[24,76],"nodes":[25,30],"from":[26],"h":[28,36,47],"helper":[29],"for":[31,103],"all":[32,84,126],"h,":[33],"1":[34],"\u2264":[35,37,42,44],"d,":[40],"k":[41],"n":[45],"-":[46],"simultaneously.":[48],"These":[49],"be":[52],"constructed":[53],"over":[54,94],"base":[56],"field":[57],"F":[58],"as":[59,61],"long":[60],"|F|":[62],"\u2265":[63],"sn;":[64],"where":[65],"s":[66],"=":[67],"lcm(1,":[68],"2,...,":[69],"r).":[70],"The":[71],"encoding,":[72],"decoding,":[73],"nodes,":[77,111],"update":[79],"procedures":[80],"these":[82,113],"have":[85],"low":[86],"complexity.":[87],"Our":[88],"results":[89,96],"a":[91,120],"significant":[92],"improvement":[93],"earlier":[95],"which":[97],"only":[99,117],"construct":[100],"the":[104,127,131,135],"case":[105],"at":[107],"most":[108],"3":[109],"parity":[110],"existing":[114],"constructions":[115],"single":[121],"node":[122],"failure":[123],"by":[124],"accessing":[125],"surviving":[128],"nodes.":[129],"In":[130],"second":[132],"part":[133],"paper":[136],"give":[138],"Reed-Solomon":[143],"with":[145],"asymptotically":[146],"optimal":[147],"bandwidth.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":2}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}