{"id":"https://openalex.org/W2100134469","doi":"https://doi.org/10.1109/tit.2010.2095111","title":"Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding","display_name":"Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding","publication_year":2011,"publication_date":"2011-01-21","ids":{"openalex":"https://openalex.org/W2100134469","doi":"https://doi.org/10.1109/tit.2010.2095111","mag":"2100134469"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2095111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2095111","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1011.3498","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yao Li","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yao Li","raw_affiliation_strings":["WINLAB, Department of Electrical and Computer Engineering, Rutgers University, North Brunswick, NJ, USA"],"affiliations":[{"raw_affiliation_string":"WINLAB, Department of Electrical and Computer Engineering, Rutgers University, North Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Emina Soljanin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emina Soljanin","raw_affiliation_strings":["Mathematics of Networking and Communication Department, Enabling Computing Technologies, Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Mathematics of Networking and Communication Department, Enabling Computing Technologies, Bell Laboratories, Alcatel-Lucent, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Predrag Spasojevic","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Predrag Spasojevic","raw_affiliation_strings":["WINLAB, Department of Electrical and Computer Engineering, Rutgers University, North Brunswick, NJ, USA"],"affiliations":[{"raw_affiliation_string":"WINLAB, Department of Electrical and Computer Engineering, Rutgers University, North Brunswick, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":8.0393,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.9765655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"57","issue":"2","first_page":"1111","last_page":"1123"},"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.9473000168800354,"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.9473000168800354,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.006099999882280827,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.005400000140070915,"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/decoding-methods","display_name":"Decoding methods","score":0.7171000242233276},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6991999745368958},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6152999997138977},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5927000045776367},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5511000156402588},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.550599992275238},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.484499990940094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7434999942779541},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7171000242233276},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6991999745368958},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6152999997138977},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5927000045776367},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5511000156402588},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4036000072956085},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.37139999866485596},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.35899999737739563},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.3483000099658966},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29100000858306885},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2010.2095111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2095111","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1011.3498","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1011.3498","pdf_url":"https://arxiv.org/pdf/1011.3498","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1011.3498","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1011.3498","pdf_url":"https://arxiv.org/pdf/1011.3498","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1973349463","https://openalex.org/W2005830269","https://openalex.org/W2064012840","https://openalex.org/W2089295423","https://openalex.org/W2107520978","https://openalex.org/W2124990550","https://openalex.org/W2130350209","https://openalex.org/W2135386172","https://openalex.org/W2318076643","https://openalex.org/W2570615383","https://openalex.org/W6664008069"],"related_works":[],"abstract_inverted_index":{"To":[0,48],"reduce":[1],"computational":[2,111],"complexity":[3,112],"and":[4,12,104,113],"delay":[5],"in":[6,120],"randomized":[7],"network":[8],"coded":[9,78],"content":[10,25,87],"distribution,":[11],"for":[13,81,137],"some":[14],"other":[15],"practical":[16],"reasons,":[17],"coding":[18,55],"is":[19,45],"not":[20,102],"performed":[21],"simultaneously":[22],"over":[23,28,56],"all":[24],"blocks,":[26,36],"but":[27],"much":[29],"smaller,":[30],"possibly":[31],"overlapping":[32],"subsets":[33],"of":[34,42,77,84,93],"these":[35],"known":[37],"as":[38,62,88,90],"generations.":[39],"A":[40],"penalty":[41],"this":[43],"strategy":[44],"throughput":[46,51,124,135],"reduction.":[47],"analyze":[49],"the":[50,74,85,91,108,121],"loss,":[52],"we":[53],"model":[54,69],"generations":[57,100,131],"with":[58,116],"random":[59],"generation":[60,122,140],"scheduling":[61],"a":[63,117],"coupon":[64],"collector's":[65],"brotherhood":[66],"problem.":[67],"This":[68],"enables":[70],"us":[71],"to":[72,106],"derive":[73],"expected":[75],"number":[76],"packets":[79],"needed":[80],"successful":[82],"decoding":[83,94],"entire":[86],"well":[89],"probability":[92],"failure":[95],"(the":[96],"latter":[97],"only":[98],"when":[99],"do":[101],"overlap)":[103],"further,":[105],"quantify":[107],"tradeoff":[109],"between":[110,130],"throughput.":[114],"Interestingly,":[115],"moderate":[118],"increase":[119],"size,":[123],"quickly":[125],"approaches":[126],"link":[127],"capacity.":[128],"Overlaps":[129],"can":[132],"further":[133],"improve":[134],"substantially":[136],"relatively":[138],"small":[139],"sizes.":[141]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2016-06-24T00:00:00"}