{"id":"https://openalex.org/W1986643489","doi":"https://doi.org/10.1109/ncc.2015.7084914","title":"On the number of sources and terminals of sum-networks with capacity p/q","display_name":"On the number of sources and terminals of sum-networks with capacity p/q","publication_year":2015,"publication_date":"2015-02-01","ids":{"openalex":"https://openalex.org/W1986643489","doi":"https://doi.org/10.1109/ncc.2015.7084914","mag":"1986643489"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2015.7084914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2015.7084914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Twenty First National Conference on Communications (NCC)","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/A5048074449","display_name":"Niladri Das","orcid":"https://orcid.org/0000-0002-9494-2845"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Niladri Das","raw_affiliation_strings":["Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam","Department of Electronics and Electrical Engineering Indian Institute of Technology Guwahati, Assam 781039, India"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam","institution_ids":["https://openalex.org/I1317621060"]},{"raw_affiliation_string":"Department of Electronics and Electrical Engineering Indian Institute of Technology Guwahati, Assam 781039, India","institution_ids":["https://openalex.org/I1317621060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031492698","display_name":"Brijesh Kumar","orcid":"https://orcid.org/0000-0001-9719-956X"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Brijesh Kumar Rai","raw_affiliation_strings":["Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam","Department of Electronics and Electrical Engineering Indian Institute of Technology Guwahati, Assam 781039, India"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam","institution_ids":["https://openalex.org/I1317621060"]},{"raw_affiliation_string":"Department of Electronics and Electrical Engineering Indian Institute of Technology Guwahati, Assam 781039, India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048074449"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":0.6656,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73722609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9872999787330627,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9811999797821045,"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/construct","display_name":"Construct (python library)","score":0.7661906480789185},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.6336894631385803},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.57182776927948},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5003995895385742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4868609309196472},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46211105585098267},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33176279067993164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2165616750717163},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14413735270500183}],"concepts":[{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.7661906480789185},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.6336894631385803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.57182776927948},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5003995895385742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4868609309196472},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46211105585098267},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33176279067993164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2165616750717163},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14413735270500183},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ncc.2015.7084914","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2015.7084914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Twenty First National Conference on Communications (NCC)","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":10,"referenced_works":["https://openalex.org/W1971506714","https://openalex.org/W2035908129","https://openalex.org/W2088458687","https://openalex.org/W2096342910","https://openalex.org/W2148800638","https://openalex.org/W2209179758","https://openalex.org/W2266819685","https://openalex.org/W2556692371","https://openalex.org/W2963305818","https://openalex.org/W3098321199"],"related_works":["https://openalex.org/W2366107444","https://openalex.org/W4388145910","https://openalex.org/W2381570729","https://openalex.org/W1976205134","https://openalex.org/W4248336175","https://openalex.org/W2031260042","https://openalex.org/W2391445434","https://openalex.org/W3009369890","https://openalex.org/W4312490297","https://openalex.org/W2062212388"],"abstract_inverted_index":{"Rai":[0],"et":[1],"al.":[2],"in":[3,43,97,157],"[1]":[4],"showed":[5],"that":[6,103,119,210],"any":[7],"rational":[8],"number":[9,61,70,90,150,229],"p/q":[10],"is":[11,81,101,131,214],"the":[12,78,129],"capacity":[13,33,50,114,222],"of":[14,40,49,62,71,91,125,136,151,230],"some":[15,123],"sum-network.":[16],"The":[17,26,95],"authors":[18,27],"proved":[19],"this":[20,74,169],"result":[21,96],"by":[22],"constructing":[23,218],"such":[24,41,86,166,174,206],"sum-networks.":[25,167,207],"first":[28],"constructed":[29],"a":[30,47,106,201,215,219],"sum-network":[31,48,112],"with":[32,88,113,177,200,221],"1/q,":[34],"and":[35,64,109,127,138,153,159,185,232],"then":[36],"they":[37],"connected":[38],"p":[39,126,137,223],"networks":[42],"parallel":[44],"to":[45,84,145,163,197,204],"create":[46],"p/q.":[51],"Such":[52],"construction":[53],"requires":[54,227],"2q":[55,65],"<sup":[56,66],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[57,67],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[58,68],"-":[59],"q":[60],"sources":[63,92,108,152,231],"-q":[69],"terminals.":[72,233],"In":[73,168],"paper,":[75,170],"we":[76,140,171,191],"ask":[77],"following":[79],"question:":[80],"it":[82,100],"possible":[83],"construct":[85,146,164,205],"sum-networks":[87,147],"lesser":[89,149],"or":[93],"terminals?":[94],"[2],":[98],"where":[99],"shown":[102],"there":[104],"exists":[105],"k":[107],"3":[110,179],"terminal":[111],"k-1":[115],"over":[116,180,183,187,224],"k;":[117],"confirms":[118],"at":[120],"least":[121],"for":[122],"values":[124,135],"q,":[128,139,225],"answer":[130],"affirmative.":[132],"For":[133],"various":[134,165],"have":[141,160,192],"made":[142],"an":[143],"attempt":[144],"having":[148],"terminals":[154],"than":[155],"used":[156],"[1],":[158],"been":[161,195],"able":[162,196],"present":[172],"three":[173],"example":[175],"sum-networks,":[176],"capacities":[178],"5;":[181],"4":[182],"7":[184],"5":[186],"12":[188],"respectively.":[189],"However,":[190],"not":[193],"yet":[194],"come":[198],"up":[199],"systematic":[202],"method":[203],"We":[208],"believe":[209],"studying":[211],"these":[212],"examples":[213],"step":[216],"towards":[217],"sum-network,":[220],"which":[226],"minimum":[228]},"counts_by_year":[{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}