{"id":"https://openalex.org/W2914480035","doi":"https://doi.org/10.1109/allerton.2018.8635971","title":"Streaming Codes For Variable-Size Arrivals","display_name":"Streaming Codes For Variable-Size Arrivals","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2914480035","doi":"https://doi.org/10.1109/allerton.2018.8635971","mag":"2914480035"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2018.8635971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8635971","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5058836143","display_name":"Michael Rudow","orcid":"https://orcid.org/0000-0002-6253-1689"},"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":"Michael Rudow","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University","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":["Computer Science Department, Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University","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":23,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"733","last_page":"740"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9997000098228455,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9997000098228455,"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.9983999729156494,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9950000047683716,"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/computer-science","display_name":"Computer science","score":0.7668982148170471},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7079415321350098},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.6713390350341797},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.584031879901886},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.580437958240509},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.5731421113014221},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5459056496620178},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5137906670570374},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.49574336409568787},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4873705506324768},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47971194982528687},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.4795339107513428},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.45103204250335693},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4245499074459076},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.4226698577404022},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.41773509979248047},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4170154929161072},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.41599294543266296},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3258085250854492},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.31140416860580444},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.24321722984313965},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.20353791117668152},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1558031141757965}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7668982148170471},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7079415321350098},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.6713390350341797},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.584031879901886},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.580437958240509},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.5731421113014221},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5459056496620178},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5137906670570374},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.49574336409568787},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4873705506324768},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47971194982528687},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.4795339107513428},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.45103204250335693},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4245499074459076},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.4226698577404022},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.41773509979248047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4170154929161072},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.41599294543266296},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3258085250854492},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.31140416860580444},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.24321722984313965},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.20353791117668152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1558031141757965},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2018.8635971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8635971","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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":12,"referenced_works":["https://openalex.org/W1968974808","https://openalex.org/W2031335939","https://openalex.org/W2066422082","https://openalex.org/W2113967464","https://openalex.org/W2125921054","https://openalex.org/W2143241245","https://openalex.org/W2169960398","https://openalex.org/W2540504585","https://openalex.org/W2586580216","https://openalex.org/W2962712634","https://openalex.org/W2963225233","https://openalex.org/W3100552666"],"related_works":["https://openalex.org/W2976106059","https://openalex.org/W2023731335","https://openalex.org/W2060232182","https://openalex.org/W2295671989","https://openalex.org/W2296600582","https://openalex.org/W2289440727","https://openalex.org/W2787656098","https://openalex.org/W4245031194","https://openalex.org/W2089476296","https://openalex.org/W2363930252"],"abstract_inverted_index":{"Streaming":[0],"codes":[1,7,103,146,224],"are":[2,71,174],"a":[3,10,19,26,64,98,118,141,181,186,202,213],"class":[4],"of":[5,12,31,60,72,113,124,144,204,207],"convolutional":[6],"that":[8,45,104,197],"encode":[9],"stream":[11],"source":[13,69,83,115],"packets,":[14],"which":[15,150],"arrive":[16],"sequentially":[17],"with":[18,85,180],"strict":[20],"decoding-delay":[21],"constraint,":[22],"for":[23,41,54,101,147,158,226],"transmission":[24],"over":[25],"packet-erasure":[27,43],"channel.":[28],"A":[29],"number":[30],"recent":[32],"works":[33],"have":[34,82],"proposed":[35,169,198],"capacity":[36],"achieving":[37],"streaming":[38,55,80,102,145,154,223],"code":[39,126,155,170,199],"constructions":[40,156],"adversarial":[42],"channels":[44],"include":[46],"bursts":[47],"and":[48,127,190,211],"arbitrary":[49],"erasures.":[50,137],"The":[51,108],"existing":[52,153,222],"models":[53],"codes,":[56],"to":[57],"the":[58,68,73,111,114,122,125,128,133,164,168,221],"best":[59],"our":[61],"knowledge,":[62],"consider":[63],"setting":[65],"where":[66],"all":[67],"packets":[70,84,116],"same,":[74],"fixed":[75],"size.":[76],"However,":[77],"live":[78,187],"video":[79,188],"applications":[81],"highly":[86],"variable":[87],"sizes.":[88],"Motivated":[89],"by":[90,167],"this":[91,94],"application,":[92],"in":[93,110],"paper,":[95],"we":[96,195],"present":[97,140],"generalized":[99],"model":[100],"incorporates":[105],"variable-size":[106,148],"arrivals.":[107,160,228],"variability":[109],"size":[112],"induces":[117],"new":[119],"trade-off":[120],"between":[121],"rate":[123,165,203,216],"minimum":[129],"decoding":[130],"delay":[131],"when":[132,171],"channel":[134],"introduces":[135],"no":[136],"We":[138,161],"also":[139],"simple":[142],"construction":[143,200],"arrivals,":[149],"builds":[151],"upon":[152],"designed":[157,225],"fixed-size":[159,227],"theoretically":[162],"characterize":[163],"achieved":[166],"arrival":[172],"sizes":[173],"drawn":[175],"independently":[176],"from":[177],"any":[178],"distribution":[179],"finite":[182],"support.":[183],"Furthermore,":[184],"using":[185,220],"trace":[189],"several":[191],"representative":[192],"parameter":[193],"settings,":[194],"show":[196],"achieves":[201,212],"approximately":[205],"89.5%":[206],"an":[208],"upper":[209],"bound":[210],"significantly":[214],"higher":[215],"(10%-50%)":[217],"than":[218],"naively":[219]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}