{"id":"https://openalex.org/W2095009061","doi":"https://doi.org/10.1109/netcod.2013.6570818","title":"Broadcast erasure channel with feedback: The two multicast case — Algorithms and bounds","display_name":"Broadcast erasure channel with feedback: The two multicast case — Algorithms and bounds","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2095009061","doi":"https://doi.org/10.1109/netcod.2013.6570818","mag":"2095009061"},"language":"en","primary_location":{"id":"doi:10.1109/netcod.2013.6570818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2013.6570818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Symposium on Network Coding (NetCod)","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/A5008074231","display_name":"Efe Onaran","orcid":null},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Efe Onaran","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Turkey","Dept. of Electr. & Electron Eng., Bilkent Univ., Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]},{"raw_affiliation_string":"Dept. of Electr. & Electron Eng., Bilkent Univ., Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041726320","display_name":"Marios Gatzianas","orcid":"https://orcid.org/0000-0001-5056-0805"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Marios Gatzianas","raw_affiliation_strings":["School of Computer and Communication Sciences, EPFL, Switzerland","School of Computer and Communication Science, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Science, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056591688","display_name":"Christina Fragouli","orcid":"https://orcid.org/0000-0003-1002-5829"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Christina Fragouli","raw_affiliation_strings":["School of Computer and Communication Sciences, EPFL, Switzerland","School of Computer and Communication Science, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication Sciences, EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"School of Computer and Communication Science, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008074231"],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.17163318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9987000226974487,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.8642726540565491},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.8060371279716492},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7830243706703186},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.743441641330719},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6881140470504761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5494203567504883},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5201640129089355},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.47078460454940796},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4706175625324249},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.445454865694046},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4403195381164551},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4143500328063965},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.354836642742157},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3519529104232788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20660921931266785}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.8642726540565491},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8060371279716492},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7830243706703186},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.743441641330719},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6881140470504761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5494203567504883},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5201640129089355},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.47078460454940796},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4706175625324249},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.445454865694046},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4403195381164551},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4143500328063965},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.354836642742157},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3519529104232788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20660921931266785},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/netcod.2013.6570818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2013.6570818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Symposium on Network Coding (NetCod)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/27978","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/27978","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2013 International Symposium on Network Coding (NetCod)","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1944584766","https://openalex.org/W2043890573","https://openalex.org/W2056795191","https://openalex.org/W2117423557","https://openalex.org/W2123350510","https://openalex.org/W2140176463","https://openalex.org/W2143375750","https://openalex.org/W2157639858","https://openalex.org/W2167614100","https://openalex.org/W2478708596","https://openalex.org/W2985787513","https://openalex.org/W3104687609","https://openalex.org/W6640852127"],"related_works":["https://openalex.org/W1966768284","https://openalex.org/W2141226803","https://openalex.org/W1972955796","https://openalex.org/W2978800595","https://openalex.org/W2219910205","https://openalex.org/W1541857863","https://openalex.org/W207048982","https://openalex.org/W2026651734","https://openalex.org/W2385427787","https://openalex.org/W2122706277"],"abstract_inverted_index":{"We":[0,117],"consider":[1],"the":[2,33,75,111,140],"single":[3],"hop":[4],"broadcast":[5],"packet":[6],"erasure":[7,112],"channel":[8,62],"(BPEC)":[9],"with":[10,41],"two":[11],"multicast":[12],"sessions":[13],"(each":[14],"of":[15,22,61,77,136,153],"them":[16],"destined":[17],"to":[18,80,115,151],"a":[19,50,89],"different":[20],"group":[21],"N":[23,68,81,98,131],"users)":[24],"and":[25,43,64,71,99,132],"regularly":[26],"available":[27],"instantaneous":[28],"receiver":[29],"ACK/NACK":[30],"feedback.":[31],"Using":[32],"insight":[34],"gained":[35],"from":[36],"recent":[37],"work":[38],"on":[39],"BPEC":[40],"unicast":[42],"degraded":[44],"messages":[45],"[1],":[46],"[2],":[47],"we":[48,87],"propose":[49],"virtual":[51],"queue":[52],"based":[53],"session-mixing":[54],"algorithm,":[55],"which":[56,92,139],"does":[57],"not":[58,85,126],"require":[59],"knowledge":[60],"statistics":[63],"achieves":[65],"capacity":[66],"for":[67,96,106,138],"=":[69],"2":[70,83],"iid":[72],"erasures.":[73],"Since":[74],"extension":[76],"this":[78],"algorithm":[79,91],">":[82],"is":[84,100,148],"straightforward,":[86],"describe":[88],"simple":[90],"outperforms":[93],"standard":[94],"timesharing":[95],"arbitrary":[97],"actually":[101],"asymptotically":[102],"better":[103],"than":[104],"timesharing,":[105],"any":[107,145],"finite":[108],"N,":[109],"as":[110],"probability":[113],"goes":[114],"zero.":[116],"finally":[118],"provide,":[119],"through":[120],"an":[121],"information-theoretic":[122],"analysis,":[123],"sufficient":[124],"but":[125],"necessary":[127],"asymptotic":[128],"conditions":[129],"between":[130],"n":[133],"(the":[134],"number":[135],"transmissions)":[137],"achieved":[141],"sum":[142],"rate,":[143],"under":[144],"coding":[146],"scheme,":[147],"essentially":[149],"identical":[150],"that":[152],"timesharing.":[154]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}