{"id":"https://openalex.org/W2976933154","doi":"https://doi.org/10.1109/isit.2019.8849762","title":"Classification of Optimal Ternary (r, \u03b4)-Locally Repairable Codes Attaining the Singleton-like Bound","display_name":"Classification of Optimal Ternary (r, \u03b4)-Locally Repairable Codes Attaining the Singleton-like Bound","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976933154","doi":"https://doi.org/10.1109/isit.2019.8849762","mag":"2976933154"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849762","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849762","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/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/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kenneth W. Shum","raw_affiliation_strings":["School of Science and Engineering, The Chinese University of Hong Kong (Shenzhen), Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"School of Science and Engineering, The Chinese University of Hong Kong (Shenzhen), Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"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/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/A5071134614","display_name":"Yixian Yang","orcid":"https://orcid.org/0000-0001-8067-4774"},"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":"Yi-Xian Yang","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":4,"corresponding_author_ids":["https://openalex.org/A5042001449"],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.5559,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70806468,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2828","last_page":"2832"},"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.991599977016449,"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.9807000160217285,"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/singleton","display_name":"Singleton","score":0.812772274017334},{"id":"https://openalex.org/keywords/ternary-operation","display_name":"Ternary operation","score":0.7112730741500854},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6401408314704895},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.6338753700256348},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6267131567001343},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6169923543930054},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5214456915855408},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.5030667185783386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49141061305999756},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.44456854462623596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39732828736305237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3206735849380493},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.08970022201538086},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.04682460427284241}],"concepts":[{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.812772274017334},{"id":"https://openalex.org/C64452783","wikidata":"https://www.wikidata.org/wiki/Q1524945","display_name":"Ternary operation","level":2,"score":0.7112730741500854},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6401408314704895},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6338753700256348},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6267131567001343},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6169923543930054},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5214456915855408},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.5030667185783386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49141061305999756},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.44456854462623596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39732828736305237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3206735849380493},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.08970022201538086},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.04682460427284241},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/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},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849762","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849762","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1519782116","https://openalex.org/W1606480398","https://openalex.org/W1902314736","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2050500290","https://openalex.org/W2069554151","https://openalex.org/W2155418912","https://openalex.org/W2510019121","https://openalex.org/W2593205974","https://openalex.org/W2741278315","https://openalex.org/W2887865132","https://openalex.org/W2962735098","https://openalex.org/W2963911258","https://openalex.org/W2964317282"],"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/W2771420179","https://openalex.org/W2224172171","https://openalex.org/W1965730239","https://openalex.org/W4285428712"],"abstract_inverted_index":{"In":[0,64],"a":[1,4],"linear":[2],"code,":[3],"code":[5,19,43],"symbol":[6,44],"with":[7,112],"(r,":[8,46],"\u03b4)-locality":[9,47],"can":[10],"be":[11,51],"repaired":[12],"by":[13,60],"accessing":[14],"at":[15,24],"most":[16,25],"r":[17],"other":[18],"symbols":[20],"in":[21,40,95,135],"case":[22],"of":[23,71,91,97,109,124,129],"\u03b4":[26],"-":[27],"1":[28],"erasures.":[29],"A":[30],"q-ary":[31,93],"(n,":[32,74,116],"k,":[33,75,117],"r,":[34,76,118],"\u03b4)":[35],"locally":[36],"repairable":[37],"codes":[38],"(LRC)":[39],"which":[41,113],"every":[42],"has":[45],"is":[48],"said":[49],"to":[50],"optimal":[52,72,92,114,130],"if":[53],"it":[54],"achieves":[55],"the":[56,69,88,98,106,136],"Singleton-like":[57],"bound":[58,86],"derived":[59],"Prakash":[61],"et":[62],"al..":[63],"this":[65],"paper,":[66],"we":[67,82,102],"study":[68],"classification":[70],"ternary":[73,115,131],"\u03b4)-LRCs":[77,119],"(\u03b4":[78],">":[79],"2).":[80],"Firstly,":[81],"propose":[83],"an":[84],"upper":[85],"on":[87],"minimum":[89],"distance":[90],"LRCs":[94,132],"terms":[96],"field":[99],"size.":[100],"Then,":[101],"completely":[103],"determine":[104],"all":[105,125],"6":[107,127],"classes":[108,128],"possible":[110],"parameters":[111],"exist.":[120],"Moreover,":[121],"explicit":[122],"constructions":[123],"these":[126],"are":[133],"proposed":[134],"paper.":[137]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}