{"id":"https://openalex.org/W2742199877","doi":"https://doi.org/10.1109/isit.2017.8006518","title":"A new capacity-approaching protocol for general 1-to-K broadcast packet erasure channels with ACK/NACK","display_name":"A new capacity-approaching protocol for general 1-to-K broadcast packet erasure channels with ACK/NACK","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2742199877","doi":"https://doi.org/10.1109/isit.2017.8006518","mag":"2742199877"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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/A5055259930","display_name":"Chih-Hua Chang","orcid":"https://orcid.org/0000-0002-4546-7814"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chih-Hua Chang","raw_affiliation_strings":["School of ECE, Purdue University"],"affiliations":[{"raw_affiliation_string":"School of ECE, Purdue University","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006311047","display_name":"Chih-Chun Wang","orcid":"https://orcid.org/0000-0002-1685-820X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chih-Chun Wang","raw_affiliation_strings":["School of ECE, Purdue University"],"affiliations":[{"raw_affiliation_string":"School of ECE, Purdue University","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055259930"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.2072,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55950968,"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":"201","last_page":"205"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9926000237464905,"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/T11478","display_name":"Caching and Content Delivery","score":0.9904999732971191,"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/computer-science","display_name":"Computer science","score":0.7307896018028259},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7098589539527893},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.689146876335144},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.597937822341919},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5004055500030518},{"id":"https://openalex.org/keywords/byte","display_name":"Byte","score":0.44789937138557434},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.44468769431114197},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.430231511592865},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4241408407688141},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3950236439704895},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.22842836380004883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18424561619758606}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7307896018028259},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7098589539527893},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.689146876335144},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.597937822341919},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5004055500030518},{"id":"https://openalex.org/C43364308","wikidata":"https://www.wikidata.org/wiki/Q8799","display_name":"Byte","level":2,"score":0.44789937138557434},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.44468769431114197},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.430231511592865},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4241408407688141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3950236439704895},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.22842836380004883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18424561619758606},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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.2017.8006518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1639669715","https://openalex.org/W2025994599","https://openalex.org/W2031381592","https://openalex.org/W2106403318","https://openalex.org/W2124982134","https://openalex.org/W2555338699","https://openalex.org/W3105020631","https://openalex.org/W3105807832"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2140357074","https://openalex.org/W2002203372","https://openalex.org/W2113562070","https://openalex.org/W2810502498","https://openalex.org/W2743670993","https://openalex.org/W2028268383","https://openalex.org/W2130675906"],"abstract_inverted_index":{"The":[0],"capacity":[1,52,79,88,110],"region":[2,43,74,80,95],"of":[3,39,68,179],"1-to-K":[4],"broadcast":[5],"packet":[6,122,130,158],"erasure":[7],"channels":[8],"with":[9,63,140],"ACK/NACK":[10],"is":[11,45,75,89,96,136],"known":[12],"for":[13,81,145],"some":[14],"scenarios,":[15],"e.g.,":[16],"K":[17,146],"\u2264":[18],"3,":[19],"etc.":[20],"However,":[21],"existing":[22,101],"achievability":[23],"schemes":[24],"either":[25],"require":[26],"knowing":[27],"the":[28,40,51,64,78,83,87,180],"target":[29],"rate":[30,42,73,94,111],"R":[31],"in":[32,85],"advance,":[33],"and/or":[34],"have":[35],"a":[36,58],"complicated":[37],"description":[38],"achievable":[41,72,93],"that":[44,100,118],"difficult":[46],"prove":[47],"whether":[48],"it":[49,149],"matches":[50],"or":[53],"not.":[54],"This":[55],"work":[56],"proposes":[57],"new":[59,109],"network":[60],"coding":[61],"protocol":[62],"following":[65],"unique":[66],"set":[67],"features:":[69],"(i)":[70],"Its":[71,92],"identical":[76],"to":[77,107,128],"all":[82],"scenarios":[84],"which":[86],"known;":[90],"(ii)":[91],"much":[97],"more":[98],"tractable":[99],"works":[102],"and":[103,168],"has":[104,159],"been":[105],"used":[106],"derive":[108],"vectors;":[112],"(iii)":[113],"It":[114,125,135],"employs":[115],"sequential":[116],"encoding":[117,163],"naturally":[119],"handles":[120],"dynamic":[121],"arrivals;":[123],"(iv)":[124],"automatically":[126],"adapts":[127],"unknown":[129],"arrival":[131],"rates":[132],"R\u20d7;":[133],"(v)":[134],"based":[137],"on":[138],"GF(q)":[139],"q":[141],">":[142],"K.":[143],"Numerically,":[144],"=":[147],"4,":[148],"admits":[150],"an":[151],"average":[152,162,169],"control":[153],"overhead":[154],"2-4%":[155],"(assuming":[156],"each":[157],"1000":[160],"bytes),":[161],"memory":[164],"usage":[165],"48.5":[166],"packets,":[167],"per-packet":[170],"delay":[171],"94.8":[172],"time":[173],"slots,":[174],"when":[175],"operating":[176],"at":[177],"95%":[178],"capacity.":[181]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}