{"id":"https://openalex.org/W2120030211","doi":"https://doi.org/10.1109/isit.2011.6033713","title":"One packet suffices - Highly efficient packetized Network Coding With finite memory","display_name":"One packet suffices - Highly efficient packetized Network Coding With finite memory","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2120030211","doi":"https://doi.org/10.1109/isit.2011.6033713","mag":"2120030211"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","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/A5080591933","display_name":"Bernhard Haeupler","orcid":"https://orcid.org/0000-0003-3381-0459"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bernhard Haeupler","raw_affiliation_strings":["RLE, CSAIL, Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"RLE, CSAIL, Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075370174","display_name":"Muriel M\u00e9dard","orcid":"https://orcid.org/0000-0003-4059-407X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muriel Medard","raw_affiliation_strings":["RLE, Massachusetts Institute of Technology, USA","RLE, Massachusetts Institute of Technology,USA"],"affiliations":[{"raw_affiliation_string":"RLE, Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"RLE, Massachusetts Institute of Technology,USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080591933"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.8006,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.90997806,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1151","last_page":"1155"},"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.9998999834060669,"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.9998999834060669,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9645000100135803,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9452000260353088,"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/linear-network-coding","display_name":"Linear network coding","score":0.8740211129188538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8559252023696899},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6504427194595337},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5138521194458008},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.49624353647232056},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4961920380592346},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4784305691719055},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.45710429549217224},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4403068721294403}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8740211129188538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8559252023696899},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6504427194595337},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5138521194458008},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.49624353647232056},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4961920380592346},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4784305691719055},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.45710429549217224},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4403068721294403},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2011.6033713","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033713","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","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":19,"referenced_works":["https://openalex.org/W2007546147","https://openalex.org/W2016312880","https://openalex.org/W2043056692","https://openalex.org/W2048235391","https://openalex.org/W2090960495","https://openalex.org/W2094856687","https://openalex.org/W2099805730","https://openalex.org/W2099871174","https://openalex.org/W2120741723","https://openalex.org/W2123350510","https://openalex.org/W2123938134","https://openalex.org/W2143752912","https://openalex.org/W2145096872","https://openalex.org/W2146466672","https://openalex.org/W2151893328","https://openalex.org/W3100125338","https://openalex.org/W3124613635","https://openalex.org/W6681610611","https://openalex.org/W6682257778"],"related_works":["https://openalex.org/W2755490834","https://openalex.org/W2051294371","https://openalex.org/W2960282440","https://openalex.org/W3125481297","https://openalex.org/W2501473353","https://openalex.org/W2963693149","https://openalex.org/W2589968180","https://openalex.org/W2064166548","https://openalex.org/W43103193","https://openalex.org/W1670167048"],"abstract_inverted_index":{"Random":[0],"Linear":[1],"Network":[2],"Coding":[3],"(RLNC)":[4],"has":[5,81],"emerged":[6],"as":[7,84,200],"a":[8,17,67,85,99,123,209],"powerful":[9],"tool":[10],"for":[11,61,148],"robust":[12],"high-throughput":[13],"multicast.":[14],"Projection":[15],"analysis,":[16,172,204],"recently":[18],"introduced":[19],"technique,":[20],"shows":[21,114],"that":[22,70,88,175,219],"the":[23,40,74,103,115,170,181,197,201],"distributed":[24],"packetized":[25],"RLNC":[26,156,182],"protocol":[27,157,183],"achieves":[28],"(order)":[29],"optimal":[30,188],"and":[31,92,146,165],"perfectly":[32],"pipelined":[33],"information":[34],"dissemination":[35],"in":[36,66,119,143,176,179,208,226],"many":[37],"settings.":[38],"In":[39,196],"original":[41,202],"approach":[42],"to":[43,56,131,152,186],"RNLC":[44],"intermediate":[45,54],"nodes":[46,55],"code":[47],"together":[48],"all":[49,120,177],"available":[50,60],"information.":[51],"This":[52,112,150],"requires":[53],"keep":[57],"considerable":[58],"data":[59],"coding.":[62],"Moreover,":[63],"it":[64],"results":[65],"coding":[68,94,108,129],"complexity":[69],"grows":[71],"linearly":[72],"with":[73,122,159],"size":[75],"of":[76,102,106,126,212],"this":[77,80],"data.":[78],"While":[79],"been":[82],"identified":[83],"problem,":[86],"approaches":[87],"combine":[89],"queuing":[90],"theory":[91],"network":[93,107,128,213],"have":[95],"heretofore":[96],"not":[97],"provided":[98],"succinct":[100],"representation":[101],"memory":[104,145,166,191],"needs":[105],"at":[109,223],"intermediates":[110],"nodes.":[111],"paper":[113],"surprising":[116],"result":[117],"that,":[118],"settings":[121,178],"continuous":[124],"stream":[125],"data,":[127],"continues":[130],"perform":[132],"optimally":[133],"even":[134],"if":[135],"only":[136],"one":[137],"packet":[138],"per":[139],"node":[140],"is":[141],"kept":[142],"active":[144],"used":[147],"computations.":[149],"leads":[151],"an":[153,227],"extremely":[154],"simple":[155],"variant":[158,192],"drastically":[160],"reduced":[161],"requirements":[162],"on":[163],"computational":[164],"resources.":[167],"By":[168],"extending":[169],"projection":[171,203],"we":[173],"show":[174],"which":[180],"was":[184],"proven":[185],"be":[187],"its":[189],"finite":[190],"performs":[193],"equally":[194],"well.":[195],"same":[198],"way":[199],"our":[205],"technique":[206],"applies":[207],"wide":[210],"variety":[211],"models,":[214],"including":[215],"highly":[216],"dynamic":[217],"topologies":[218],"can":[220],"change":[221],"completely":[222],"any":[224],"time":[225],"adversarial":[228],"fashion.":[229]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-25T21:42:39.735039","created_date":"2025-10-10T00:00:00"}