{"id":"https://openalex.org/W1995697291","doi":"https://doi.org/10.1109/isit.2007.4557449","title":"On Random Network Coding for Multicast","display_name":"On Random Network Coding for Multicast","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W1995697291","doi":"https://doi.org/10.1109/isit.2007.4557449","mag":"1995697291"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557449","doi":"https://doi.org/10.1109/isit.2007.4557449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557449","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5013498347","display_name":"Adri\u00e0 Tauste Campo","orcid":"https://orcid.org/0000-0003-0982-4017","observed_orcids":["https://orcid.org/0000-0003-0982-4017"]},"institutions":[{"id":"https://openalex.org/I170486558","display_name":"Universitat Pompeu Fabra","ror":"https://ror.org/04n0g0b29","country_code":"ES","type":"education","lineage":["https://openalex.org/I170486558"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Adrian Tauste Campo","raw_affiliation_strings":["Universitat Pompeu Fabra, Barcelona, Spain","Univ. Pompeu Fabra, Barcelona"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Pompeu Fabra, Barcelona, Spain","institution_ids":["https://openalex.org/I170486558"]},{"raw_affiliation_string":"Univ. Pompeu Fabra, Barcelona","institution_ids":["https://openalex.org/I170486558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072485708","display_name":"Alex J. Grant","orcid":"https://orcid.org/0000-0002-5345-7771","observed_orcids":["https://orcid.org/0000-0002-5345-7771"]},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107","https://openalex.org/I4405259444"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alex Grant","raw_affiliation_strings":["Institute for Telecommunications Research, University of South Australia, Australia","Institute for Telecommunications Research, University of South Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia, Australia","institution_ids":["https://openalex.org/I170239107"]},{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia","institution_ids":["https://openalex.org/I170239107"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1591","last_page":"1595"},"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.9916999936103821,"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.9916999936103821,"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.0010999999940395355,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/random-linear-network-coding","display_name":"random linear network coding","score":0.9039999842643738},{"id":"https://openalex.org/keywords/multicast","display_name":"multicast","score":0.8640000224113464},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"linear network coding","score":0.8220000267028809},{"id":"https://openalex.org/keywords/decoding-probability","display_name":"decoding probability","score":0.6669999957084656},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.6000000238418579}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.9300280809402466},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8909662365913391},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7961863279342651},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6944690346717834},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5432322025299072},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5100684762001038},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4654565453529358},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.45261698961257935},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3638124167919159},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26160162687301636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25743842124938965},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07493039965629578},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2007.4557449","doi":"https://doi.org/10.1109/isit.2007.4557449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557449","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.9190","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.9190","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/cs/0702052v1.pdf","raw_type":"text"},{"id":"pmh:oai:digital.library.adelaide.edu.au:1959.8/47241","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/1959.8/47241","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.1109/ISIT.2007.4557449","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320315885","display_name":"Australian Government","ror":"https://ror.org/0314h5y94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W67291757","https://openalex.org/W2095022281","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2130350209","https://openalex.org/W2138928022","https://openalex.org/W2157005274","https://openalex.org/W2506285684"],"related_works":["https://openalex.org/W2062003753","https://openalex.org/W2048235391","https://openalex.org/W2079655802","https://openalex.org/W2119176508","https://openalex.org/W1546136883","https://openalex.org/W2756020742","https://openalex.org/W2009579738","https://openalex.org/W1964750514","https://openalex.org/W2119856092","https://openalex.org/W2895174753"],"abstract_inverted_index":{"Random":[0],"linear":[1],"network":[2,16,44,73],"coding":[3],"is":[4,86],"a":[5,19,70,92],"particularly":[6],"decentralized":[7],"approach":[8],"to":[9,30],"the":[10,33,38,48,52,81,96],"multicast":[11],"problem.":[12],"Use":[13],"of":[14,37,54,98],"random":[15,43,82],"codes":[17,45],"introduces":[18],"non-zero":[20],"probability":[21,53,97],"however":[22],"that":[23,66,80],"some":[24],"sinks":[25,68],"will":[26],"not":[27],"be":[28],"able":[29],"successfully":[31,75],"decode":[32,76],"required":[34],"sources.":[35],"One":[36],"main":[39],"theoretical":[40],"motivations":[41],"for":[42],"stems":[46],"from":[47],"lower":[49],"bound":[50,94],"on":[51,95],"successful":[55,99],"decoding":[56],"reported":[57],"by":[58],"Ho":[59],"et.":[60],"al.":[61],"(2003).":[62],"This":[63,89],"result":[64],"demonstrates":[65],"all":[67,77],"in":[69],"linearly":[71],"solvable":[72],"can":[74],"sources":[78],"provided":[79],"code":[83],"field":[84],"size":[85],"large":[87],"enough.":[88],"paper":[90],"develops":[91],"new":[93],"decoding.":[100]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}