{"id":"https://openalex.org/W2093440050","doi":"https://doi.org/10.1145/2248371.2248391","title":"Throughput of rateless codes over broadcast erasure channels","display_name":"Throughput of rateless codes over broadcast erasure channels","publication_year":2012,"publication_date":"2012-06-11","ids":{"openalex":"https://openalex.org/W2093440050","doi":"https://doi.org/10.1145/2248371.2248391","mag":"2093440050"},"language":"en","primary_location":{"id":"doi:10.1145/2248371.2248391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2248371.2248391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},"type":"preprint","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/A5100397725","display_name":"Yang Yang","orcid":"https://orcid.org/0000-0003-0608-9408"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Yang","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA","The Ohio State University, Columbus, OH, USA.;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA.;","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035752536","display_name":"Ness B. Shroff","orcid":"https://orcid.org/0000-0002-4606-6879"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ness Shroff","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA","The Ohio State University, Columbus, OH, USA.;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA.;","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8632,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86828459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"125","last_page":"134"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.998199999332428,"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/throughput","display_name":"Throughput","score":0.7727087736129761},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.7039656043052673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6480557918548584},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6340913772583008},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5925843715667725},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.505720853805542},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.49404314160346985},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.49297475814819336},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.48761001229286194},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4817512035369873},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.46898964047431946},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.45946621894836426},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4546213746070862},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.4457698464393616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40722060203552246},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.401816189289093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32780322432518005},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.25463926792144775},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.19166696071624756},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1845211386680603},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17272618412971497},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.16040444374084473},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14584901928901672}],"concepts":[{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.7727087736129761},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.7039656043052673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6480557918548584},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6340913772583008},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5925843715667725},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.505720853805542},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.49404314160346985},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.49297475814819336},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.48761001229286194},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4817512035369873},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.46898964047431946},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.45946621894836426},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4546213746070862},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.4457698464393616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40722060203552246},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.401816189289093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32780322432518005},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.25463926792144775},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.19166696071624756},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1845211386680603},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17272618412971497},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.16040444374084473},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14584901928901672},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2248371.2248391","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2248371.2248391","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.748.625","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.748.625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1207.7298.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6800000071525574,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1492966477","https://openalex.org/W2018161086","https://openalex.org/W2032843418","https://openalex.org/W2059120410","https://openalex.org/W2097285691","https://openalex.org/W2134109936","https://openalex.org/W2138993731","https://openalex.org/W2152469069","https://openalex.org/W2293000460","https://openalex.org/W2296125569","https://openalex.org/W2951615571","https://openalex.org/W4229922087","https://openalex.org/W4230846739","https://openalex.org/W4290864872","https://openalex.org/W4301258660","https://openalex.org/W6674411653","https://openalex.org/W6697416319"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2140357074","https://openalex.org/W2744779861","https://openalex.org/W2113562070","https://openalex.org/W2951262303","https://openalex.org/W2031335939","https://openalex.org/W2137028263","https://openalex.org/W2951344115"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,53,86,109],"characterize":[4,45],"the":[5,24,46,57,64,79,95,111,114,133],"throughput":[6,48,58,98],"of":[7,63,72,83,103,113],"a":[8,28,70,91],"broadcast":[9],"network":[10],"with":[11,17,116],"n":[12,75,121],"receivers":[13],"using":[14],"rateless":[15],"codes":[16],"block":[18,66],"size":[19,67],"K.":[20],"We":[21,44],"assume":[22],"that":[23,33,126],"underlying":[25],"channel":[26,32],"is":[27,34,129],"Markov":[29],"modulated":[30],"erasure":[31],"i.i.d.":[35],"across":[36],"users,":[37],"but":[38],"can":[39],"be":[40],"correlated":[41],"in":[42,50],"time.":[43],"system":[47,119],"asymptotically":[49],"n.":[51,106],"Specifically,":[52],"explicitly":[54],"show":[55,110],"how":[56],"behaves":[59],"for":[60,99],"different":[61],"values":[62,102],"coding":[65],"K":[68,104],"as":[69,74],"function":[71],"n,":[73],"approaches":[76],"infinity.":[77],"Under":[78],"more":[80],"restrictive":[81],"assumption":[82],"memoryless":[84],"channels,":[85],"are":[87],"able":[88],"to":[89,118],"provide":[90],"lower":[92,136],"bound":[93,115],"on":[94],"maximum":[96],"achievable":[97],"any":[100],"finite":[101],"and":[105,122,124],"Using":[107],"simulations":[108],"tightness":[112],"respect":[117],"parameters":[120],"K,":[123],"find":[125],"its":[127],"performance":[128],"significantly":[130],"better":[131],"than":[132],"previously":[134],"known":[135],"bound.":[137]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}