{"id":"https://openalex.org/W3000618282","doi":"https://doi.org/10.4230/lipics.itcs.2020.66","title":"Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage","display_name":"Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage","alternate_titles":[],"publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3000618282","doi":"https://doi.org/10.4230/lipics.itcs.2020.66","mag":"3000618282"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:11751","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.66","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol151-itcs2020/LIPIcs.ITCS.2020.66/LIPIcs.ITCS.2020.66.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W6929100641","display_name":"LIPIcs, Volume 151, ITCS'20, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W3000618282","https://openalex.org/W6929100641"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol151-itcs2020/LIPIcs.ITCS.2020.66/LIPIcs.ITCS.2020.66.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Maturana, Francisco","orcid":"https://orcid.org/0000-0002-7532-8399","observed_orcids":["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":"Maturana, Francisco","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie Mellon University, Pittsburgh, United States"],"raw_orcid":"https://orcid.org/0000-0002-7532-8399","affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, United States","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109919225","display_name":"K. V. Rashmi","orcid":"https://orcid.org/0000-0002-2227-7460","observed_orcids":["https://orcid.org/0000-0002-2227-7460"]},"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":"Rashmi, K. V.","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie Mellon University, Pittsburgh, United States"],"raw_orcid":"https://orcid.org/0000-0002-2227-7460","affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, United States","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":1.3622,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.80639183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"26","last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.8270999789237976,"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.8270999789237976,"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.15299999713897705,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.002400000113993883,"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/code-translation","display_name":"program translation","score":0.9330000281333923},{"id":"https://openalex.org/keywords/erasure-codes","display_name":"erasure coding","score":0.8529999852180481},{"id":"https://openalex.org/keywords/distributed-storage","display_name":"distributed storage","score":0.9350000023841858},{"id":"https://openalex.org/keywords/mds-codes","display_name":"MDS codes","score":0.902999997138977},{"id":"https://openalex.org/keywords/code-rate-adaptation","display_name":"code rate adaptation","score":0.6510000228881836},{"id":"https://openalex.org/keywords/storage-space-efficiency","display_name":"storage space efficiency","score":0.5130000114440918}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7139739394187927},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6567700505256653},{"id":"https://openalex.org/C24885549","wikidata":"https://www.wikidata.org/wiki/Q339678","display_name":"Distributed data store","level":2,"score":0.48484623432159424},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47550708055496216},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4708380699157715},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4161117970943451},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4077605605125427},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3677859306335449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34884941577911377},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.22622740268707275},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.225029855966568},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:11751","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.66","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol151-itcs2020/LIPIcs.ITCS.2020.66/LIPIcs.ITCS.2020.66.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.itcs.2020.66","doi":"https://doi.org/10.4230/lipics.itcs.2020.66","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2020.66","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:3000618282","doi":null,"is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2020/11751/pdf/LIPIcs-ITCS-2020-66.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418069","display_name":"Conference on Innovations in Theoretical Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Conference on Innovations in Theoretical Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:11751","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.66","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol151-itcs2020/LIPIcs.ITCS.2020.66/LIPIcs.ITCS.2020.66.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3000618282.pdf","grobid_xml":"https://content.openalex.org/works/W3000618282.grobid-xml"},"referenced_works_count":65,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1639367088","https://openalex.org/W1647846156","https://openalex.org/W1715633553","https://openalex.org/W1957362188","https://openalex.org/W1964716404","https://openalex.org/W1977073502","https://openalex.org/W1991499930","https://openalex.org/W1993830711","https://openalex.org/W1997044393","https://openalex.org/W2014149071","https://openalex.org/W2022619326","https://openalex.org/W2056826630","https://openalex.org/W2058838206","https://openalex.org/W2060646539","https://openalex.org/W2061649200","https://openalex.org/W2069026918","https://openalex.org/W2069554151","https://openalex.org/W2078872683","https://openalex.org/W2105185344","https://openalex.org/W2105695025","https://openalex.org/W2107577262","https://openalex.org/W2111915261","https://openalex.org/W2124961791","https://openalex.org/W2126295689","https://openalex.org/W2137291643","https://openalex.org/W2147343704","https://openalex.org/W2147527217","https://openalex.org/W2150620836","https://openalex.org/W2150777202","https://openalex.org/W2154063365","https://openalex.org/W2157451524","https://openalex.org/W2158398747","https://openalex.org/W2163775180","https://openalex.org/W2171283709","https://openalex.org/W2207060061","https://openalex.org/W2339524574","https://openalex.org/W2406285756","https://openalex.org/W2507181206","https://openalex.org/W2571441006","https://openalex.org/W2577154367","https://openalex.org/W2582551733","https://openalex.org/W2606114015","https://openalex.org/W2621084366","https://openalex.org/W2625724326","https://openalex.org/W2746373998","https://openalex.org/W2749048498","https://openalex.org/W2765728635","https://openalex.org/W2793848434","https://openalex.org/W2885443214","https://openalex.org/W2886027572","https://openalex.org/W2887892895","https://openalex.org/W2898024058","https://openalex.org/W2902882503","https://openalex.org/W2910298035","https://openalex.org/W2915545313","https://openalex.org/W2950353718","https://openalex.org/W2951356926","https://openalex.org/W2963431689","https://openalex.org/W2963754880","https://openalex.org/W2963781977","https://openalex.org/W2963783151","https://openalex.org/W2964316655","https://openalex.org/W2964329029","https://openalex.org/W4238584892"],"related_works":["https://openalex.org/W2965061203","https://openalex.org/W4214835034","https://openalex.org/W7139087329","https://openalex.org/W7220924151","https://openalex.org/W4362714550","https://openalex.org/W4415368390","https://openalex.org/W3081411738","https://openalex.org/W7166061561","https://openalex.org/W7124417828"],"abstract_inverted_index":{"Erasure":[0],"codes":[1,121,242,270],"are":[2,43,244],"typically":[3],"used":[4,211],"in":[5,15,84,90,98,111,119,129,192,250,277],"large-scale":[6],"distributed":[7],"storage":[8,48,67,99],"systems":[9],"to":[10,28,38,92,138,290,300],"provide":[11],"durability":[12],"of":[13,18,25,66,78,106,142,148,184,224,239,266,275,304],"data":[14,118,150,158],"the":[16,63,76,79,85,103,112,140,146,172,204,209,222,251,278,301],"face":[17],"failures.":[19],"In":[20,230],"this":[21,127,130],"setting,":[22],"a":[23,82,109,135,181,193,256,272],"set":[24],"k":[26],"blocks":[27,41],"be":[29],"stored":[30,45],"is":[31,122,235,287],"encoded":[32,117,151,159],"using":[33],"an":[34,153,161,197,236],"[n,":[35],"k]":[36],"code":[37,80,113,143,156,164,185,190,228,292],"generate":[39],"n":[40,87],"that":[42,62,74,187,243,285],"then":[44,177,261],"on":[46,115,221],"different":[47],"nodes.":[49],"A":[50],"recent":[51],"work":[52,131],"by":[53,126],"Kadekodi":[54],"et":[55,58],"al.":[56],"[Kadekodi":[57],"al.,":[59],"2019]":[60],"shows":[61],"failure":[64],"rate":[65,77,114],"devices":[68],"vary":[69],"significantly":[70,295],"over":[71],"time,":[72],"and":[73,88,213],"changing":[75],"(via":[81],"change":[83,110],"parameters":[86,276],"k)":[89],"response":[91],"such":[93,108,170],"variations":[94],"provides":[95],"significant":[96],"reduction":[97],"space":[100],"requirement.":[101],"However,":[102],"resource":[104],"overhead":[105],"realizing":[107],"already":[116],"traditional":[120],"prohibitively":[123],"high.":[124],"Motivated":[125],"application,":[128],"we":[132,202,217],"first":[133],"present":[134,262],"new":[136,182],"framework":[137],"formalize":[139],"notion":[141],"conversion":[144],"-":[145],"process":[147],"converting":[149],"with":[152,160,208,255,294],"[n^I,":[154],"k^I]":[155],"into":[157],"[n^F,":[162],"k^F]":[163],"while":[165],"maintaining":[166],"desired":[167],"decodability":[168,215],"properties,":[169],"as":[171,298],"maximum-distance-separable":[173],"(MDS)":[174],"property.":[175],"We":[176,260],"introduce":[178],"convertible":[179,241,269],"codes,":[180],"class":[183],"pairs":[186],"allow":[188],"for":[189,246,271],"conversions":[191,293],"resource-efficient":[194],"manner.":[195],"For":[196],"important":[198],"parameter":[199,248],"regime":[200,253],"(which":[201],"call":[203],"merge":[205,252,279],"regime)":[206],"along":[207],"widely":[210],"linearity":[212],"MDS":[214,240,268],"constraint,":[216],"prove":[218],"tight":[219],"bounds":[220],"number":[223],"nodes":[225],"accessed":[226],"during":[227],"conversion.":[229],"particular,":[231],"our":[232],"achievability":[233],"result":[234],"explicit":[237,263],"construction":[238],"optimal":[245,267],"all":[247],"values":[249],"albeit":[254],"high":[257],"field":[258],"size.":[259],"low-field-size":[264],"constructions":[265],"broad":[273],"range":[274],"regime.":[280],"Our":[281],"results":[282],"thus":[283],"show":[284],"it":[286],"indeed":[288],"possible":[289],"achieve":[291],"lesser":[296],"resources":[297],"compared":[299],"default":[302],"approach":[303],"re-encoding.":[305]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3000618282","counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2020-01-23T00:00:00"}
