{"id":"https://openalex.org/W2887892895","doi":"https://doi.org/10.1109/isit.2018.8437590","title":"New Constructions of MDS Codes with Asymptotically Optimal Repair","display_name":"New Constructions of MDS Codes with Asymptotically Optimal Repair","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2887892895","doi":"https://doi.org/10.1109/isit.2018.8437590","mag":"2887892895"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437590","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437590","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/A5000404836","display_name":"Ameera Chowdhury","orcid":"https://orcid.org/0000-0002-9577-8653"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ameera Chowdhury","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004102644","display_name":"Alexander Vardy","orcid":"https://orcid.org/0000-0003-3303-9078"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Vardy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000404836"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":0.9227,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.77885848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1944","last_page":"1948"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998000264167786,"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.9998000264167786,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9794999957084656,"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/combinatorics","display_name":"Combinatorics","score":0.6187237501144409},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5104078650474548},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5028411746025085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4834769368171692},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.43964913487434387},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43568533658981323},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3710082173347473},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29673343896865845},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06860324740409851}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6187237501144409},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5104078650474548},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5028411746025085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4834769368171692},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.43964913487434387},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43568533658981323},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3710082173347473},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29673343896865845},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06860324740409851},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437590","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437590","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":14,"referenced_works":["https://openalex.org/W1964716404","https://openalex.org/W2069026918","https://openalex.org/W2078872683","https://openalex.org/W2102047288","https://openalex.org/W2105185344","https://openalex.org/W2207060061","https://openalex.org/W2337134433","https://openalex.org/W2507181206","https://openalex.org/W2789573885","https://openalex.org/W2963000079","https://openalex.org/W2963282025","https://openalex.org/W2963754880","https://openalex.org/W3101824114","https://openalex.org/W6731868995"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W4303635220"],"abstract_inverted_index":{"An":[0],"(n,k,":[1,90,103,228,346,365],"l)":[2,91,104,229,347,366],"MDS":[3,92,105,160,174,187,230,290,348,367],"code":[4,93,231,291,349,368],"of":[5,21,25,42,47,67,78,88,102,124,225,248,260,314,325,342,364],"length":[6,26],"n,":[7],"dimension":[8],"k,":[9,154],"and":[10,63,127,144,150,164,176,235],"sub-packetization":[11,183,224,259,313,324],"l":[12,27],"over":[13,28],"a":[14,19,212,254,266,294],"finite":[15],"field":[16],"F":[17,29],"is":[18,74,94,196,205],"set":[20],"n":[22,49],"column":[23],"vectors":[24,36],"with":[30,297],"the":[31,39,48,60,64,71,75,79,82,85,114,122,140,180,223,226,258,261,312,323,331,340,362],"property":[32],"that":[33,137,251,269,353,370],"any":[34],"k":[35],"can":[37,53,218],"recover":[38,54],"entire":[40],"data":[41],"kl":[43],"symbols.":[44],"If":[45,302],"one":[46],"nodes":[50],"fails,":[51],"we":[52,209,244,282,310,351],"it":[55],"by":[56,233],"downloading":[57],"symbols":[58,68],"from":[59],"surviving":[61],"nodes,":[62],"total":[65],"number":[66,123],"downloaded":[69],"in":[70,192,200,211,257,330,360],"worst":[72],"case":[73],"repair":[76,86,108,241,273,300],"bandwidth":[77,87,149,168,186],"code.":[80],"By":[81],"cut-set":[83,115,141],"bound,":[84],"an":[89,206,246,284],"at":[95],"least":[96],"(n-1)l/(n-k).":[97],"There":[98],"are":[99],"several":[100],"constructions":[101,195,232,369],"codes":[106,136,178],"whose":[107],"bandwidths":[109],"meet":[110,113,139],"or":[111],"asymptotically":[112,138,239,271,298],"bound.":[116,142],"For":[117],"example,":[118,309],"letting":[119],"r=n-k":[120],"denote":[121],"parities,":[125],"Ye":[126,143,234],"Barg":[128,145,236],"constructed":[129,147,166],"(n,k,r":[130,169],"<sup":[131,156,170,278,286,304,316,327],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[132,157,171,279,287,305,317,328],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[133,158],")":[134,159,173,289],"Reed-Solomon":[135],"also":[146],"optimal":[148,151,167,185,240,272,299],"update":[152],"(n,":[153],"r":[155,204],"codes.":[161,188],"Wang,":[162],"Tamo,":[163],"Bruck":[165],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n/(r+1)</sup>":[172],"codes,":[175],"these":[177,194],"have":[179],"smallest":[181],"known":[182],"for":[184,308],"A":[189],"key":[190],"idea":[191,250],"all":[193],"to":[197,221,253,338],"expand":[198],"integers":[199],"base":[201],"r.":[202],"When":[203],"integral":[207],"power,":[208],"demonstrated":[210,336],"previous":[213],"paper":[214],"how":[215,337],"this":[216,249],"technique":[217],"be":[219,357],"refined":[220],"improve":[222,339],"two":[227],"while":[237,264],"achieving":[238,265],"bandwidth.":[242,274,301],"Herein,":[243],"present":[245],"extension":[247],"leads":[252],"significant":[255],"reduction":[256],"Wang-Tamo-Bruck":[262],"construction":[263],"repair-by-transfer":[267,295],"scheme":[268,296],"has":[270,293],"Specifically,":[275],"when":[276],"r=s":[277],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</sup>":[280,306],",":[281,307,319],"obtain":[283],"(n,k,s":[285],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k/r+m-1</sup>":[288,318],"which":[292,320],"r=2":[303],"achieve":[311],"2":[315,326],"improves":[321],"upon":[322],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">mn/(r+1)</sup>":[329],"Wang-":[332],"Tamo-Bruck":[333],"construction.":[334],"Having":[335],"sub-packetizations":[341,363],"three":[343],"quite":[344],"different":[345],"constructions,":[350],"believe":[352],"our":[354],"approach":[355],"will":[356],"generally":[358],"useful":[359],"reducing":[361],"utilize":[371],"r-ary":[372],"expansion.":[373]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}