{"id":"https://openalex.org/W4415368390","doi":"https://doi.org/10.1109/isit63088.2025.11195314","title":"On Linear Field Size Access-Optimal MDS Convertible Codes","display_name":"On Linear Field Size Access-Optimal MDS Convertible Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368390","doi":"https://doi.org/10.1109/isit63088.2025.11195314"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195314","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195314","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/A5056042146","display_name":"M. Nikhil Krishnan","orcid":"https://orcid.org/0000-0003-0089-676X"},"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":true,"raw_author_name":"M. Nikhil Krishnan","raw_affiliation_strings":["Mehta Family School of Data Science &#x0026; Artificial Intelligence, IIT,Palakkad,India"],"affiliations":[{"raw_affiliation_string":"Mehta Family School of Data Science &#x0026; Artificial Intelligence, IIT,Palakkad,India","institution_ids":["https://openalex.org/I4210113248"]}]},{"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":["IIT Hyderabad,Department of Electrical Engineering,India"],"affiliations":[{"raw_affiliation_string":"IIT Hyderabad,Department of Electrical Engineering,India","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091221122","display_name":"Vinayak Ramkumar","orcid":"https://orcid.org/0000-0001-5223-5643"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Vinayak Ramkumar","raw_affiliation_strings":["Tel Aviv University,Department of Electrical Engineering-Systems,Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,Department of Electrical Engineering-Systems,Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120003596","display_name":"G. Yeswanth Sai","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":"G. Yeswanth Sai","raw_affiliation_strings":["Mehta Family School of Data Science &#x0026; Artificial Intelligence, IIT,Palakkad,India"],"affiliations":[{"raw_affiliation_string":"Mehta Family School of Data Science &#x0026; Artificial Intelligence, IIT,Palakkad,India","institution_ids":["https://openalex.org/I4210113248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053562125","display_name":"Xiangliang Kong","orcid":"https://orcid.org/0000-0002-7893-2276"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Xiangliang Kong","raw_affiliation_strings":["Tel Aviv University,Department of Electrical Engineering-Systems,Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University,Department of Electrical Engineering-Systems,Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5056042146"],"corresponding_institution_ids":["https://openalex.org/I4210113248"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37463283,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9990000128746033,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9990000128746033,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9973000288009644,"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/code-word","display_name":"Code word","score":0.7092000246047974},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6930999755859375},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6193000078201294},{"id":"https://openalex.org/keywords/field-size","display_name":"Field size","score":0.4731999933719635},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4390000104904175},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.4278999865055084},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.4244000017642975},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.42100000381469727},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.41929998993873596},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.40459999442100525}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7092000246047974},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6930999755859375},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6193000078201294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5091000199317932},{"id":"https://openalex.org/C3019527723","wikidata":"https://www.wikidata.org/wiki/Q260899","display_name":"Field size","level":3,"score":0.4731999933719635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4474000036716461},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.4278999865055084},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.4244000017642975},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.42100000381469727},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.41929998993873596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41519999504089355},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.3903999924659729},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3659000098705292},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.36419999599456787},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3564999997615814},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.34850001335144043},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.3483000099658966},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.32350000739097595},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3102000057697296},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30489999055862427},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.298799991607666},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.29670000076293945},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.2915000021457672},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.28839999437332153},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.2883000075817108},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C2776116443","wikidata":"https://www.wikidata.org/wiki/Q55989","display_name":"Convertible","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C9991821","wikidata":"https://www.wikidata.org/wiki/Q858520","display_name":"Divisibility rule","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.27399998903274536},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195314","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195314","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2058838206","https://openalex.org/W2063121374","https://openalex.org/W3081411738","https://openalex.org/W4214835034","https://openalex.org/W4280601544","https://openalex.org/W4362714550","https://openalex.org/W4386075332","https://openalex.org/W4401070814","https://openalex.org/W4401692584"],"related_works":[],"abstract_inverted_index":{"In":[0,84,159],"large-scale":[1],"distributed":[2],"storage":[3,31],"systems,":[4],"erasure":[5],"coding":[6],"provides":[7],"reliability":[8],"against":[9],"disk":[10,25],"failures.":[11],"Recent":[12],"work":[13],"by":[14,220],"Kadekodi":[15],"et":[16],"al.":[17],"demonstrates":[18],"that":[19],"adapting":[20],"code":[21,41,55,106,126,166,234,247],"parameters":[22],"to":[23,30,74,80,155],"varying":[24],"failure":[26],"rates":[27],"can":[28],"lead":[29],"savings,":[32],"without":[33],"compromising":[34],"reliability.":[35],"During":[36],"such":[37],"adaptations":[38],"(also":[39],"called":[40],"conversions),":[42],"data":[43],"encoded":[44],"with":[45],"multiple":[46,59],"codewords":[47,60,97],"of":[48,61,98,113,146,216,244],"an":[49,99,217],"initial":[50,76,100,125],"[<tex":[51],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[52,65,93,102,117,173,184,191],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$n^{I},":[53],"k^{I}$</tex>]":[54],"are":[56,107,128,136],"transformed":[57],"into":[58,109],"a":[62,110,114,214],"final":[63,78,115,132,246],"<tex":[64,92,101,116,172,183,190],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\left[n^{F},":[66],"k^{F}\\right]$</tex>":[67],"code.":[68,123],"The":[69,139,168,211],"convertible":[70,165,257],"codes":[71,79,258],"framework":[72],"aims":[73],"design":[75],"and":[77,177,186,206,227,248],"enable":[81],"resource-efficient":[82],"conversions.":[83],"this":[85,160],"paper,":[86,161],"we":[87,162],"study":[88],"the":[89,131,143,152,187,196,223,233,241,245,250,260],"scenario":[90],"where":[91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda":[94,174],"\\geq":[95],"2$</tex>":[96],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\left[n^{I}=k^{I}+r^{I},":[103],"k^{I}\\right]$</tex>":[104,121],"MDS":[105,122,256],"merged":[108],"single":[111],"codeword":[112],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\left[n^{F}=\\lambda":[118],"k^{I}+r^{F},":[119],"k^{F}=\\lambda":[120],"Some":[124],"symbols":[127,147,209],"retained":[129],"in":[130,240,259],"codeword,":[133],"while":[134],"others":[135],"newly":[137],"generated.":[138],"access":[140,197,225],"cost":[141,198,226],"is":[142],"total":[144],"number":[145],"read":[148],"or":[149],"written":[150],"during":[151],"conversion":[153],"procedure":[154],"produce":[156],"new":[157,203],"symbols.":[158],"present":[163],"three":[164],"constructions.":[167],"first":[169],"two":[170],"require":[171,236],"\\leq":[175],"r^{I}$</tex>":[176],"impose":[178],"certain":[179],"divisibility":[180],"conditions":[181],"on":[182],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$r^{I}$</tex>":[185],"field":[188,237,253],"size":[189],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$q$</tex>.":[192],"However,":[193],"they":[194],"minimize":[195],"incurred":[199],"for":[200,207,229],"generating":[201],"each":[202],"symbol":[204],"individually":[205],"all":[208,230],"cumulatively.":[210],"third":[212],"construction,":[213],"modification":[215],"earlier":[218],"construction":[219],"Kong,":[221],"minimizes":[222],"cumulative":[224],"works":[228],"parameters.":[231],"All":[232],"constructions":[235],"sizes":[238,254],"linear":[239],"block":[242],"length":[243],"achieve":[249],"smallest":[251],"known":[252],"across":[255],"literature.":[261]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}