{"id":"https://openalex.org/W7139087329","doi":"https://doi.org/10.1109/tit.2026.3675319","title":"On MDS Convertible Codes in the Merge Regime","display_name":"On MDS Convertible Codes in the Merge Regime","publication_year":2026,"publication_date":"2026-03-18","ids":{"openalex":"https://openalex.org/W7139087329","doi":"https://doi.org/10.1109/tit.2026.3675319"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2026.3675319","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3675319","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/A5091221122","display_name":"Vinayak Ramkumar","orcid":"https://orcid.org/0000-0001-5223-5643"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vinayak Ramkumar","raw_affiliation_strings":["Institute for Communications Engineering, Technical University of Munich, Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5223-5643","affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130169299","display_name":"Xiangliang Kong","orcid":null},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Xiangliang Kong","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Türkiye"],"raw_orcid":"https://orcid.org/0000-0002-7893-2276","affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Türkiye","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120003596","display_name":"G. Yeswanth Sai","orcid":null},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G. Yeswanth Sai","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, India"],"raw_orcid":"https://orcid.org/0009-0002-9934-2571","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Hyderabad, Kandi, India","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048702271","display_name":"Myna Vajha","orcid":"https://orcid.org/0000-0002-7770-2583"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Myna Vajha","raw_affiliation_strings":["Department of Electrical Engineering, Indian Institute of Technology Hyderabad, Kandi, India"],"raw_orcid":"https://orcid.org/0000-0002-7770-2583","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Indian Institute of Technology Hyderabad, Kandi, India","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130021528","display_name":"M. Nikhil Krishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210113248","display_name":"Indian Institute of Technology Palakkad","ror":"https://ror.org/0264cg909","country_code":"IN","type":"facility","lineage":["https://openalex.org/I4210113248"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"M. Nikhil Krishnan","raw_affiliation_strings":["Department of Electrical Engineering, Mehta Family School of Data Science and Artificial Intelligence, Indian Institute of Technology Palakkad, Palakkad, India"],"raw_orcid":"https://orcid.org/0000-0003-0089-676X","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Mehta Family School of Data Science and Artificial Intelligence, Indian Institute of Technology Palakkad, Palakkad, India","institution_ids":["https://openalex.org/I4210113248"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.4669,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.97122701,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"72","issue":"5","first_page":"2963","last_page":"2977"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9979000091552734,"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.9979000091552734,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.0005000000237487257,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.00019999999494757503,"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/erasure-code","display_name":"Erasure code","score":0.7652000188827515},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.595300018787384},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5529999732971191},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5364999771118164},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5187000036239624},{"id":"https://openalex.org/keywords/distributed-data-store","display_name":"Distributed data store","score":0.43970000743865967},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.43779999017715454},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4253999888896942},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3840999901294708},{"id":"https://openalex.org/keywords/field-size","display_name":"Field size","score":0.3734999895095825}],"concepts":[{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.7652000188827515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6244999766349792},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.595300018787384},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5529999732971191},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5364999771118164},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5187000036239624},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.43970000743865967},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4262999892234802},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4253999888896942},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C3019527723","wikidata":"https://www.wikidata.org/wiki/Q260899","display_name":"Field size","level":3,"score":0.3734999895095825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3686000108718872},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.35359999537467957},{"id":"https://openalex.org/C13021383","wikidata":"https://www.wikidata.org/wiki/Q1228738","display_name":"Disk array","level":2,"score":0.34279999136924744},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.32679998874664307},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.323199987411499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32199999690055847},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.32120001316070557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3109999895095825},{"id":"https://openalex.org/C9991821","wikidata":"https://www.wikidata.org/wiki/Q858520","display_name":"Divisibility rule","level":2,"score":0.3037000000476837},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.28929999470710754},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.2768000066280365},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C2776190703","wikidata":"https://www.wikidata.org/wiki/Q488148","display_name":"Slicing","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C121838778","wikidata":"https://www.wikidata.org/wiki/Q7619924","display_name":"Storage efficiency","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.25200000405311584},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2026.3675319","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3675319","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W2058838206","https://openalex.org/W2063121374","https://openalex.org/W2069026918","https://openalex.org/W2105185344","https://openalex.org/W2138872609","https://openalex.org/W2150777202","https://openalex.org/W2625724326","https://openalex.org/W2789573885","https://openalex.org/W2895239415","https://openalex.org/W2912094514","https://openalex.org/W2963754880","https://openalex.org/W3081411738","https://openalex.org/W4214835034","https://openalex.org/W4214884690","https://openalex.org/W4238631751","https://openalex.org/W4280601544","https://openalex.org/W4289812304","https://openalex.org/W4362714550","https://openalex.org/W4386075332","https://openalex.org/W4401070814","https://openalex.org/W4401692584","https://openalex.org/W4411484165","https://openalex.org/W4415368390","https://openalex.org/W7131679996"],"related_works":[],"abstract_inverted_index":{"In":[0,59,196],"large-scale":[1],"distributed":[2],"storage":[3,35],"systems,":[4],"erasure":[5],"coding":[6],"is":[7,218],"employed":[8],"to":[9,26,33],"ensure":[10],"reliability":[11],"against":[12],"disk":[13,28],"failures.":[14],"Recent":[15],"work":[16],"by":[17,92,148,188],"Kadekodi":[18],"et":[19],"al.":[20],"demonstrates":[21],"that":[22,96,165,182,202],"adapting":[23],"code":[24,75,171,236],"parameters":[25],"varying":[27],"failure":[29],"rates":[30],"can":[31],"lead":[32],"significant":[34],"savings":[36],"without":[37],"compromising":[38],"reliability.":[39],"Such":[40],"adaptations,":[41],"known":[42],"ascode":[43],"conversions,":[44],"motivate":[45],"the":[46,64,102,109,125,132,135,169,175,184,189,208,229],"design":[47],"ofconvertible":[48],"codes,":[49],"which":[50,67,142],"enable":[51],"efficient":[52],"transformations":[53],"between":[54],"codes":[55],"of":[56,70,82,105,211,221],"different":[57],"parameters.":[58],"this":[60],"work,":[61],"we":[62,198],"study":[63],"setting":[65],"in":[66,168,192],"\u03bb":[68,118],"codewords":[69],"an":[71],"initial":[72],"[nI=kI+rI,kI]":[73],"MDS":[74,88,190],"are":[76,166],"merged":[77],"into":[78],"a":[79,83,145,179,200,219],"single":[80],"codeword":[81],"final":[84,170],"[nF=":[85],"\u03bbkI+rF,kF=":[86],"\u03bbkI]":[87],"code.":[89],"We":[90],"begin":[91],"presenting":[93],"three":[94,160],"constructions":[95,115,161],"achieve":[97],"optimalaccess":[98],"cost,":[99,205],"defined":[100,206],"as":[101,207],"total":[103,209],"number":[104,210],"disks":[106],"accessed":[107],"during":[108,214],"conversion":[110],"process.":[111],"The":[112,139],"first":[113],"two":[114],"apply":[116],"when":[117],"\u2264rIand":[119],"impose":[120],"specific":[121],"divisibility":[122],"conditions":[123],"onrIand":[124],"field":[126,163,180],"sizeq.":[127],"These":[128],"schemes":[129],"minimize":[130],"both":[131],"per-symbol":[133],"and":[134,173,223,232],"overall":[136],"access":[137,152],"cost.":[138],"third":[140,176],"construction,":[141],"builds":[143],"on":[144,228],"prior":[146],"scheme":[147,217],"Kong,":[149],"achieves":[150,178,233],"minimal":[151],"cost":[153],"while":[154],"supporting":[155],"arbitrary":[156],"parameter":[157],"regimes.":[158],"All":[159],"require":[162],"sizes":[164],"linear":[167],"length,":[172],"notably,":[174],"construction":[177,201,226],"size":[181],"matches":[183],"lower":[185],"bound":[186],"implied":[187],"conjecture":[191],"almost":[193],"all":[194],"cases.":[195],"addition,":[197],"propose":[199],"optimizes":[203],"thebandwidth":[204],"symbols":[212],"transmitted":[213],"conversion.":[215],"This":[216],"refinement":[220],"Maturana":[222],"Rashmi\u2019s":[224],"bandwidth-optimal":[225],"based":[227],"piggybacking":[230],"framework,":[231],"reduced":[234],"sub-packetization.The":[235],"will":[237],"be":[238],"available":[239],"at":[240],"https://github.com/ZhilongNiu/SDMoMFE.":[241]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2026-03-20T00:00:00"}