{"id":"https://openalex.org/W2892776878","doi":"https://doi.org/10.1109/allerton.2018.8635867","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":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2892776878","doi":"https://doi.org/10.1109/allerton.2018.8635867","mag":"2892776878"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2018.8635867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8635867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5006688702","display_name":"Umberto Mart\u00ednez-Pe\u00f1as","orcid":"https://orcid.org/0000-0003-2626-8139"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Umberto Martinez-Penas","raw_affiliation_strings":["University of Toronto, Toronto, ON, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, ON, CA","institution_ids":[]}]},{"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":["Department of Electrical and Computer Engineering, University of Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.174,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.88877974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"792","last_page":"799"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9840999841690063,"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.9814000129699707,"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/locality","display_name":"Locality","score":0.5677397847175598},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5465459823608398},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4652128517627716},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.45851680636405945},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4514712691307068},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.44897618889808655},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.44304898381233215},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.43870675563812256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43665793538093567},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.4336891174316406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39823299646377563},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.344955712556839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24274975061416626},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.20812642574310303},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.11460286378860474}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5677397847175598},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5465459823608398},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4652128517627716},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.45851680636405945},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4514712691307068},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.44897618889808655},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.44304898381233215},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.43870675563812256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43665793538093567},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.4336891174316406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39823299646377563},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.344955712556839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24274975061416626},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.20812642574310303},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.11460286378860474},{"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/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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2018.8635867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8635867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W154253821","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/W2342204193","https://openalex.org/W2405991429","https://openalex.org/W2555108336","https://openalex.org/W2744311935","https://openalex.org/W2766426326","https://openalex.org/W2800109128","https://openalex.org/W2892776878","https://openalex.org/W2956089011","https://openalex.org/W2962745953","https://openalex.org/W2962962878","https://openalex.org/W2963073980","https://openalex.org/W2963245750","https://openalex.org/W2963334072","https://openalex.org/W2964044617","https://openalex.org/W2964326991","https://openalex.org/W2979912047","https://openalex.org/W3100004208","https://openalex.org/W3100072615","https://openalex.org/W3100282565","https://openalex.org/W6606324823","https://openalex.org/W6714117983","https://openalex.org/W6745363715"],"related_works":["https://openalex.org/W2137028263","https://openalex.org/W2982181605","https://openalex.org/W3102119340","https://openalex.org/W2031335939","https://openalex.org/W1947543223","https://openalex.org/W4287065415","https://openalex.org/W2744779861","https://openalex.org/W1985967368","https://openalex.org/W2130518071","https://openalex.org/W1694938350"],"abstract_inverted_index":{"Locally":[0],"repairable":[1],"codes":[2,43,59,191,194,214,242],"(LRCs)":[3],"are":[4,26,138,221,243],"considered":[5],"with":[6,21,195,215],"equal":[7,133],"or":[8,45,77,81,106,192],"unequal":[9,152],"localities,":[10,62,134,153],"local":[11,14,30,41,57,63,66,97,126,175,196,199,211,216],"distances":[12,64],"and":[13,32,65,71,92,99,128,170,218,231,239],"field":[15,158,249],"sizes.":[16],"An":[17],"explicit":[18],"two-layer":[19],"architecture":[20,80],"a":[22,50,171],"sum-rank":[23,240],"outer":[24,82],"code":[25],"obtained,":[27],"having":[28],"disjoint":[29],"groups":[31,98,127],"achieving":[33],"maximal":[34],"recoverability":[35],"(MR)":[36],"for":[37,124,205],"all":[38,162],"families":[39],"of":[40,116,142,174,181,189,209,255],"linear":[42,58],"(MDS":[44],"not)":[46],"simultaneously,":[47],"up":[48],"to":[49,89,187,245],"prescribed":[51],"maximum":[52,129],"locality":[53,130],"r.":[54,131],"Furthermore,":[55],"the":[56,61,177,182,206,210,224,253],"(thus":[60],"fields)":[67],"can":[68,102],"be":[69,103],"efficiently":[70],"dynamically":[72],"modified":[73],"without":[74,108],"global":[75,109,114,136,178],"recoding":[76],"changes":[78],"in":[79],"code,":[83],"while":[84,198],"preserving":[85],"MR,":[86],"easily":[87],"adapting":[88],"new":[90],"hot":[91],"cold":[93],"data.":[94],"In":[95],"addition,":[96],"file":[100],"components":[101],"added,":[104],"removed":[105],"updated":[107],"recoding.":[110],"The":[111],"construction":[112,184,226],"requires":[113],"fields":[115,137],"size":[117,159,250],"roughly":[118],"g":[119,125],"<sup":[120],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[121],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">r</sup>":[122],",":[123],"For":[132,151,167],"these":[135],"smaller":[139],"than":[140],"those":[141],"previous":[143,163],"MR-LRCs":[144],"when":[145,227],"r":[146,228],"\u2264":[147],"h":[148,232],"(global":[149],"parities).":[150],"they":[154],"provide":[155],"an":[156],"exponential":[157,248],"reduction":[160],"on":[161],"best":[164],"known":[165],"MR-LRCs.":[166],"bounded":[168],"localities":[169],"large":[172],"number":[173],"groups,":[176],"erasure-correction":[179],"complexity":[180],"given":[183,225],"is":[185,201],"comparable":[186],"that":[188],"Tamo-Barg":[190],"Reed-Solomon":[193,213],"replication,":[197],"repair":[200],"as":[202,204],"efficient":[203],"Cartesian":[207,219],"product":[208],"codes.":[212],"replication":[217],"products":[220],"recovered":[222],"from":[223],"=":[229,233],"1":[230],"0,":[234],"respectively.":[235],"Finally,":[236],"subextension":[237],"subcodes":[238],"alternant":[241],"introduced":[244],"obtain":[246],"further":[247],"reductions,":[251],"at":[252],"expense":[254],"lower":[256],"information":[257],"rates.":[258]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}