{"id":"https://openalex.org/W2274486630","doi":"https://doi.org/10.1109/camad.2015.7390502","title":"Throughput bound of XOR coded wireless multicasting to three clients","display_name":"Throughput bound of XOR coded wireless multicasting to three clients","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2274486630","doi":"https://doi.org/10.1109/camad.2015.7390502","mag":"2274486630"},"language":"en","primary_location":{"id":"doi:10.1109/camad.2015.7390502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camad.2015.7390502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1512.05160","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jalaluddin Qureshi","orcid":null},"institutions":[{"id":"https://openalex.org/I2802902501","display_name":"Namal University","ror":"https://ror.org/00zcxra43","country_code":"PK","type":"education","lineage":["https://openalex.org/I2802902501"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Jalaluddin Qureshi","raw_affiliation_strings":["Department of Electrical Engineering, Namal College, Mianwali, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Namal College, Mianwali, Pakistan","institution_ids":["https://openalex.org/I2802902501"]}]},{"author_position":"last","author":{"id":null,"display_name":"Adeel Malik","orcid":null},"institutions":[{"id":"https://openalex.org/I2802902501","display_name":"Namal University","ror":"https://ror.org/00zcxra43","country_code":"PK","type":"education","lineage":["https://openalex.org/I2802902501"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Adeel Malik","raw_affiliation_strings":["Department of Electrical Engineering, Namal College, Mianwali, Pakistan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Namal College, Mianwali, Pakistan","institution_ids":["https://openalex.org/I2802902501"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2802902501"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1 1 1","issue":null,"first_page":"165","last_page":"169"},"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.9970999956130981,"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.992900013923645,"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/multicast","display_name":"Multicast","score":0.7235999703407288},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6370000243186951},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6060000061988831},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5884000062942505},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.5551000237464905},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5379999876022339},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5339999794960022},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4839000105857849},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.4426000118255615}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7235999703407288},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6370000243186951},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6060000061988831},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5884000062942505},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.5551000237464905},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5379999876022339},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5339999794960022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49959999322891235},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4839000105857849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4772999882698059},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.444599986076355},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.4426000118255615},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.38940000534057617},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3856000006198883},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.3562000095844269},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3278999924659729},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.3199999928474426},{"id":"https://openalex.org/C3019527723","wikidata":"https://www.wikidata.org/wiki/Q260899","display_name":"Field size","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2759000062942505},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C2776029614","wikidata":"https://www.wikidata.org/wiki/Q1146367","display_name":"File size","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.26589998602867126},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.2554999887943268},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/camad.2015.7390502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camad.2015.7390502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 20th International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1512.05160","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1512.05160","pdf_url":"https://arxiv.org/pdf/1512.05160","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:1512.05160","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1512.05160","pdf_url":"https://arxiv.org/pdf/1512.05160","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":9,"referenced_works":["https://openalex.org/W1967147827","https://openalex.org/W1967387879","https://openalex.org/W1972236278","https://openalex.org/W2054120591","https://openalex.org/W2123694482","https://openalex.org/W2146397633","https://openalex.org/W2164534484","https://openalex.org/W2168141613","https://openalex.org/W7029236405"],"related_works":[],"abstract_inverted_index":{"It":[0],"is":[1,21,52,117,161],"a":[2,17,77,115],"well-known":[3],"result":[4],"that":[5,92,99,146],"constructing":[6],"code-words":[7],"over":[8],"GF(2)":[9],"to":[10,57,106,131],"minimize":[11],"the":[12,36,47,58,70,100,108,137,147,150],"number":[13,59,73,110,122,140,152],"of":[14,60,74,102,111,123,141,153],"transmissions":[15,75,112,154],"for":[16,34,76,113,119,163],"single-hop":[18],"wireless":[19],"multicasting":[20],"an":[22,133],"NP-complete":[23],"problem.":[24],"Linearly":[25],"independent":[26],"codewords":[27],"can":[28],"be":[29],"constructed":[30],"in":[31],"polynomial":[32],"time":[33],"all":[35],"n":[37,88,164],"clients,":[38,61],"known":[39],"as":[40],"maximum":[41],"distance":[42],"separable":[43],"(MDS)":[44],"code,":[45],"when":[46,83],"finite":[48],"field":[49],"size":[50],"q":[51,62,84,93],"larger":[53],"than":[54],"or":[55],"equal":[56],"\u2265":[63],"n.":[64,95],"In":[65],"this":[66],"paper":[67],"we":[68],"quantify":[69],"exact":[71,138],"minimum":[72,109,139],"multicast":[78],"network":[79,116],"using":[80,155],"erasure":[81],"code":[82],"=":[85,89,165],"2":[86],"and":[87,158],"3,":[90],"such":[91,114],"<;":[94],"We":[96,126],"first":[97],"show":[98,145],"use":[101,128],"Markov":[103],"chain":[104],"model":[105],"derive":[107,132],"limited":[118],"very":[120],"small":[121],"input":[124],"packets.":[125],"then":[127],"combinatorial":[129],"approach":[130],"upper":[134],"bound":[135],"on":[136],"transmissions.":[142],"Our":[143],"results":[144],"difference":[148],"between":[149],"expected":[151],"XOR":[156],"coding":[157,160],"MDS":[159],"negligible":[162],"3.":[166]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}