{"id":"https://openalex.org/W2053636337","doi":"https://doi.org/10.1109/allerton.2014.7028517","title":"Sum-networks from undirected graphs: Construction and capacity analysis","display_name":"Sum-networks from undirected graphs: Construction and capacity analysis","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2053636337","doi":"https://doi.org/10.1109/allerton.2014.7028517","mag":"2053636337"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2014.7028517","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028517","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"article","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/A5056760458","display_name":"Ardhendu Tripathy","orcid":"https://orcid.org/0000-0003-1893-4891"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ardhendu Tripathy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa","\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa","\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"\u2020Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa 50011","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5192,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.9046964,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"651","last_page":"658"},"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.9998000264167786,"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.9998000264167786,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6698296070098877},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.643256425857544},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6392816305160522},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6293070912361145},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6161976456642151},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5598223805427551},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5451516509056091},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5168943405151367},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.506567120552063},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4740048348903656},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4715076982975006},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4592857360839844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42858487367630005},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.41643738746643066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3679504692554474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26109135150909424},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07760757207870483}],"concepts":[{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6698296070098877},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.643256425857544},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6392816305160522},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6293070912361145},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6161976456642151},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5598223805427551},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5451516509056091},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5168943405151367},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.506567120552063},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4740048348903656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4715076982975006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4592857360839844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42858487367630005},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.41643738746643066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3679504692554474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26109135150909424},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07760757207870483},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2014.7028517","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028517","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1971506714","https://openalex.org/W2000743795","https://openalex.org/W2019307453","https://openalex.org/W2023242304","https://openalex.org/W2035908129","https://openalex.org/W2088458687","https://openalex.org/W2129119419","https://openalex.org/W2134804253","https://openalex.org/W2164651000","https://openalex.org/W2168920751","https://openalex.org/W2209179758","https://openalex.org/W2556692371","https://openalex.org/W2964259786","https://openalex.org/W3098321199"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W1998712144","https://openalex.org/W3164774158","https://openalex.org/W2372211403","https://openalex.org/W4297817344","https://openalex.org/W4322810890"],"abstract_inverted_index":{"We":[0,29],"consider":[1],"a":[2,31,34,44,64,97],"directed":[3],"acyclic":[4],"network":[5,66],"with":[6,103,118],"multiple":[7,10],"sources":[8,23,123],"and":[9,46,124],"terminals":[11],"where":[12],"each":[13],"terminal":[14],"is":[15],"interested":[16],"in":[17,112],"decoding":[18],"the":[19,26,61],"sum":[20],"of":[21,63,122],"independent":[22],"generated":[24],"at":[25],"source":[27],"nodes.":[28],"describe":[30],"procedure":[32,74],"whereby":[33],"simple":[35],"undirected":[36],"graph":[37],"can":[38],"be":[39],"used":[40],"to":[41,77],"construct":[42,78],"such":[43],"sum-network":[45],"demonstrate":[47],"an":[48,109],"upper":[49,71],"bound":[50],"on":[51],"its":[52],"computation":[53,84],"rate.":[54],"Furthermore,":[55],"we":[56,107],"show":[57],"sufficient":[58],"conditions":[59],"for":[60,100],"construction":[62],"linear":[65],"code":[67],"that":[68,80],"achieves":[69],"this":[70],"bound.":[72],"Our":[73,93],"allows":[75],"us":[76],"sum-networks":[79,102,117],"have":[81],"any":[82],"arbitrary":[83,104],"rate":[85],"p/q":[86],"(where":[87],"p,":[88],"q":[89],"are":[90],"non-negative":[91],"integers).":[92],"work":[94,114],"significantly":[95,119],"generalizes":[96],"previous":[98],"approach":[99],"constructing":[101],"capacities.":[105],"Specifically,":[106],"answer":[108],"open":[110],"question":[111],"prior":[113],"by":[115],"demonstrating":[116],"fewer":[120],"number":[121],"terminals.":[125]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}