{"id":"https://openalex.org/W4280601544","doi":"https://doi.org/10.1109/isit50566.2022.9834604","title":"Bandwidth Cost of Code Conversions in the Split Regime","display_name":"Bandwidth Cost of Code Conversions in the Split Regime","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4280601544","doi":"https://doi.org/10.1109/isit50566.2022.9834604"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834604","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/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":true,"raw_author_name":"Francisco Maturana","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA","Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064820840","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,Pittsburgh,PA,USA","Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068437513"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":2.1456,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88215768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3262","last_page":"3267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"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":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"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.9958000183105469,"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-word","display_name":"Code word","score":0.7025888562202454},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5916988253593445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5844624638557434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4934653341770172},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.48286083340644836},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4164974093437195},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3759874701499939},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3592280447483063},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3339364528656006},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3030282258987427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24979948997497559},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14929890632629395},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11412131786346436}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7025888562202454},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5916988253593445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5844624638557434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4934653341770172},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.48286083340644836},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4164974093437195},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3759874701499939},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3592280447483063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3339364528656006},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3030282258987427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24979948997497559},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14929890632629395},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11412131786346436}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834604","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834604","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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":35,"referenced_works":["https://openalex.org/W154253821","https://openalex.org/W1515040589","https://openalex.org/W1525191317","https://openalex.org/W1533295456","https://openalex.org/W1639367088","https://openalex.org/W1905719725","https://openalex.org/W1984381334","https://openalex.org/W2014405145","https://openalex.org/W2038468909","https://openalex.org/W2061649200","https://openalex.org/W2132748742","https://openalex.org/W2157451524","https://openalex.org/W2345037611","https://openalex.org/W2625724326","https://openalex.org/W2791163388","https://openalex.org/W2885443214","https://openalex.org/W2886027572","https://openalex.org/W2915545313","https://openalex.org/W3000618282","https://openalex.org/W3017703086","https://openalex.org/W3047563314","https://openalex.org/W3081001117","https://openalex.org/W3081411738","https://openalex.org/W3101151818","https://openalex.org/W3193470889","https://openalex.org/W3196847511","https://openalex.org/W4239670432","https://openalex.org/W4280601544","https://openalex.org/W6606324823","https://openalex.org/W6632046811","https://openalex.org/W6640091283","https://openalex.org/W6759064723","https://openalex.org/W6773580028","https://openalex.org/W6781317741","https://openalex.org/W6799284208"],"related_works":["https://openalex.org/W88624181","https://openalex.org/W2910428196","https://openalex.org/W1968289971","https://openalex.org/W2895235410","https://openalex.org/W4300588357","https://openalex.org/W2090054304","https://openalex.org/W98604564","https://openalex.org/W251429526","https://openalex.org/W2304380675","https://openalex.org/W4307593709"],"abstract_inverted_index":{"Distributed":[0],"storage":[1,72],"systems":[2],"must":[3],"store":[4],"large":[5],"amounts":[6],"of":[7,12,37,54,79,83,99,119,134,219],"data":[8,16,32,120,135],"over":[9],"long":[10],"periods":[11],"time.":[13],"To":[14],"avoid":[15],"loss":[17],"due":[18],"to":[19,29,63,69,115],"device":[20,47],"failures,":[21],"an":[22,84],"[n,":[23],"k]":[24],"erasure":[25],"code":[26,96,112],"is":[27,76,160,222],"used":[28],"encode":[30],"k":[31,61,91,107,175],"symbols":[33,39],"into":[34,97,162],"a":[35,100,156],"codeword":[36,159],"n":[38,59],"that":[40,113,206],"are":[41,153,212],"stored":[42],"across":[43],"different":[44],"devices.":[45],"However,":[46],"failure":[48],"rates":[49],"change":[50],"throughout":[51],"the":[52,55,77,116,131,145,148,188,196,200],"life":[53],"data,":[56],"and":[57,60,150,155,203,211],"tuning":[58],"according":[62],"these":[64],"changes":[65],"has":[66],"been":[67],"shown":[68],"save":[70],"significant":[71],"space.":[73],"Code":[74],"conversion":[75,127,197,209],"process":[78],"converting":[80],"multiple":[81],"codewords":[82,98,165],"initial":[85,149,158],"[n":[86,102],"<sup":[87,92,103,108,167,172,176,182],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[88,93,104,109,168,173,177,183],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">I</sup>":[89,94,169],",":[90,106],"]":[95,111],"final":[101,151,164],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">F</sup>":[105,110,174,178,184],"decode":[114],"same":[117],"set":[118],"symbols.":[121],"In":[122,141],"this":[123,220],"paper,":[124],"we":[125,143],"study":[126],"bandwidth,":[128],"defined":[129],"as":[130],"total":[132],"amount":[133],"transferred":[136],"between":[137],"nodes":[138],"during":[139],"conversion.":[140],"particular,":[142],"consider":[144],"case":[146],"where":[147],"codes":[152],"MDS":[154],"single":[157],"split":[161,189,201],"several":[163],"(k":[166],"=":[170],"\u03bb":[171,181],"for":[179,214],"integer":[180],"\u2265":[185],"2),":[186],"called":[187],"regime.":[190],"We":[191],"derive":[192],"lower":[193],"bounds":[194],"on":[195],"bandwidth":[198,210],"in":[199],"regime":[202],"propose":[204],"constructions":[205],"significantly":[207],"reduce":[208],"optimal":[213],"certain":[215],"parameters.An":[216],"extended":[217],"version":[218],"paper":[221],"available":[223],"at":[224],"[1].":[225]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}