{"id":"https://openalex.org/W2962966916","doi":"https://doi.org/10.1109/itw.2018.8613345","title":"Optimal Cyclic (r, \u1e9f) Locally Repairable Codes with Unbounded Length","display_name":"Optimal Cyclic (r, \u1e9f) Locally Repairable Codes with Unbounded Length","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2962966916","doi":"https://doi.org/10.1109/itw.2018.8613345","mag":"2962966916"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2018.8613345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","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/A5018855940","display_name":"Weijun Fang","orcid":"https://orcid.org/0000-0003-4121-290X"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]},{"id":"https://openalex.org/I4401200345","display_name":"Laboratoire de physique de la mati\u00e8re condens\u00e9e","ror":"https://ror.org/05brss208","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4401200345","https://openalex.org/I4647051"]}],"countries":["CN","FR"],"is_corresponding":true,"raw_author_name":"Weijun Fang","raw_affiliation_strings":["Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279","https://openalex.org/I4401200345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063946169","display_name":"Fang\u2010Wei Fu","orcid":"https://orcid.org/0000-0002-9696-8977"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]},{"id":"https://openalex.org/I4401200345","display_name":"Laboratoire de physique de la mati\u00e8re condens\u00e9e","ror":"https://ror.org/05brss208","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4401200345","https://openalex.org/I4647051"]}],"countries":["CN","FR"],"is_corresponding":false,"raw_author_name":"Fang-Wei Fu","raw_affiliation_strings":["Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279","https://openalex.org/I4401200345"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018855940"],"corresponding_institution_ids":["https://openalex.org/I205237279","https://openalex.org/I4401200345"],"apc_list":null,"apc_paid":null,"fwci":1.4762,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8502244,"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":"1","last_page":"5"},"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/T11478","display_name":"Caching and Content Delivery","score":0.983299970626831,"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.961899995803833,"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.6031144261360168},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5990346670150757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5736382603645325},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5718830823898315},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4929335117340088},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46001574397087097},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.45500800013542175},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44685274362564087},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.41618919372558594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26079225540161133},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06432121992111206}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6031144261360168},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5990346670150757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5736382603645325},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5718830823898315},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4929335117340088},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46001574397087097},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.45500800013542175},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44685274362564087},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.41618919372558594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26079225540161133},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06432121992111206},{"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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C2779234561","wikidata":"https://www.wikidata.org/wiki/Q11995","display_name":"Pregnancy","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2018.8613345","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","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":19,"referenced_works":["https://openalex.org/W1587885095","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2021662392","https://openalex.org/W2022619326","https://openalex.org/W2050500290","https://openalex.org/W2065154502","https://openalex.org/W2155418912","https://openalex.org/W2339524574","https://openalex.org/W2783068971","https://openalex.org/W2962735098","https://openalex.org/W2963890921","https://openalex.org/W2963911258","https://openalex.org/W2964317282","https://openalex.org/W2979363856","https://openalex.org/W3100004208","https://openalex.org/W6666936951","https://openalex.org/W6745950074","https://openalex.org/W6748284789"],"related_works":["https://openalex.org/W747331120","https://openalex.org/W2351588585","https://openalex.org/W4233660055","https://openalex.org/W2076370897","https://openalex.org/W2906951486","https://openalex.org/W3125437892","https://openalex.org/W2224172171","https://openalex.org/W1965730239","https://openalex.org/W2052181983","https://openalex.org/W4285428286"],"abstract_inverted_index":{"Prakash":[0],"et":[1],"al.":[2],"[2]":[3],"introduced":[4],"the":[5,31,39,64,77,80],"concept":[6],"of":[7,41,48,58,63,98,120],"(r,":[8,23,51,101,123],"\u03b4)":[9],"locally":[10],"repairable":[11],"codes":[12,60],"((r,":[13],"\u03b4)-LRCs":[14,52,102],"for":[15,17],"short)":[16],"tolerating":[18],"multiple":[19],"failed":[20],"nodes.":[21],"An":[22],"\u03b4)-LRC":[24],"is":[25],"called":[26],"optimal":[27,49,99,121],"if":[28],"it":[29],"achieves":[30],"Singleton-type":[32],"bound.":[33],"In":[34],"this":[35],"paper,":[36],"inspired":[37],"by":[38],"work":[40],"[3],":[42],"we":[43,94,116],"firstly":[44],"construct":[45],"two":[46],"classes":[47],"cyclic":[50,100,122],"with":[53,89,103,125],"unbounded":[54,104,126],"lengths":[55,57],"(i.e.,":[56],"these":[59],"are":[61],"independent":[62],"alphabet":[65],"size)":[66],"and":[67,106,128],"minimum":[68,108,130],"distances":[69],"\u03b4+1":[70],"or":[71],"\u03b4":[72,81,113],"+":[73],"2,":[74],"which":[75],"generalize":[76],"results":[78],"about":[79],"=":[82,114],"2":[83],"case":[84],"given":[85],"in":[86],"[3].":[87],"Secondly,":[88],"a":[90,96],"slightly":[91],"stronger":[92],"condition,":[93],"present":[95],"construction":[97],"length":[105,127],"larger":[107,129],"distance":[109,131],"2\u03b4.":[110],"Furthermore,":[111],"when":[112],"3,":[115],"provide":[117],"another":[118],"class":[119],"3)-LRCs":[124],"6.":[132]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}