{"id":"https://openalex.org/W2167902724","doi":"https://doi.org/10.1109/itwnit.2009.5158583","title":"AND-OR tree analysis of distributed LT codes","display_name":"AND-OR tree analysis of distributed LT codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2167902724","doi":"https://doi.org/10.1109/itwnit.2009.5158583","mag":"2167902724"},"language":"en","primary_location":{"id":"doi:10.1109/itwnit.2009.5158583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itwnit.2009.5158583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Information Theory Workshop on Networking and Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/ws/files/3017562/sejdinovic_IEEE_ITW_2009.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040046354","display_name":"Dino Sejdinovi\u0107","orcid":"https://orcid.org/0000-0001-5547-9213"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Dino Sejdinovic","raw_affiliation_strings":["Centre for Communications Research Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK"],"affiliations":[{"raw_affiliation_string":"Centre for Communications Research Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071769747","display_name":"Robert J. Piechocki","orcid":"https://orcid.org/0000-0002-4879-1206"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robert J. Piechocki","raw_affiliation_strings":["Centre for Communications Research Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK"],"affiliations":[{"raw_affiliation_string":"Centre for Communications Research Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090998891","display_name":"Angela Doufexi","orcid":"https://orcid.org/0000-0003-0133-6676"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Angela Doufexi","raw_affiliation_strings":["Centre for Communications Research Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK"],"affiliations":[{"raw_affiliation_string":"Centre for Communications Research Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040046354"],"corresponding_institution_ids":["https://openalex.org/I36234482"],"apc_list":null,"apc_paid":null,"fwci":5.7943,"has_fulltext":true,"cited_by_count":68,"citation_normalized_percentile":{"value":0.9643232,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"265"},"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.9995999932289124,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9965999722480774,"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/relay","display_name":"Relay","score":0.7775459289550781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.661337673664093},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6070902943611145},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.6069790124893188},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5434653162956238},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.4779355823993683},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4543227255344391},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"Distributed source coding","score":0.43520963191986084},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4293361306190491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32007700204849243},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3193027377128601},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3112725019454956},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.29916617274284363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28800302743911743},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2769801616668701},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.2199607789516449},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08061531186103821},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06954747438430786}],"concepts":[{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.7775459289550781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.661337673664093},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6070902943611145},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.6069790124893188},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5434653162956238},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4779355823993683},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4543227255344391},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.43520963191986084},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4293361306190491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32007700204849243},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3193027377128601},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3112725019454956},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.29916617274284363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28800302743911743},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2769801616668701},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2199607789516449},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08061531186103821},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06954747438430786},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/itwnit.2009.5158583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itwnit.2009.5158583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Information Theory Workshop on Networking and Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/5be2c3e9-7901-4c85-b683-ecddc600b170","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/5be2c3e9-7901-4c85-b683-ecddc600b170","pdf_url":"https://research-information.bris.ac.uk/ws/files/3017562/sejdinovic_IEEE_ITW_2009.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sejdinovic, D, Piechocki, RJ & Doufexi, A 2009, AND-OR tree analysis of distributed LT codes. in IEEE Information Theory Workshop on Networking and Information Theory, 2009 (ITW 2009), Volos, Greece. Institute of Electrical and Electronics Engineers (IEEE), pp. 261 - 265. https://doi.org/10.1109/ITWNIT.2009.5158583","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/5be2c3e9-7901-4c85-b683-ecddc600b170","is_oa":true,"landing_page_url":"http://hdl.handle.net/1983/1575","pdf_url":"https://research-information.bris.ac.uk/ws/files/3017562/sejdinovic_IEEE_ITW_2009.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:1330426","is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/1330426/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"     In:  ITW: 2009 IEEE INFORMATION THEORY WORKSHOP ON NETWORKING AND INFORMATION THEORY.  (pp. 261 - 265).  IEEE (2009)     ","raw_type":"Proceedings paper"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:5bdfde87-a44c-4f32-b659-7fff810c28ce","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:5bdfde87-a44c-4f32-b659-7fff810c28ce","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Conference"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/5be2c3e9-7901-4c85-b683-ecddc600b170","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/5be2c3e9-7901-4c85-b683-ecddc600b170","pdf_url":"https://research-information.bris.ac.uk/ws/files/3017562/sejdinovic_IEEE_ITW_2009.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Sejdinovic, D, Piechocki, RJ & Doufexi, A 2009, AND-OR tree analysis of distributed LT codes. in IEEE Information Theory Workshop on Networking and Information Theory, 2009 (ITW 2009), Volos, Greece. Institute of Electrical and Electronics Engineers (IEEE), pp. 261 - 265. https://doi.org/10.1109/ITWNIT.2009.5158583","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2167902724.pdf","grobid_xml":"https://content.openalex.org/works/W2167902724.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W93674331","https://openalex.org/W1536930200","https://openalex.org/W2029268759","https://openalex.org/W2046189730","https://openalex.org/W2095742644","https://openalex.org/W2129824524","https://openalex.org/W2133349749","https://openalex.org/W2134499105","https://openalex.org/W2161342511","https://openalex.org/W2295297731","https://openalex.org/W2296125569","https://openalex.org/W2296600582","https://openalex.org/W2296743432","https://openalex.org/W2914980053","https://openalex.org/W4229922087","https://openalex.org/W4244625299","https://openalex.org/W6657651502","https://openalex.org/W6683752993"],"related_works":["https://openalex.org/W2352227884","https://openalex.org/W2136944092","https://openalex.org/W2138256990","https://openalex.org/W2113911300","https://openalex.org/W2148567998","https://openalex.org/W2006979414","https://openalex.org/W2572458422","https://openalex.org/W2020681921","https://openalex.org/W4387527003","https://openalex.org/W2161290246"],"abstract_inverted_index":{"In":[0],"this":[1],"contribution,":[2],"we":[3,79],"consider":[4],"design":[5,56],"of":[6,14,62,64],"distributed":[7,45,53,65],"LT":[8,46,54,66,69,83],"codes,":[9,47],"i.e.,":[10],"independent":[11],"rateless":[12],"encodings":[13],"multiple":[15],"sources":[16,33,89,101],"which":[17,48],"communicate":[18],"to":[19,27,37,51,96],"a":[20],"common":[21],"relay,":[22],"where":[23],"relay":[24,92],"is":[25],"able":[26],"combine":[28],"incoming":[29],"packets":[30],"from":[31],"the":[32,60,75,88,91,100,106],"and":[34,58,68,90,102],"forwards":[35],"them":[36],"receivers.":[38],"We":[39],"provide":[40],"density":[41],"evolution":[42],"formulae":[43],"for":[44],"allow":[49],"us":[50],"formulate":[52],"code":[55],"problem":[57],"prove":[59,94],"equivalence":[61],"performance":[63],"codes":[67,70],"with":[71],"related":[72],"parameters":[73],"in":[74],"asymptotic":[76],"regime.":[77],"Furthermore,":[78],"demonstrate":[80],"that":[81],"allowing":[82],"coding":[84,97,103],"apparatus":[85],"at":[86,99,105],"both":[87],"may":[93],"advantageous":[95],"only":[98,104],"relay.":[107]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}