{"id":"https://openalex.org/W2052977643","doi":"https://doi.org/10.1109/isit.2014.6875245","title":"Algorithms for computing network coding rate regions via single element extensions of matroids","display_name":"Algorithms for computing network coding rate regions via single element extensions of matroids","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2052977643","doi":"https://doi.org/10.1109/isit.2014.6875245","mag":"2052977643"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875245","doi":"https://doi.org/10.1109/isit.2014.6875245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875245","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":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","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/A5076608322","display_name":"Jayant Apte","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jayant Apte","raw_affiliation_strings":["Dept. of ECE, Drexel University, Philadelphia, PA, USA","Dept. of ECE, Drexel Univ., Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of ECE, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Dept. of ECE, Drexel Univ., Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049701424","display_name":"Congduan Li","orcid":"https://orcid.org/0000-0003-0495-332X","observed_orcids":["https://orcid.org/0000-0003-0495-332X"]},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Congduan Li","raw_affiliation_strings":["Dept. of ECE, Drexel University, Philadelphia, PA, USA","Dept. of ECE, Drexel Univ., Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of ECE, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Dept. of ECE, Drexel Univ., Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060945955","display_name":"John MacLaren Walsh","orcid":"https://orcid.org/0000-0003-1999-751X","observed_orcids":["https://orcid.org/0000-0003-1999-751X"]},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John MacLaren Walsh","raw_affiliation_strings":["Dept. of ECE, Drexel University, Philadelphia, PA, USA","Dept. of ECE, Drexel Univ., Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of ECE, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]},{"raw_affiliation_string":"Dept. of ECE, Drexel Univ., Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I72816309"],"apc_list":null,"apc_paid":null,"fwci":2.0424,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87752229,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"3","issue":null,"first_page":"2306","last_page":"2310"},"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.49320000410079956,"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.49320000410079956,"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.32690000534057617,"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"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.02630000002682209,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/network-coding","display_name":"network coding","score":0.8090000152587891},{"id":"https://openalex.org/keywords/rate-region","display_name":"rate region","score":0.9670000076293945},{"id":"https://openalex.org/keywords/matroid-representability","display_name":"matroid representability","score":0.7919999957084656},{"id":"https://openalex.org/keywords/finite-fields","display_name":"finite fields","score":0.8180000185966492},{"id":"https://openalex.org/keywords/forbidden-minors","display_name":"forbidden minors","score":0.7099999785423279},{"id":"https://openalex.org/keywords/matroid-enumeration","display_name":"matroid enumeration","score":0.8539999723434448},{"id":"https://openalex.org/keywords/extreme-rays","display_name":"extreme rays","score":0.7850000262260437}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9878931045532227},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.7189525365829468},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.7097764015197754},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.644271194934845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5379835367202759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5360944867134094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4840947389602661},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.47947797179222107},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.4254634976387024},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4182230234146118},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3714289367198944},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2014.6875245","doi":"https://doi.org/10.1109/isit.2014.6875245","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875245","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":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.718.3072","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.718.3072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.pages.drexel.edu/%7Ecl698/ISIT2014.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W108696806","https://openalex.org/W581264992","https://openalex.org/W1526262508","https://openalex.org/W1597196612","https://openalex.org/W2022780488","https://openalex.org/W2038207731","https://openalex.org/W2078355120","https://openalex.org/W2086387649","https://openalex.org/W2095127695","https://openalex.org/W2120085609","https://openalex.org/W2138753678","https://openalex.org/W2152705493","https://openalex.org/W2288450576","https://openalex.org/W2335172256","https://openalex.org/W2988480584","https://openalex.org/W4231868828"],"related_works":["https://openalex.org/W7030495089","https://openalex.org/W3087369353","https://openalex.org/W2156053652","https://openalex.org/W2086387649","https://openalex.org/W2571300684","https://openalex.org/W7095916262","https://openalex.org/W1757164770","https://openalex.org/W2100450800","https://openalex.org/W45822452","https://openalex.org/W2081085101"],"abstract_inverted_index":{"We":[0,34,89,115],"propose":[1,54],"algorithms":[2],"for":[3,24,31,108,129],"finding":[4],"extreme":[5],"rays":[6],"of":[7,38,43,47,60,78,94,101],"rate":[8],"regions":[9],"achievable":[10],"with":[11],"vector":[12],"linear":[13,105],"codes":[14,107,128],"over":[15,65,84],"finite":[16,68,87],"fields":[17],"Fq,":[18],"q":[19],"\u2208":[20],"{2,":[21],"3,":[22],"4}":[23],"which":[25,96,119],"there":[26],"are":[27],"known":[28],"forbidden":[29],"minors":[30],"matroid":[32,113,137],"representability.":[33],"use":[35],"the":[36,76,85,92],"idea":[37],"single":[39],"element":[40],"extensions":[41],"(SEEs)":[42],"matroids":[44,49,63,82,97,102,123],"and":[45],"enumeration":[46],"non-isomorphic":[48,62,80],"using":[50],"SEEs,":[51],"to":[52,57,73],"first":[53],"an":[55],"algorithm":[56,72],"obtain":[58],"lists":[59],"all":[61,79,122],"representable":[64,83],"a":[66,99,109,130],"given":[67,86,110,131],"field.We":[69],"modify":[70],"this":[71,117],"produce":[74],"only":[75],"list":[77,100],"connected":[81],"field.":[88],"then":[90],"integrate":[91],"process":[93],"testing":[95],"in":[98],"form":[103,125],"valid":[104,126],"network":[106,111,127,132],"within":[112],"enumeration.":[114,138],"name":[116],"algorithm,":[118],"essentially":[120],"builds":[121],"that":[124],"from":[133],"scratch,":[134],"as":[135],"network-constrained":[136]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}