{"id":"https://openalex.org/W2153061547","doi":"https://doi.org/10.1109/isit.2010.5513768","title":"Systematic network coding for time-division duplexing","display_name":"Systematic network coding for time-division duplexing","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2153061547","doi":"https://doi.org/10.1109/isit.2010.5513768","mag":"2153061547"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513768","doi":"https://doi.org/10.1109/isit.2010.5513768","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513768","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":"2010 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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/74093","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110828662","display_name":"Daniel E. Lucani","orcid":"https://orcid.org/0000-0001-5325-8863","observed_orcids":["https://orcid.org/0000-0001-5325-8863"]},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Daniel E. Lucani","raw_affiliation_strings":["Faculdade de Engenharia, Universidade do Porto, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculdade de Engenharia, Universidade do Porto, Portugal","institution_ids":["https://openalex.org/I182534213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075370174","display_name":"Muriel M\u00e9dard","orcid":"https://orcid.org/0000-0003-4059-407X","observed_orcids":["https://orcid.org/0000-0003-4059-407X"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muriel Medard","raw_affiliation_strings":["RLE, MIT, Cambridge, Massachusetts, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RLE, MIT, Cambridge, Massachusetts, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054370349","display_name":"Milica Stojanovic","orcid":"https://orcid.org/0000-0002-9127-9638","observed_orcids":["https://orcid.org/0000-0002-9127-9638"]},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Milica Stojanovic","raw_affiliation_strings":["Northeastern University, Boston, Massachusetts, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, Massachusetts, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2474,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.9698177,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2403","last_page":"2407"},"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.9926999807357788,"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.9926999807357788,"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.0017999999690800905,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.00039999998989515007,"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/time-division-duplex","display_name":"time division duplex","score":0.9539999961853027},{"id":"https://openalex.org/keywords/random-linear-network-coding","display_name":"random linear network coding","score":0.8759999871253967},{"id":"https://openalex.org/keywords/erasure-channels","display_name":"erasure channels","score":0.7829999923706055},{"id":"https://openalex.org/keywords/completion-time","display_name":"completion time","score":0.8080000281333923},{"id":"https://openalex.org/keywords/decoding-complexity","display_name":"decoding complexity","score":0.9319999814033508}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7564932107925415},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6206545829772949},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6052324771881104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6006617546081543},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5874892473220825},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5435689091682434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4358874559402466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40397414565086365},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32898128032684326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24914509057998657},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16683372855186462},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513768","doi":"https://doi.org/10.1109/isit.2010.5513768","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513768","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":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/74093","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/74093","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/74093","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/74093","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1514396891","https://openalex.org/W2012673246","https://openalex.org/W2048235391","https://openalex.org/W2098939123","https://openalex.org/W2105831729","https://openalex.org/W2113334170","https://openalex.org/W2128367324","https://openalex.org/W2146397633","https://openalex.org/W2159384192","https://openalex.org/W2163729038","https://openalex.org/W2166076277"],"related_works":["https://openalex.org/W7096306315","https://openalex.org/W2550026024","https://openalex.org/W1514396891","https://openalex.org/W7097477740","https://openalex.org/W2159384192","https://openalex.org/W2146397633","https://openalex.org/W2098939123","https://openalex.org/W2119652988","https://openalex.org/W2603218281","https://openalex.org/W7098242845"],"abstract_inverted_index":{"We":[0,25,78],"present":[1],"a":[2,18,22,52,60],"systematic":[3,31,88,119],"network":[4,32,55,89,120,131],"coding":[5,33,56,90,121,132],"approach":[6],"for":[7],"time-division":[8],"duplexing":[9],"channels.":[10],"In":[11],"particular,":[12],"we":[13],"study":[14],"the":[15,28,38,43,65,75,81,101,112,134],"case":[16],"of":[17,30,48,68,103],"node":[19],"transmitting":[20],"to":[21,42,85],"single":[23],"receiver.":[24],"show":[26,79],"that":[27,58,80,118],"use":[29],"using":[34,87],"XORs":[35],"can":[36],"provide":[37],"same":[39,44,135],"or":[40],"close":[41],"performance":[45],"in":[46,91],"terms":[47],"completion":[49],"time":[50],"as":[51,96],"random":[53,129],"linear":[54,130],"scheme":[57],"uses":[59],"large":[61],"field":[62,136],"size,":[63],"with":[64,133],"added":[66],"advantage":[67],"requiring":[69],"fewer":[70,124],"and":[71,109],"simpler":[72],"operations":[73,125],"during":[74],"decoding":[76],"process.":[77],"average":[82,127],"computation":[83],"required":[84],"decode":[86],"an":[92],"erasure":[93,114],"channel":[94],"grows":[95],"O(M3Pe3),":[97],"where":[98],"M":[99],"is":[100,111],"number":[102],"original":[104],"packets":[105],"being":[106],"coded":[107],"together,":[108],"Pe":[110],"packet":[113],"probability.":[115],"This":[116],"means":[117],"requires":[122],"Pe-3times":[123],"on":[126],"than":[128],"size.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}