{"id":"https://openalex.org/W4401692584","doi":"https://doi.org/10.1109/isit57864.2024.10619440","title":"On Low Field Size Constructions of Access-Optimal Convertible Codes","display_name":"On Low Field Size Constructions of Access-Optimal Convertible Codes","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401692584","doi":"https://doi.org/10.1109/isit57864.2024.10619440"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619440","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5111295062","display_name":"Saransh Chopra","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saransh Chopra","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068437513","display_name":"Francisco Maturana","orcid":"https://orcid.org/0000-0002-7532-8399"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francisco Maturana","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109919225","display_name":"K. V. Rashmi","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. V. Rashmi","raw_affiliation_strings":["Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Computer Science Department,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1456","last_page":"1461"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.989799976348877,"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.989799976348877,"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.9739999771118164,"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.9646999835968018,"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/convertible","display_name":"Convertible","score":0.7745039463043213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5367419123649597},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.43473219871520996},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33253899216651917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2643659710884094},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14190420508384705},{"id":"https://openalex.org/keywords/structural-engineering","display_name":"Structural engineering","score":0.1132485568523407}],"concepts":[{"id":"https://openalex.org/C2776116443","wikidata":"https://www.wikidata.org/wiki/Q55989","display_name":"Convertible","level":2,"score":0.7745039463043213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5367419123649597},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.43473219871520996},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33253899216651917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2643659710884094},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14190420508384705},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.1132485568523407},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619440","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619440","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1599026900","https://openalex.org/W1606480398","https://openalex.org/W1981407720","https://openalex.org/W1984748596","https://openalex.org/W1993029803","https://openalex.org/W2017741167","https://openalex.org/W2058838206","https://openalex.org/W2080132708","https://openalex.org/W2127908002","https://openalex.org/W2147092309","https://openalex.org/W2963900659","https://openalex.org/W3046701560","https://openalex.org/W3081411738","https://openalex.org/W4214835034","https://openalex.org/W4280601544","https://openalex.org/W4362714550","https://openalex.org/W4386075332","https://openalex.org/W4387377969","https://openalex.org/W4401070814","https://openalex.org/W4401692584"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W415746533","https://openalex.org/W2390279801","https://openalex.org/W4248034187","https://openalex.org/W1936751050","https://openalex.org/W2358668433","https://openalex.org/W2553104067","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Most":[0],"large-scale":[1],"storage":[2,30],"systems":[3],"employ":[4],"erasure":[5],"coding":[6],"to":[7,21,28,49],"provide":[8,181,210],"resilience":[9],"against":[10],"disk":[11,24],"failures.":[12],"Recent":[13],"work":[14],"has":[15,48],"shown":[16],"that":[17,73,222],"tuning":[18],"this":[19,84,126,178],"redundancy":[20],"changes":[22],"in":[23,100,144],"failure":[25],"rates":[26],"leads":[27],"substantial":[29],"savings.":[31],"This":[32],"process":[33],"requires":[34,166],"code":[35,47,76,97],"conversion,":[36],"wherein":[37],"data":[38,53],"encoded":[39,54],"using":[40,55],"an":[41,56,106],"<tex":[42,57],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[43,58],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$[n^{I},":[44],"k^{I}]$</tex>":[45],"initial":[46,118],"be":[50,224],"transformed":[51],"into":[52,120],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$[n^{F},":[59],"k^{F}]$</tex>":[60],"final":[61,123],"code,":[62],"a":[63,69,121,153,167,211],"resource-intensive":[64],"operation.":[65],"Convertible":[66],"codes":[67,72,140],"are":[68,130],"class":[70],"of":[71,92,96,109,156,162,213,215,219,225],"enable":[74],"efficient":[75],"conversion":[77,93,102],"while":[78],"maintaining":[79],"other":[80],"desirable":[81],"properties.":[82],"In":[83,125,177,206],"paper,":[85,179],"we":[86,180,209],"focus":[87],"on":[88,105,185],"the":[89,101,113,145,149,186],"access":[90],"cost":[91],"(total":[94],"number":[95],"symbols":[98],"accessed":[99],"process)":[103],"and":[104,194],"important":[107],"subclass":[108],"conversions":[110],"known":[111,131],"as":[112],"merge":[114,146],"regime":[115],"(combining":[116],"multiple":[117],"codewords":[119],"single":[122],"codeword).":[124],"setting,":[127],"explicit":[128,196],"constructions":[129,197],"for":[132,141,152,174,191,198,202],"systematic":[133],"access-optimal":[134],"Maximum":[135],"Distance":[136],"Separable":[137],"(MDS)":[138],"convertible":[139],"all":[142],"parameters":[143],"regime.":[147],"However,":[148],"existing":[150],"construction":[151],"key":[154],"subset":[155],"these":[157],"parameters,":[158],"which":[159],"makes":[160],"use":[161],"Vandermonde":[163,220],"parity":[164],"matrices,":[165],"large":[168],"field":[169,188,200],"size":[170,189],"making":[171],"it":[172],"unsuitable":[173],"practical":[175],"applications.":[176],"(1)":[182],"sharper":[183],"bounds":[184],"minimum":[187],"requirement":[190],"such":[192],"codes,":[193],"(2)":[195],"low":[199],"sizes":[201],"several":[203],"parameter":[204],"ranges.":[205],"doing":[207],"so,":[208],"proof":[212],"super-regularity":[214],"specially":[216],"designed":[217],"classes":[218],"matrices":[221],"could":[223],"independent":[226],"interest.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}