{"id":"https://openalex.org/W2963781977","doi":"https://doi.org/10.1109/tit.2017.2730863","title":"Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization","display_name":"Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization","publication_year":2017,"publication_date":"2017-07-24","ids":{"openalex":"https://openalex.org/W2963781977","doi":"https://doi.org/10.1109/tit.2017.2730863","mag":"2963781977"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2730863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2730863","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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":["Department of ECE and ISR, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of ECE and ISR, University of Maryland, College Park, MD, USA","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":["Department of ECE and ISR, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of ECE and ISR, University of Maryland, College Park, MD, USA","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":19.0624,"has_fulltext":false,"cited_by_count":192,"citation_normalized_percentile":{"value":0.99444097,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"63","issue":"10","first_page":"6307","last_page":"6317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9998999834060669,"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.9998999834060669,"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.9959999918937683,"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.9930999875068665,"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/code-word","display_name":"Code word","score":0.6916029453277588},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6859627962112427},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6470519304275513},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.63338702917099},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6040709614753723},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5296981930732727},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5161396265029907},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.4658917188644409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4390886425971985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43652400374412537},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4295702874660492},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3578394651412964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3068472146987915},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.17294880747795105},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12224805355072021}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6916029453277588},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6859627962112427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6470519304275513},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.63338702917099},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6040709614753723},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5296981930732727},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5161396265029907},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.4658917188644409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4390886425971985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43652400374412537},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4295702874660492},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3578394651412964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3068472146987915},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.17294880747795105},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12224805355072021},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"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/tit.2017.2730863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2730863","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5417119973","display_name":null,"funder_award_id":"CCF1422955","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6196167047","display_name":null,"funder_award_id":"CCF1618603","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1647846156","https://openalex.org/W1964716404","https://openalex.org/W1991499930","https://openalex.org/W1997044393","https://openalex.org/W2021662392","https://openalex.org/W2022619326","https://openalex.org/W2046877816","https://openalex.org/W2056826630","https://openalex.org/W2069026918","https://openalex.org/W2069554151","https://openalex.org/W2102047288","https://openalex.org/W2105185344","https://openalex.org/W2136583008","https://openalex.org/W2150777202","https://openalex.org/W2154063365","https://openalex.org/W2206342828","https://openalex.org/W2207060061","https://openalex.org/W2337134433","https://openalex.org/W2404589817","https://openalex.org/W2463937711","https://openalex.org/W2492240243","https://openalex.org/W2507181206","https://openalex.org/W2580726118","https://openalex.org/W2613593521","https://openalex.org/W2962858508","https://openalex.org/W2963072024","https://openalex.org/W2963362241","https://openalex.org/W2963754880","https://openalex.org/W3100004208","https://openalex.org/W3101824114","https://openalex.org/W3106482607","https://openalex.org/W6738881435"],"related_works":["https://openalex.org/W88624181","https://openalex.org/W2009525028","https://openalex.org/W4321064619","https://openalex.org/W2910428196","https://openalex.org/W2369939250","https://openalex.org/W2181722423","https://openalex.org/W2076561698","https://openalex.org/W2895235410","https://openalex.org/W251429526","https://openalex.org/W2304380675"],"abstract_inverted_index":{"An":[0],"(n,":[1],"k,":[2],"l)":[3],"maximum":[4],"distance":[5],"separable":[6],"(MDS)":[7],"array":[8],"code":[9,85],"of":[10,24,37,55,59,64,75,97,102,157,178,197,215,249,257,283,294,302,343,360],"length":[11],"n,":[12,364],"dimension":[13],"k":[14,317],"=":[15,119,164,202,285,314],"n":[16,27,78,149,284],"-":[17,79,318],"r,":[18,151],"and":[19,50,150,237,241,260,297,365,370],"subpacketization":[20,162],"l":[21,25,123,127,163,183,201],"is":[22,86,288,307],"formed":[23],"\u00d7":[26],"matrices":[28],"over":[29,226,356],"a":[30,42,53,60,73,107,213,247,341],"finite":[31,228],"field":[32,229,358],"F,":[33],"with":[34,117,161,200,262,272,345],"every":[35],"column":[36],"the":[38,46,56,90,95,103,121,125,176,180,189,207,250,255,281,300,308,312,324,329,333,346],"matrix":[39],"stored":[40],"on":[41,110],"separate":[43],"node":[44,62],"in":[45],"distributed":[47],"storage":[48],"system":[49],"viewed":[51],"as":[52,231,233,332],"coordinate":[54],"codeword.":[57],"Repair":[58],"failed":[61,334],"(recovery":[63],"one":[65],"erased":[66],"column)":[67],"can":[68,223,353],"be":[69,224,354],"performed":[70],"by":[71,210],"accessing":[72],"set":[74,282],"d":[76,118,313],"\u2264":[77],"1":[80,319],"surviving":[81],"(helper)":[82],"nodes.":[83],"The":[84],"said":[87],"to":[88,184,187],"have":[89],"optimal":[91,208,273,348],"access":[92,349],"property":[93],"if":[94],"amount":[96,301],"data":[98,304],"accessed":[99,303],"at":[100,211],"each":[101],"helper":[104,320],"nodes":[105,287,321,327],"meets":[106],"lower":[108,190],"bound":[109,126],"this":[111,171,276,337],"quantity.":[112],"For":[113,336],"optimal-access":[114,158,198],"MDS":[115,159],"codes":[116,160,199,222,259,261,344,352],"n-1,":[120],"sub-packetization":[122,181],"satisfies":[124],"\u2265":[128,235,363],"r":[129,165,216],"<sup":[130,166,217],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[131,167,218],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(k-1)/r</sup>":[132],".":[133,169,220],"In":[134,170,275],"our":[135],"previous":[136],"work":[137],"(IEEE":[138],"Trans.":[139],"Inf.":[140],"Theory,":[141],"vol.":[142],"63,":[143],"no.":[144],"4,":[145],"2017),":[146],"for":[147,305],"any":[148,227,357],"we":[152,173,268,278,339],"presented":[153],"an":[154,194],"explicit":[155,195],"construction":[156],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2308n-1\u2309</sup>":[168],"paper,":[172],"take":[174],"up":[175],"question":[177],"reducing":[179],"value":[182,209],"make":[185],"it":[186],"approach":[188],"bound.":[191],"We":[192,244],"construct":[193,340],"family":[196,342],"r1.n/rl,":[203],"which":[204,267],"differs":[205],"from":[206,328],"most":[212],"factor":[214],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[219],"These":[221,351],"constructed":[225,355],"F":[230,359],"long":[232],"|F|":[234,362],"r\u2308n/r\u2309,":[236],"afford":[238,367],"low-complexity":[239,368],"encoding":[240,369],"decoding":[242,371],"procedures.":[243,372],"also":[245,366],"define":[246],"version":[248],"repair":[251,271,292,306],"problem":[252],"that":[253,280,299],"bridges":[254],"context":[256],"regenerating":[258],"locality":[263],"constraints":[264],"(LRC":[265],"codes),":[266],"call":[269],"group":[270,331,347],"access.":[274],"variation,":[277],"assume":[279],"sm":[286],"partitioned":[289],"into":[290],"m":[291],"groups":[293],"size":[295,361],"s,":[296],"require":[298],"smallest":[309],"possible":[310],"whenever":[311],"s":[315],"+":[316],"include":[322],"all":[323],"other":[325],"s-1":[326],"same":[330],"node.":[335],"problem,":[338],"property.":[350]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":21},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":27},{"year":2018,"cited_by_count":29},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}