{"id":"https://openalex.org/W2975743237","doi":"https://doi.org/10.1109/isit.2019.8849478","title":"Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6","display_name":"Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975743237","doi":"https://doi.org/10.1109/isit.2019.8849478","mag":"2975743237"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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/A5086480850","display_name":"Bin Chen","orcid":"https://orcid.org/0000-0003-2965-0333"},"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":true,"raw_author_name":"Bin Chen","raw_affiliation_strings":["Graduate School at Shenzhen, Tsinghua University, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Graduate School at Shenzhen, Tsinghua University, Shenzhen, China","institution_ids":["https://openalex.org/I3131625388","https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100513871","display_name":"Shu-Tao Xia","orcid":null},"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":"Shu-Tao Xia","raw_affiliation_strings":["Graduate School at Shenzhen, Tsinghua University, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Graduate School at Shenzhen, Tsinghua University, Shenzhen, China","institution_ids":["https://openalex.org/I3131625388","https://openalex.org/I99065089"]}]},{"author_position":"last","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":false,"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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086480850"],"corresponding_institution_ids":["https://openalex.org/I3131625388","https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":1.2972,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82604829,"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":"2823","last_page":"2827"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9950000047683716,"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.9641000032424927,"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.7864443063735962},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6395702958106995},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6238070726394653},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5326846241950989},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.528569757938385},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.49390631914138794},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48043060302734375},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4583321213722229},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4490507245063782},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4396817982196808},{"id":"https://openalex.org/keywords/distributed-data-store","display_name":"Distributed data store","score":0.42210936546325684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40740203857421875},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3954195976257324},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24728471040725708},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.11951526999473572},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.11106011271476746}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.7864443063735962},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6395702958106995},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6238070726394653},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5326846241950989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.528569757938385},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.49390631914138794},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48043060302734375},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4583321213722229},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4490507245063782},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4396817982196808},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.42210936546325684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40740203857421875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3954195976257324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24728471040725708},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.11951526999473572},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.11106011271476746},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849478","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849478","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2017346026","https://openalex.org/W2050500290","https://openalex.org/W2138744797","https://openalex.org/W2210977112","https://openalex.org/W2263213887","https://openalex.org/W2510019121","https://openalex.org/W2582270895","https://openalex.org/W2593205974","https://openalex.org/W2885726234","https://openalex.org/W2887865132","https://openalex.org/W2901882031","https://openalex.org/W2963503165","https://openalex.org/W2963890921","https://openalex.org/W2963911258","https://openalex.org/W2964317282","https://openalex.org/W2965115007","https://openalex.org/W3083398082","https://openalex.org/W6606324823","https://openalex.org/W6693421956","https://openalex.org/W6753596756","https://openalex.org/W6756395562"],"related_works":["https://openalex.org/W2963163039","https://openalex.org/W2807749388","https://openalex.org/W2623177195","https://openalex.org/W1667838839","https://openalex.org/W2532270758","https://openalex.org/W4294555231","https://openalex.org/W2095952791","https://openalex.org/W2086474248","https://openalex.org/W3009037395","https://openalex.org/W2795779202"],"abstract_inverted_index":{"Repair":[0],"locality":[1,16,143,213],"has":[2],"been":[3],"an":[4,87],"important":[5],"metric":[6],"in":[7,20,28,57,61,220],"distributed":[8],"storage":[9],"systems":[10],"(DSS).":[11],"Erasure":[12],"codes":[13,36],"with":[14,98,167,192],"small":[15,212],"are":[17,108,218],"more":[18,45],"popular":[19],"DSS,":[21],"which":[22,116,217],"means":[23],"fewer":[24],"available":[25],"nodes":[26],"participating":[27],"the":[29,48,58,68,72,92,130,154,168,174,178,181],"repair":[30],"of":[31,55,77,84,95,125,132,157,160,177,188,207],"failed":[32],"nodes.":[33],"Locally":[34],"repairable":[35],"(LRCs)":[37],"peoposed":[38],"as":[39],"a":[40,53,123,133],"new":[41,114,196],"coding":[42,62],"scheme,":[43],"give":[44],"rise":[46],"to":[47,110,194],"system":[49],"performance":[50],"and":[51,74,147,180],"attract":[52],"lot":[54],"interest":[56],"theoretical":[59],"research":[60,69],"theory.":[63],"The":[64],"particular":[65],"concern":[66],"among":[67],"problems":[70],"is":[71],"bounds":[73],"optimal":[75,96,165,209],"constructions":[76,107,166,210],"LRCs.":[78],"In":[79],"this":[80,158],"direction,":[81],"we":[82,121,184],"first":[83],"all":[85,163,206],"derive":[86],"improved":[88],"upper":[89],"bound":[90,197],"on":[91,129],"code":[93,136,155],"length":[94,137,156],"LRCs":[97,127,161,191],"minimum":[99],"distance":[100,148],"d":[101,149,199],"=":[102,139,145,150,200,215],"5,":[103],"6,":[104],"some":[105],"known":[106,164],"shown":[109],"exactly":[111],"achieve":[112],"our":[113,195,208],"bound,":[115],"verifies":[117],"its":[118],"tightness.":[119],"Then":[120],"construct":[122],"class":[124,159],"distance-optimal":[126],"based":[128],"structure":[131,176],"sunflower,":[134],"whose":[135],"n":[138],"3(q":[140],"+":[141],"1),":[142],"r":[144,214],"2":[146],"6.":[151,201],"Note":[152],"that":[153,205],"outperforms":[162],"same":[169],"parameters.":[170],"Moreover,":[171],"by":[172],"employing":[173],"combinatorial":[175],"sunflower":[179],"q-Steiner":[182],"system,":[183],"obtain":[185],"two":[186],"classes":[187],"k-optimal":[189],"(dimension-optimal)":[190],"respect":[193],"for":[198],"It's":[202],"worth":[203],"noting":[204],"possess":[211],"2,":[216],"attractive":[219],"DSS.":[221]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}