{"id":"https://openalex.org/W2163381461","doi":"https://doi.org/10.1109/tit.2010.2094818","title":"A Matroid Framework for Noncoherent Random Network Communications","display_name":"A Matroid Framework for Noncoherent Random Network Communications","publication_year":2011,"publication_date":"2011-01-21","ids":{"openalex":"https://openalex.org/W2163381461","doi":"https://doi.org/10.1109/tit.2010.2094818","mag":"2163381461"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2094818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2094818","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1500316","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037486046","display_name":"Maximilien Gadouleau","orcid":"https://orcid.org/0000-0003-4701-738X"},"institutions":[{"id":"https://openalex.org/I4210100943","display_name":"Centre de Recherche en Sciences et Technologies de l'Information et de la Communication","ror":"https://ror.org/016wdna72","country_code":"FR","type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I4210100943","https://openalex.org/I4210141980","https://openalex.org/I96226040"]},{"id":"https://openalex.org/I96226040","display_name":"Universit\u00e9 de Reims Champagne-Ardenne","ror":"https://ror.org/03hypw319","country_code":"FR","type":"education","lineage":["https://openalex.org/I96226040"]},{"id":"https://openalex.org/I124357947","display_name":"University of London","ror":"https://ror.org/04cw6st05","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947"]}],"countries":["FR","GB"],"is_corresponding":true,"raw_author_name":"Maximilien Gadouleau","raw_affiliation_strings":["CReSTIC, Universite de Reims Champagne-Ardenne, Reims, France","School of Electronic Engineering and Computer Science, University of London, London, UK"],"affiliations":[{"raw_affiliation_string":"CReSTIC, Universite de Reims Champagne-Ardenne, Reims, France","institution_ids":["https://openalex.org/I96226040","https://openalex.org/I4210100943"]},{"raw_affiliation_string":"School of Electronic Engineering and Computer Science, University of London, London, UK","institution_ids":["https://openalex.org/I124357947"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066371865","display_name":"Alban Goupil","orcid":"https://orcid.org/0000-0003-4308-9968"},"institutions":[{"id":"https://openalex.org/I96226040","display_name":"Universit\u00e9 de Reims Champagne-Ardenne","ror":"https://ror.org/03hypw319","country_code":"FR","type":"education","lineage":["https://openalex.org/I96226040"]},{"id":"https://openalex.org/I4210100943","display_name":"Centre de Recherche en Sciences et Technologies de l'Information et de la Communication","ror":"https://ror.org/016wdna72","country_code":"FR","type":"facility","lineage":["https://openalex.org/I154526488","https://openalex.org/I4210100943","https://openalex.org/I4210141980","https://openalex.org/I96226040"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alban Goupil","raw_affiliation_strings":["CReSTIC, Universite de Reims Champagne-Ardenne, Reims, France"],"affiliations":[{"raw_affiliation_string":"CReSTIC, Universite de Reims Champagne-Ardenne, Reims, France","institution_ids":["https://openalex.org/I96226040","https://openalex.org/I4210100943"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037486046"],"corresponding_institution_ids":["https://openalex.org/I124357947","https://openalex.org/I4210100943","https://openalex.org/I96226040"],"apc_list":null,"apc_paid":null,"fwci":3.1507,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.92305529,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"57","issue":"2","first_page":"1031","last_page":"1045"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9821000099182129,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9674000144004822,"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.7587918043136597},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.705161452293396},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6605064868927002},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5758498311042786},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.5569096207618713},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5091339945793152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49455639719963074},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.4432360827922821},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.43171754479408264},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.42561060190200806},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4134637415409088},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40344130992889404},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.30847132205963135},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.0968138575553894}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7587918043136597},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.705161452293396},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6605064868927002},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5758498311042786},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.5569096207618713},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5091339945793152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49455639719963074},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.4432360827922821},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.43171754479408264},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.42561060190200806},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4134637415409088},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40344130992889404},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.30847132205963135},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0968138575553894}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2010.2094818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2094818","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02108403v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02108403","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 2011, 57 (2), pp.1031-1045. ⟨10.1109/TIT.2010.2094818⟩","raw_type":"Journal articles"},{"id":"pmh:oai:durham-repository.worktribe.com:1500316","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1500316","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1500316","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1500316","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W200851994","https://openalex.org/W785083160","https://openalex.org/W1568510176","https://openalex.org/W1689818501","https://openalex.org/W1777323012","https://openalex.org/W1972051088","https://openalex.org/W1977027494","https://openalex.org/W1977781091","https://openalex.org/W1993359877","https://openalex.org/W2005830269","https://openalex.org/W2014554046","https://openalex.org/W2029948740","https://openalex.org/W2034681107","https://openalex.org/W2035865380","https://openalex.org/W2036152004","https://openalex.org/W2055060019","https://openalex.org/W2075488055","https://openalex.org/W2083270107","https://openalex.org/W2095547380","https://openalex.org/W2098313715","https://openalex.org/W2100450800","https://openalex.org/W2107520978","https://openalex.org/W2109831419","https://openalex.org/W2115769160","https://openalex.org/W2123476855","https://openalex.org/W2128555802","https://openalex.org/W2135643259","https://openalex.org/W2139416652","https://openalex.org/W2141113148","https://openalex.org/W2142293082","https://openalex.org/W2155398259","https://openalex.org/W2162421771","https://openalex.org/W2752853835","https://openalex.org/W3190312953","https://openalex.org/W4240666298","https://openalex.org/W6637427731"],"related_works":["https://openalex.org/W2623918504","https://openalex.org/W2957709805","https://openalex.org/W2916248738","https://openalex.org/W1968720239","https://openalex.org/W2622922565","https://openalex.org/W2100531868","https://openalex.org/W2011630204","https://openalex.org/W4221096776","https://openalex.org/W2811127143","https://openalex.org/W2099132973"],"abstract_inverted_index":{"Models":[0],"for":[1,72,171,196,212,228,235],"noncoherent":[2],"error":[3,78,197,213],"control":[4,176],"in":[5,94,133,208,215,217,256],"random":[6,28,56],"linear":[7],"network":[8,29,58,92,161],"coding":[9,59],"(RLNC)":[10],"and":[11,13,43,45,74,86,100,106,111,138,173,210],"store":[12],"forward":[14],"(SAF)":[15],"have":[16],"been":[17],"recently":[18],"proposed.":[19],"In":[20],"this":[21],"paper,":[22],"we":[23,83,112,151,237],"model":[24,152],"different":[25,91],"types":[26],"of":[27,34,36,65,90,108,117,135,146,156,186,204,224,245,258],"communications":[30],"as":[31,55,162],"the":[32,68,88,95,102,115,121,153,160,168,201],"transmission":[33],"flats":[35,185,207],"matroids.":[37],"This":[38],"novel":[39,51],"framework":[40],"encompasses":[41],"RLNC":[42,73,132,172,248],"SAF":[44,75],"allows":[46],"us":[47],"to":[48,54,141,180],"introduce":[49],"a":[50,142,157,181,187,222,239],"protocol,":[52],"referred":[53],"affine":[57,63],"(RANC),":[60],"based":[61,230],"on":[62,184,206,231],"combinations":[64],"packets.":[66,149],"Although":[67],"models":[69],"previously":[70],"proposed":[71,170],"only":[76],"consider":[77],"control,":[79],"using":[80],"our":[81],"framework,":[82],"first":[84],"evaluate":[85],"compare":[87],"performance":[89],"protocols":[93],"error-free":[96],"case.":[97],"We":[98,126,199,219],"define":[99],"determine":[101],"rate,":[103],"average":[104],"delay,":[105],"throughput":[107,139],"such":[109],"protocols,":[110],"also":[113],"investigate":[114],"possibilities":[116],"partial":[118],"decoding":[119,241],"before":[120],"entire":[122],"message":[123,158],"is":[124,177,249],"received.":[125],"thus":[127,178,250],"show":[128],"that":[129],"RANC":[130,216,229,246],"outperforms":[131],"terms":[134,257],"data":[136],"rate":[137],"thanks":[140],"more":[143],"efficient":[144],"encoding":[145],"messages":[147],"into":[148],"Second,":[150],"possible":[154],"alterations":[155],"by":[159],"an":[163],"operator":[164],"channel,":[165],"which":[166,236],"generalizes":[167],"channels":[169],"SAF.":[174],"Error":[175],"reduced":[179],"coding-theoretic":[182],"problem":[183],"matroid,":[188],"where":[189],"two":[190],"distinct":[191],"metrics":[192],"can":[193],"be":[194],"used":[195],"correction.":[198],"study":[200],"maximum":[202],"cardinality":[203],"codes":[205,211,227,234],"general,":[209],"correction":[214],"particular.":[218],"finally":[220],"design":[221],"class":[223],"nearly":[225],"optimal":[226],"rank":[232],"metric":[233],"propose":[238],"low-complexity":[240],"algorithm.":[242],"The":[243],"gain":[244],"over":[247],"preserved":[251],"with":[252],"no":[253],"additional":[254],"cost":[255],"complexity.":[259]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}