{"id":"https://openalex.org/W4289655117","doi":"https://doi.org/10.1109/isit50566.2022.9834361","title":"Optimal and Almost Optimal Cyclic (r,\u03b4)-LRCs With Large Code Lengths","display_name":"Optimal and Almost Optimal Cyclic (r,\u03b4)-LRCs With Large Code Lengths","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655117","doi":"https://doi.org/10.1109/isit50566.2022.9834361"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834361","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5091678223","display_name":"Jing Qiu","orcid":"https://orcid.org/0000-0003-3264-1681"},"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"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jing Qiu","raw_affiliation_strings":["Nankai University,Chern Institute of Mathematics and LPMC,Tianjin,China,300071"],"affiliations":[{"raw_affiliation_string":"Nankai University,Chern Institute of Mathematics and LPMC,Tianjin,China,300071","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018855940","display_name":"Weijun Fang","orcid":"https://orcid.org/0000-0003-4121-290X"},"institutions":[{"id":"https://openalex.org/I80143920","display_name":"Shandong University of Science and Technology","ror":"https://ror.org/04gtjhw98","country_code":"CN","type":"education","lineage":["https://openalex.org/I80143920"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weijun Fang","raw_affiliation_strings":["Shandong University,School of Cyber Science and Technology,Qingdao,China,266237"],"affiliations":[{"raw_affiliation_string":"Shandong University,School of Cyber Science and Technology,Qingdao,China,266237","institution_ids":["https://openalex.org/I80143920"]}]},{"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"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fang-Wei Fu","raw_affiliation_strings":["Nankai University,Chern Institute of Mathematics and LPMC,Tianjin,China,300071"],"affiliations":[{"raw_affiliation_string":"Nankai University,Chern Institute of Mathematics and LPMC,Tianjin,China,300071","institution_ids":["https://openalex.org/I205237279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091678223"],"corresponding_institution_ids":["https://openalex.org/I205237279"],"apc_list":null,"apc_paid":null,"fwci":0.2148,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.29585062,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3126","last_page":"3131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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.9968000054359436,"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/combinatorics","display_name":"Combinatorics","score":0.6986146569252014},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5717931985855103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5421690344810486},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.49390751123428345},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4921952784061432},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.45919692516326904},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.458255410194397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41934001445770264},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.4142267107963562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23329570889472961},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20904678106307983},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1330440640449524},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.10755172371864319},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.07741522789001465}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6986146569252014},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5717931985855103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5421690344810486},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.49390751123428345},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4921952784061432},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45919692516326904},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.458255410194397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41934001445770264},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.4142267107963562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23329570889472961},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20904678106307983},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1330440640449524},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.10755172371864319},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.07741522789001465},{"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},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834361","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320337504","display_name":"Research and Development","ror":"https://ror.org/027s68j25"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2017346026","https://openalex.org/W2050500290","https://openalex.org/W2335546159","https://openalex.org/W2769071881","https://openalex.org/W2885726234","https://openalex.org/W2901882031","https://openalex.org/W2905582394","https://openalex.org/W2944336509","https://openalex.org/W2962735098","https://openalex.org/W2963503165","https://openalex.org/W2963890921","https://openalex.org/W2963911258","https://openalex.org/W2964317282","https://openalex.org/W2975743237","https://openalex.org/W2979363856","https://openalex.org/W3003747291","https://openalex.org/W3010113848","https://openalex.org/W3095793903","https://openalex.org/W3099613636","https://openalex.org/W3100004208","https://openalex.org/W3111107997","https://openalex.org/W3124715992","https://openalex.org/W3187596382","https://openalex.org/W3198293844","https://openalex.org/W4206775542","https://openalex.org/W6756395562"],"related_works":["https://openalex.org/W4292812229","https://openalex.org/W757894748","https://openalex.org/W2366009615","https://openalex.org/W4285428286","https://openalex.org/W2034734223","https://openalex.org/W2090721735","https://openalex.org/W4299568440","https://openalex.org/W1995463680","https://openalex.org/W2968050087","https://openalex.org/W2016208252"],"abstract_inverted_index":{"There":[0],"has":[1,37],"been":[2,38],"a":[3,128],"lot":[4],"of":[5,15,50,85,106],"works":[6],"about":[7],"constructing":[8],"optimal":[9,25,86,108],"LRCs":[10,27],"via":[11],"cyclic":[12,26,52,87,109],"codes":[13],"because":[14],"their":[16],"elegant":[17],"algebraic":[18],"structure":[19],"and":[20,62,98,120],"efficient":[21],"encoding":[22],"procedure.":[23],"Constructing":[24],"with":[28,55,89,111],"large":[29,34],"code":[30],"lengths":[31],"for":[32],"relatively":[33],"minimum":[35,63,99,121],"distances":[36],"an":[39],"attractive":[40],"problem.":[41],"Recently,":[42],"Fang":[43],"et":[44],"al.":[45],"firstly":[46],"constructed":[47],"two":[48,83,104],"classes":[49,84,105],"q-ary":[51],"Singleton-optimal":[53],"2-LRCs":[54],"length":[56,90,112],"n":[57],">":[58],"q":[59],"+":[60,94,96,102,116,118],"1":[61],"distance":[64,100,122],"d":[65],"=":[66,92,114],"6":[67],"in":[68],"[23].":[69],"In":[70],"this":[71],"paper,":[72],"we":[73,81],"generalize":[74],"the":[75,78],"constructions":[76],"to":[77],"(r,\u03b4)-LRCs.":[79],"Specifically,":[80],"obtain":[82],"(2,\u03b4)-LRCs":[88,110],"$n":[91,113],"\\frac{{(\\delta":[93,115],"1)(q":[95,117],"1)}}{{{2^t}}}$":[97,119],"2\u03b4":[101,123],"2,":[103],"almost":[107],"+1,":[124],"where":[125],"t":[126],"is":[127],"non-negative":[129],"integer.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}