{"id":"https://openalex.org/W2953243231","doi":"https://doi.org/10.1109/tit.2019.2924888","title":"Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes","display_name":"Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes","publication_year":2019,"publication_date":"2019-06-25","ids":{"openalex":"https://openalex.org/W2953243231","doi":"https://doi.org/10.1109/tit.2019.2924888","mag":"2953243231"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2019.2924888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2924888","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://arxiv.org/pdf/1809.11158.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006688702","display_name":"Umberto Mart\u00ednez-Pe\u00f1as","orcid":"https://orcid.org/0000-0003-2626-8139"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Umberto Martinez-Penas","raw_affiliation_strings":["Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada","University of Toronto"],"raw_orcid":"https://orcid.org/0000-0003-2626-8139","affiliations":[{"raw_affiliation_string":"Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077846751","display_name":"Frank R. Kschischang","orcid":"https://orcid.org/0000-0002-4274-1785"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Frank R. Kschischang","raw_affiliation_strings":["Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada","University of Toronto"],"raw_orcid":"https://orcid.org/0000-0002-4274-1785","affiliations":[{"raw_affiliation_string":"Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.7816,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76355142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"65","issue":"12","first_page":"7790","last_page":"7805"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9818999767303467,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.977400004863739,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.6213210225105286},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5646766424179077},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4897444248199463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47080719470977783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4576387405395508},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.45417070388793945},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.44636648893356323},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4396583139896393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3636263608932495},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32976025342941284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1946469247341156},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.09882676601409912}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6213210225105286},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5646766424179077},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4897444248199463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47080719470977783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4576387405395508},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45417070388793945},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.44636648893356323},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4396583139896393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3636263608932495},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32976025342941284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1946469247341156},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09882676601409912},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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":3,"locations":[{"id":"doi:10.1109/tit.2019.2924888","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2924888","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"},{"id":"mag:2953243231","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1809.11158.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1809.11158","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1809.11158","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"mag:2953243231","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1809.11158.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G263450949","display_name":null,"funder_award_id":"DFF-7027-00053B","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"}],"funders":[{"id":"https://openalex.org/F4320310485","display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d","ror":"https://ror.org/03ge1nb22"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1866030559","https://openalex.org/W1966237841","https://openalex.org/W1980073965","https://openalex.org/W1993359877","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2010024611","https://openalex.org/W2014149071","https://openalex.org/W2020484625","https://openalex.org/W2022619326","https://openalex.org/W2050413942","https://openalex.org/W2050687505","https://openalex.org/W2060646539","https://openalex.org/W2069554151","https://openalex.org/W2095547380","https://openalex.org/W2095980332","https://openalex.org/W2099837838","https://openalex.org/W2124961791","https://openalex.org/W2126824576","https://openalex.org/W2138744797","https://openalex.org/W2140420067","https://openalex.org/W2148575324","https://openalex.org/W2155418912","https://openalex.org/W2165029016","https://openalex.org/W2333324284","https://openalex.org/W2339524574","https://openalex.org/W2555108336","https://openalex.org/W2582551733","https://openalex.org/W2766426326","https://openalex.org/W2800109128","https://openalex.org/W2908383142","https://openalex.org/W2962962878","https://openalex.org/W2963073980","https://openalex.org/W2963265502","https://openalex.org/W2963334072","https://openalex.org/W2963503165","https://openalex.org/W2963857999","https://openalex.org/W2963890921","https://openalex.org/W2963911258","https://openalex.org/W2964044617","https://openalex.org/W2964326991","https://openalex.org/W2964892028","https://openalex.org/W2967614216","https://openalex.org/W2979912047","https://openalex.org/W2995134452","https://openalex.org/W3100072615","https://openalex.org/W3100282565","https://openalex.org/W3104978253","https://openalex.org/W6606324823","https://openalex.org/W6714117983","https://openalex.org/W6745363715","https://openalex.org/W6747336619","https://openalex.org/W6751494855","https://openalex.org/W6753836785"],"related_works":["https://openalex.org/W2892776878","https://openalex.org/W3136350169","https://openalex.org/W2968550935","https://openalex.org/W3214623290","https://openalex.org/W3102225876","https://openalex.org/W2155418912","https://openalex.org/W2440761015","https://openalex.org/W3165747624","https://openalex.org/W2963019117","https://openalex.org/W2510019121","https://openalex.org/W3179720698","https://openalex.org/W2963890921","https://openalex.org/W3104944838","https://openalex.org/W2951449222","https://openalex.org/W2796329322","https://openalex.org/W2604774093","https://openalex.org/W3095793903","https://openalex.org/W2609901020","https://openalex.org/W3081321282","https://openalex.org/W3110284774"],"abstract_inverted_index":{"Locally":[0],"repairable":[1],"codes":[2,43,59,194,197,217,260],"(LRCs)":[3],"are":[4,142,224,261],"considered":[5],"with":[6,21,198,218],"equal":[7,137],"or":[8,45,77,81,96,113,132,195],"unequal":[9,155],"localities,":[10,62,138,156],"local":[11,14,30,41,57,63,66,104,178,199,202,214,219],"distances,":[12,64],"and":[13,32,65,71,99,106,130,173,221,252,257],"field":[15,161,267],"sizes.":[16],"An":[17],"explicit":[18],"two-layer":[19],"architecture":[20,80],"a":[22,50,174],"sum-rank":[23,258],"outer":[24,82],"code":[25],"is":[26,188,204],"obtained,":[27],"having":[28],"disjoint":[29],"groups":[31,105,129],"achieving":[33],"maximal":[34],"recoverability":[35],"(MR)":[36],"for":[37,208,247],"all":[38,165,248],"families":[39],"of":[40,123,146,177,184,192,212,250,273],"linear":[42,58],"(MDS":[44],"not)":[46],"simultaneously,":[47],"up":[48],"to":[49,91,190,243,263],"specified":[51,133],"maximum":[52,131],"locality$r":[53,134],"$.":[54,135],"Furthermore,":[55],"the":[56,61,86,180,185,209,213,227,271],"(thus":[60],"fields)":[67],"can":[68,109,239],"be":[69,110,241],"efficiently":[70],"dynamically":[72],"modified":[73],"without":[74,115],"global":[75,116,121,140,181],"recoding":[76],"changes":[78],"in":[79,94],"code,":[83],"while":[84,201],"preserving":[85],"MR":[87],"property,":[88],"easily":[89],"adapting":[90],"new":[92,97],"configurations":[93],"storage":[95],"hot":[98],"cold":[100],"data.":[101],"In":[102],"addition,":[103],"file":[107],"components":[108],"added,":[111],"removed":[112],"updated":[114],"recoding.":[117],"The":[118,236],"construction":[119,187,229,238],"requires":[120],"fields":[122,141],"size":[124,162,268],"roughly$g^{r}":[125],"$,":[126,234],"for$g":[127],"$local":[128],"For":[136,154,170],"these":[139],"smaller":[143],"than":[144],"those":[145],"previous":[147,166],"MR-LRCs":[148,246],"when$r":[149],"\\leq":[150],"h":[151],"$(global":[152],"parities).":[153],"they":[157],"provide":[158,244],"an":[159],"exponential":[160,266],"reduction":[163],"on":[164],"best":[167],"known":[168],"MR-LRCs.":[169],"bounded":[171],"localities":[172],"large":[175],"number":[176],"groups,":[179],"erasure-correction":[182],"complexity":[183],"given":[186,228,237],"comparable":[189],"that":[191],"Tamo\u2013Barg":[193],"Reed\u2013Solomon":[196,216],"replication,":[200],"repair":[203],"as":[205,207],"efficient":[206],"Cartesian":[210,222],"product":[211],"codes.":[215],"replication":[220],"products":[223],"recovered":[225],"from":[226],"when$r=1":[230],"$and$h":[231],"=":[232],"0":[233],"respectively.":[235],"also":[240],"adapted":[242],"hierarchical":[245],"types":[249],"hierarchies":[251],"parameters.":[253],"Finally,":[254],"subextension":[255],"subcodes":[256],"alternant":[259],"introduced":[262],"obtain":[264],"further":[265],"reductions,":[269],"at":[270],"expense":[272],"lower":[274],"information":[275],"rates.":[276]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":4}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}