{"id":"https://openalex.org/W2887865132","doi":"https://doi.org/10.1109/isit.2018.8437466","title":"On the Maximal Code Length of Optimal Linear Locally Repairable Codes","display_name":"On the Maximal Code Length of Optimal Linear Locally Repairable Codes","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2887865132","doi":"https://doi.org/10.1109/isit.2018.8437466","mag":"2887865132"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437466","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437466","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/A5042001449","display_name":"Jie Hao","orcid":"https://orcid.org/0000-0003-2032-665X"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jie Hao","raw_affiliation_strings":["Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Information Security Center, Beijing University of Posts and Telecommunications, Beijing, China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103017634","display_name":"Kenneth W. Shum","orcid":"https://orcid.org/0000-0001-6505-6177"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kenneth Shum","raw_affiliation_strings":["Instituute of Network Coding, The Chinese University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Instituute of Network Coding, The Chinese University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034104790","display_name":"Shu\u2010Tao Xia","orcid":"https://orcid.org/0000-0002-8639-982X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shu-Tao Xia","raw_affiliation_strings":["Chinese University of Hong Kong, New Territories, HK"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, New Territories, HK","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071134614","display_name":"Yixian Yang","orcid":"https://orcid.org/0000-0001-8067-4774"},"institutions":[{"id":"https://openalex.org/I3131625388","display_name":"University Town of Shenzhen","ror":"https://ror.org/05f5j6225","country_code":"CN","type":"education","lineage":["https://openalex.org/I3131625388"]},{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yi-Xian Yang","raw_affiliation_strings":["Graduate School at Shenzhen, Tsinghua University, Shenzhen, China","Tsinghua University, Beijing, Beijing, CN"],"affiliations":[{"raw_affiliation_string":"Graduate School at Shenzhen, Tsinghua University, Shenzhen, China","institution_ids":["https://openalex.org/I3131625388","https://openalex.org/I99065089"]},{"raw_affiliation_string":"Tsinghua University, Beijing, Beijing, CN","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5042001449"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":2.0298,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88124912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1326","last_page":"1330"},"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.9894000291824341,"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/T11478","display_name":"Caching and Content Delivery","score":0.989300012588501,"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","display_name":"Code (set theory)","score":0.7038900852203369},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.49984121322631836},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46843773126602173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45217493176460266},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44859492778778076},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44743672013282776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3691067695617676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3457116186618805},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19568514823913574}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.7038900852203369},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.49984121322631836},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46843773126602173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45217493176460266},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44859492778778076},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44743672013282776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3691067695617676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3457116186618805},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19568514823913574},{"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/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.2018.8437466","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437466","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1519782116","https://openalex.org/W1530125006","https://openalex.org/W1570424847","https://openalex.org/W1902314736","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2012785774","https://openalex.org/W2022619326","https://openalex.org/W2050500290","https://openalex.org/W2127558904","https://openalex.org/W2155418912","https://openalex.org/W2263213887","https://openalex.org/W2339524574","https://openalex.org/W2510019121","https://openalex.org/W2592011924","https://openalex.org/W2962735098","https://openalex.org/W2963754206","https://openalex.org/W3083398082","https://openalex.org/W3100004208","https://openalex.org/W4239704585"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2389793738","https://openalex.org/W2376208682","https://openalex.org/W2924107927","https://openalex.org/W2368886944","https://openalex.org/W4390358280","https://openalex.org/W2611966483","https://openalex.org/W4240806619","https://openalex.org/W4254609622","https://openalex.org/W2392641092"],"abstract_inverted_index":{"A":[0],"code":[1,11,32,42,47,79,99,120,133],"symbol":[2,48],"in":[3,44],"an":[4,94],"<tex":[5,17,28,35,51,85],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[6,18,29,36,52,86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$[n,\\":[7],"k,\\":[8,38,88],"d]$</tex>":[9],"linear":[10],"is":[12,54],"said":[13,55],"to":[14,56],"have":[15],"locality":[16,50],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$r$</tex>":[19,30,53],"if":[20,59],"it":[21],"can":[22],"be":[23,57],"repaired":[24],"from":[25],"at":[26],"most":[27],"other":[31],"symbols.":[33],"An":[34],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(n,\\":[37,87],"r)$</tex>":[39,89],"locally":[40],"repairable":[41],"(LRC)":[43],"which":[45],"every":[46],"has":[49],"optimal":[58,84,103,116,128],"its":[60],"minimum":[61],"distance":[62],"achieves":[63],"the":[64,77,98,112],"Singleton-like":[65],"bound":[66,96],"derived":[67],"by":[68],"Gopalan":[69],"et":[70],"al.":[71],"In":[72],"this":[73],"paper,":[74],"we":[75,92,123],"study":[76],"maximal":[78,119,132],"length":[80,100],"of":[81,101,115,127],"a":[82],"q-ary":[83,102,129],"-LRC.":[90],"Firstly,":[91],"give":[93,124],"upper":[95],"on":[97],"LRCs,":[104],"and":[105,111],"then":[106],"derive":[107],"some":[108,125],"structural":[109],"properties":[110],"weight":[113],"hierarchy":[114],"LRCs":[117,130],"with":[118,131],"length.":[121,134],"Finally,":[122],"constructions":[126]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}