{"id":"https://openalex.org/W2035272642","doi":"https://doi.org/10.1109/isit.2013.6620725","title":"Round-robin overlapping generations coding for fast content download","display_name":"Round-robin overlapping generations coding for fast content download","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2035272642","doi":"https://doi.org/10.1109/isit.2013.6620725","mag":"2035272642"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2013.6620725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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/A5067441201","display_name":"Gauri Joshi","orcid":"https://orcid.org/0000-0002-6372-9697"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gauri Joshi","raw_affiliation_strings":["EECS Department, MIT, Cambridge, MA, USA","EECS Department MIT, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EECS Department, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"EECS Department MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034577486","display_name":"Emina Soljanin","orcid":"https://orcid.org/0000-0002-7464-4242"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emina Soljanin","raw_affiliation_strings":["Bell Laboratories, Alcatel Lucent, Murray Hill, NJ, USA","[Bell Labs., Alcatel-Lucent, Murray Hill, NJ, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Alcatel Lucent, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"[Bell Labs., Alcatel-Lucent, Murray Hill, NJ, USA]","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0733,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.75357219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2740","last_page":"2744"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9980000257492065,"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.9980000257492065,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9954000115394592,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9952999949455261,"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/download","display_name":"Download","score":0.8746150732040405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.790456235408783},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5492066740989685},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5315805673599243},{"id":"https://openalex.org/keywords/file-size","display_name":"File size","score":0.485549658536911},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35793083906173706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10384488105773926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10037854313850403},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08613595366477966}],"concepts":[{"id":"https://openalex.org/C2780154274","wikidata":"https://www.wikidata.org/wiki/Q7126717","display_name":"Download","level":2,"score":0.8746150732040405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.790456235408783},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5492066740989685},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5315805673599243},{"id":"https://openalex.org/C2776029614","wikidata":"https://www.wikidata.org/wiki/Q1146367","display_name":"File size","level":2,"score":0.485549658536911},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35793083906173706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10384488105773926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10037854313850403},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08613595366477966},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2013.6620725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2013.6620725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Symposium on Information Theory","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":14,"referenced_works":["https://openalex.org/W1567268701","https://openalex.org/W2015912927","https://openalex.org/W2016312880","https://openalex.org/W2020636752","https://openalex.org/W2029712200","https://openalex.org/W2037659439","https://openalex.org/W2044758810","https://openalex.org/W2076992956","https://openalex.org/W2100134469","https://openalex.org/W2135386172","https://openalex.org/W2242700976","https://openalex.org/W2963513015","https://openalex.org/W3098978149","https://openalex.org/W3102828610"],"related_works":["https://openalex.org/W2183842793","https://openalex.org/W4255676640","https://openalex.org/W2485259751","https://openalex.org/W4236216870","https://openalex.org/W4243876796","https://openalex.org/W2485273903","https://openalex.org/W2482041988","https://openalex.org/W2497349655","https://openalex.org/W2770888382","https://openalex.org/W4287615848"],"abstract_inverted_index":{"We":[0,44],"analyze":[1,46],"the":[2,28,33,38,54,62,69,110],"download":[3,29,70,106],"time":[4,30,71],"of":[5,35,64],"a":[6,77,85],"large":[7],"file,":[8],"divided":[9],"into":[10],"chunks":[11],"called":[12],"generations,":[13,24,36,65],"and":[14,40,51,97],"transmitted":[15],"over":[16],"an":[17],"erasure":[18],"channel":[19],"without":[20],"feedback.":[21],"For":[22],"non-overlapping":[23],"we":[25,89],"derive":[26],"how":[27],"scales":[31],"with":[32,48,75],"number":[34,63],"for":[37,84],"round-robin":[39],"random":[41],"scheduling":[42],"policies.":[43],"then":[45],"coding":[47],"overlapping":[49],"generations":[50],"show":[52],"that":[53,68,93],"optimal":[55],"overlap":[56,87,91],"size":[57],"is":[58],"small":[59,78],"compared":[60],"to":[61,100],"which":[66],"implies":[67],"can":[72],"be":[73],"reduced":[74],"only":[76],"increase":[79],"in":[80],"computational":[81],"complexity.":[82],"Further,":[83],"given":[86],"size,":[88],"propose":[90],"structures":[92],"have":[94],"low":[95],"complexity":[96],"are":[98],"easy":[99],"implement,":[101],"but":[102],"still":[103],"give":[104],"file":[105],"as":[107,109],"fast":[108],"best":[111],"previously":[112],"proposed":[113],"structures.":[114]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}