{"id":"https://openalex.org/W4415367134","doi":"https://doi.org/10.1109/isit63088.2025.11195235","title":"Griesmer-Optimal Locally Repairable Codes via Lengthening Reed-Muller Codes","display_name":"Griesmer-Optimal Locally Repairable Codes via Lengthening Reed-Muller Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367134","doi":"https://doi.org/10.1109/isit63088.2025.11195235"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5031500320","display_name":"Yuan Gao","orcid":"https://orcid.org/0000-0001-9407-1528"},"institutions":[{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuan Gao","raw_affiliation_strings":["Ministry of Education, Shandong University,Key Laboratory of Cryptologic Technology and Information Security,Qingdao,China,266237"],"affiliations":[{"raw_affiliation_string":"Ministry of Education, Shandong University,Key Laboratory of Cryptologic Technology and Information Security,Qingdao,China,266237","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018855940","display_name":"Weijun Fang","orcid":"https://orcid.org/0000-0003-4121-290X"},"institutions":[{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weijun Fang","raw_affiliation_strings":["Ministry of Education, Shandong University,Key Laboratory of Cryptologic Technology and Information Security,Qingdao,China,266237"],"affiliations":[{"raw_affiliation_string":"Ministry of Education, Shandong University,Key Laboratory of Cryptologic Technology and Information Security,Qingdao,China,266237","institution_ids":["https://openalex.org/I4210132990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031500320"],"corresponding_institution_ids":["https://openalex.org/I4210132990"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34520969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.995199978351593,"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.995199978351593,"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/T12029","display_name":"DNA and Biological Computing","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9767000079154968,"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/locality","display_name":"Locality","score":0.6687999963760376},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6504999995231628},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5565000176429749},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5281000137329102},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5235000252723694}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6687999963760376},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6504999995231628},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5565000176429749},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5235000252723694},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.517799973487854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5045999884605408},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4068000018596649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3785000145435333},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3582000136375427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3416999876499176}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195235","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195235","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8545864784","display_name":null,"funder_award_id":"62201322","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1957362188","https://openalex.org/W1965097372","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2017740623","https://openalex.org/W2050500290","https://openalex.org/W2115789360","https://openalex.org/W2606784425","https://openalex.org/W2741278315","https://openalex.org/W2761980362","https://openalex.org/W2885726234","https://openalex.org/W2897751861","https://openalex.org/W2963503165","https://openalex.org/W2963890921","https://openalex.org/W2963907012","https://openalex.org/W3010113848","https://openalex.org/W3021289972","https://openalex.org/W3083398082","https://openalex.org/W3095793903","https://openalex.org/W3165372435","https://openalex.org/W3198293844","https://openalex.org/W4226213419","https://openalex.org/W4248289108","https://openalex.org/W4292937362","https://openalex.org/W4294312835","https://openalex.org/W4385864182","https://openalex.org/W4398775016","https://openalex.org/W4401517087","https://openalex.org/W4401749287","https://openalex.org/W4403675547"],"related_works":[],"abstract_inverted_index":{"Locally":[0],"repairable":[1],"codes":[2],"(LRCs)":[3],"have":[4],"attracted":[5],"considerable":[6],"attention":[7],"in":[8,16,88],"recent":[9],"years":[10],"due":[11],"to":[12,70],"their":[13,21],"practical":[14],"applications":[15],"distributed":[17],"storage":[18],"systems":[19],"and":[20,45],"inherent":[22],"theoretical":[23],"significance.":[24],"In":[25,54],"this":[26,112],"paper,":[27],"we":[28,56,100],"focus":[29],"on":[30],"alphabet-dependent":[31],"optimal":[32],"LRCs.":[33],"We":[34],"first":[35,123,149],"establish":[36],"some":[37],"new":[38],"bounds":[39],"for":[40,166],"the":[41,61,66,77,93,122,133,141,148],"code":[42],"length,":[43],"dimension":[44],"minimum":[46],"distance":[47],"of":[48,79,104,125,143,151],"<tex":[49,94,106,126,167],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[50,95,107,127,168],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(r,":[51,169],"\\delta)$</tex>-LRCs,":[52],"respectively.":[53],"particular,":[55],"propose":[57],"an":[58],"explicit":[59],"bound,":[60,63],"Griesmer-like":[62,81,115,152,164],"which":[64],"extends":[65],"classical":[67,134],"Griesmer":[68,135,157],"bound":[69,82,136,165],"accommodate":[71],"locality":[72],"constraints.":[73],"This":[74,159],"is":[75,118,147,171],"also":[76,160],"generalization":[78],"a":[80],"proposed":[83],"by":[84,91],"Hao":[85],"et":[86],"al.":[87],"2020.":[89],"Furthermore,":[90],"lengthening":[92],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q$</tex>-ary":[96],"first-order":[97],"Reed-Muller":[98],"code,":[99],"present":[101],"two":[102],"classes":[103],"(2,":[105],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q$</tex>)":[108],"-LRCs":[109],"that":[110,121,154,162],"achieve":[111],"newly":[113],"derived":[114],"bound.":[116],"It":[117],"worth":[119],"noting":[120],"class":[124,150],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(2,":[128],"q)$</tex>-LRCs":[129],"does":[130],"not":[131,156],"meet":[132],"as":[137],"linear":[138],"codes.":[139,158],"To":[140],"best":[142],"our":[144,163],"knowledge,":[145],"it":[146],"LRCs":[153],"are":[155],"implies":[161],"\\delta)$</tex>-LRCs":[170],"non-trivial.":[172]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}