{"id":"https://openalex.org/W7131679996","doi":"https://doi.org/10.1109/tit.2026.3668262","title":"Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion Into LRCs","display_name":"Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion Into LRCs","publication_year":2026,"publication_date":"2026-02-26","ids":{"openalex":"https://openalex.org/W7131679996","doi":"https://doi.org/10.1109/tit.2026.3668262"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2026.3668262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3668262","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/A5126860824","display_name":"Haoming Shi","orcid":null},"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":"Haoming Shi","raw_affiliation_strings":["State Key Laboratory of Cryptography and Digital Economy Security, the Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao, China"],"raw_orcid":"https://orcid.org/0009-0006-9562-7309","affiliations":[{"raw_affiliation_string":"State Key Laboratory of Cryptography and Digital Economy Security, the Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao, China","institution_ids":["https://openalex.org/I4210132990"]}]},{"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/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":["State Key Laboratory of Cryptography and Digital Economy Security, the Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao, China"],"raw_orcid":"https://orcid.org/0000-0003-4121-290X","affiliations":[{"raw_affiliation_string":"State Key Laboratory of Cryptography and Digital Economy Security, the Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao, China","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yuan Gao","orcid":"https://orcid.org/0000-0001-8541-8948"},"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":"Yuan Gao","raw_affiliation_strings":["State Key Laboratory of Cryptography and Digital Economy Security, the Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao, China"],"raw_orcid":"https://orcid.org/0000-0001-8541-8948","affiliations":[{"raw_affiliation_string":"State Key Laboratory of Cryptography and Digital Economy Security, the Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, and the School of Cyber Science and Technology, Shandong University, Qingdao, China","institution_ids":["https://openalex.org/I4210132990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"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.27788478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"5","first_page":"2841","last_page":"2860"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.21870000660419464,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.21870000660419464,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.12849999964237213,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.08259999752044678,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5974000096321106},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.539900004863739},{"id":"https://openalex.org/keywords/distributed-data-store","display_name":"Distributed data store","score":0.48030000925064087},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48030000925064087},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48010000586509705},{"id":"https://openalex.org/keywords/combinatorial-design","display_name":"Combinatorial design","score":0.41780000925064087},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4131999909877777},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4068000018596649},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.3580999970436096}],"concepts":[{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5974000096321106},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.539900004863739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49309998750686646},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.48030000925064087},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48030000925064087},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48010000586509705},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.41780000925064087},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4131999909877777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41100001335144043},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3928000032901764},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.3580999970436096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35530000925064087},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.35440000891685486},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.33180001378059387},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.3158000111579895},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.3116999864578247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31150001287460327},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.28850001096725464},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.27459999918937683},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.26739999651908875},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.262800008058548},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.2615000009536743},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.25619998574256897},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2026.3668262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3668262","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1589626063","display_name":null,"funder_award_id":"ZR2022QA031","funder_id":"https://openalex.org/F4320324174","funder_display_name":"Natural Science Foundation of Shandong Province"},{"id":"https://openalex.org/G1677507391","display_name":null,"funder_award_id":"2021YFA1001000","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"id":"https://openalex.org/G2483305767","display_name":null,"funder_award_id":"ZR2025QA05","funder_id":"https://openalex.org/F4320336925","funder_display_name":"Shandong Provincial Postdoctoral Science Foundation"},{"id":"https://openalex.org/G3195131139","display_name":null,"funder_award_id":"62571301","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8377584638","display_name":null,"funder_award_id":"2022YFA1004900","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"},{"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"},{"id":"https://openalex.org/F4320324174","display_name":"Natural Science Foundation of Shandong Province","ror":null},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null},{"id":"https://openalex.org/F4320336925","display_name":"Shandong Provincial Postdoctoral Science Foundation","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Error-correcting":[0],"codes":[1,121,137,172,206,213,238],"are":[2,122,245],"essential":[3],"for":[4,113],"ensuring":[5],"fault":[6],"tolerance":[7],"in":[8,15,32,190],"modern":[9],"distributed":[10],"data":[11],"storage":[12,24,41],"systems.":[13],"However,":[14],"practice,":[16],"factors":[17],"such":[18],"as":[19,54],"the":[20,35,75,91,95,117,142,191,195,221,228,255],"failure":[21],"rates":[22],"of":[23,61,79,133,141,145,203,223,233,242],"devices":[25],"can":[26],"vary":[27],"significantly":[28],"over":[29,247],"time,":[30],"resulting":[31],"changes":[33],"to":[34,65,168,214],"optimal":[36,231],"code":[37,55,62,97,234,256],"parameters.":[38],"To":[39,220],"reduce":[40],"cost":[42,93],"while":[43],"maintaining":[44],"efficiency,":[45],"Maturana":[46],"and":[47,77,107,119,239],"Rashmi":[48],"introduced":[49],"a":[50,86,131,146,201],"theoretical":[51],"framework":[52],"known":[53,111],"conversion,":[56,115],"which":[57],"enables":[58],"dynamic":[59],"adjustment":[60],"parameters":[63],"according":[64],"device":[66],"performance.":[67],"In":[68],"this":[69,226],"paper,":[70],"we":[71,84,199],"focus":[72],"exclusively":[73],"on":[74,90],"bounds":[76,112],"constructions":[78,244],"generalized":[80],"merge-convertible":[81],"codes.":[82,127],"First,":[83],"establish":[85],"new":[87],"lower":[88],"bound":[89,105],"access":[92],"when":[94],"final":[96,120],"is":[98,151,157,227],"an":[99,215],"(<italic":[100,177,216],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[101,178,217],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">r</i>,":[102,179,218],"\u03b4)-LRC.":[103,219],"This":[104],"unifies":[106],"generalizes":[108],"all":[109],"previously":[110,188],"merge":[114,209],"where":[116],"initial":[118],"either":[123],"LRCs":[124],"or":[125],"MDS":[126,135,212,237],"We":[128,163],"then":[129],"construct":[130],"family":[132],"access-optimal":[134,170,204],"convertible":[136,171,205],"by":[138],"leveraging":[139],"subgroups":[140],"automorphism":[143],"group":[144],"rational":[147],"function":[148],"field.":[149],"It":[150],"worth":[152],"noting":[153],"that":[154,173,184,207],"our":[155,165,224,243],"construction":[156,167,202,232],"also":[158],"per-symbol":[159],"read":[160],"access-optimal.":[161],"Next,":[162],"extend":[164],"MDS-based":[166],"design":[169],"enable":[174,208],"conversion":[175,210,235],"between":[176,236],"\u03b4)-LRCs":[180],"with":[181,254],"parameter":[182],"regimes":[183],"have":[185],"not":[186],"been":[187],"reported":[189],"literature.":[192],"Finally,":[193],"using":[194],"parity-check":[196],"matrix":[197],"approach,":[198],"present":[200],"from":[211],"best":[222],"knowledge,":[225],"first":[229],"explicit":[230],"LRCs.":[240],"All":[241],"performed":[246],"finite":[248],"fields":[249],"whose":[250],"sizes":[251],"grow":[252],"linearly":[253],"length.":[257]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2026-02-27T00:00:00"}