{"id":"https://openalex.org/W2117577969","doi":"https://doi.org/10.1109/tit.2010.2090196","title":"Minimum Cost Distributed Source Coding Over a Network","display_name":"Minimum Cost Distributed Source Coding Over a Network","publication_year":2010,"publication_date":"2010-12-29","ids":{"openalex":"https://openalex.org/W2117577969","doi":"https://doi.org/10.1109/tit.2010.2090196","mag":"2117577969"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2090196","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2090196","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Aditya Ramamoorthy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA#TAB#","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055656185"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":5.6979,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.9637918,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"57","issue":"1","first_page":"461","last_page":"475"},"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.9988999962806702,"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.9987999796867371,"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/subgradient-method","display_name":"Subgradient method","score":0.8233212232589722},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.659263551235199},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6571940779685974},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6025906205177307},{"id":"https://openalex.org/keywords/bundle","display_name":"Bundle","score":0.49496668577194214},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4779755771160126},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"Distributed source coding","score":0.42233315110206604},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.410759299993515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30140000581741333},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.2789124846458435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2764085531234741},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.19123855233192444},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12256002426147461},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.08453485369682312}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8233212232589722},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.659263551235199},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6571940779685974},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6025906205177307},{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.49496668577194214},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4779755771160126},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.42233315110206604},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.410759299993515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30140000581741333},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.2789124846458435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2764085531234741},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.19123855233192444},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12256002426147461},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.08453485369682312},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2010.2090196","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2090196","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W153872779","https://openalex.org/W1787995280","https://openalex.org/W2007994383","https://openalex.org/W2009635151","https://openalex.org/W2027315116","https://openalex.org/W2031545685","https://openalex.org/W2041221438","https://openalex.org/W2045334208","https://openalex.org/W2048235391","https://openalex.org/W2063856759","https://openalex.org/W2068143054","https://openalex.org/W2073819859","https://openalex.org/W2088587246","https://openalex.org/W2088908785","https://openalex.org/W2096704225","https://openalex.org/W2096714097","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2107499450","https://openalex.org/W2109547112","https://openalex.org/W2110575505","https://openalex.org/W2113578340","https://openalex.org/W2117528175","https://openalex.org/W2117538122","https://openalex.org/W2121173360","https://openalex.org/W2121205191","https://openalex.org/W2121255383","https://openalex.org/W2123097741","https://openalex.org/W2123562143","https://openalex.org/W2123986621","https://openalex.org/W2128895134","https://openalex.org/W2130057404","https://openalex.org/W2131414525","https://openalex.org/W2135812051","https://openalex.org/W2136968358","https://openalex.org/W2138256990","https://openalex.org/W2147101953","https://openalex.org/W2149094627","https://openalex.org/W2157683518","https://openalex.org/W2162404506","https://openalex.org/W2171266829","https://openalex.org/W2171376656","https://openalex.org/W4213060235","https://openalex.org/W4244633107","https://openalex.org/W4250589301","https://openalex.org/W6638183917","https://openalex.org/W6674550039"],"related_works":["https://openalex.org/W2359120930","https://openalex.org/W2037613239","https://openalex.org/W2781777036","https://openalex.org/W2390469630","https://openalex.org/W1971290991","https://openalex.org/W4378770495","https://openalex.org/W2059050877","https://openalex.org/W2962762987","https://openalex.org/W41756448","https://openalex.org/W1531212695"],"abstract_inverted_index":{"This":[0,94],"paper":[1],"considers":[2],"the":[3,21,26,32,43,46,65,68,71,90,114,117,130,134],"problem":[4,61],"of":[5,45,70,75,84,92,116],"transmitting":[6],"multiple":[7],"compressible":[8],"sources":[9,27],"over":[10],"a":[11,82,102],"network":[12,33],"at":[13,24],"minimum":[14],"cost.":[15],"The":[16,60],"aim":[17],"is":[18,48,62,87],"to":[19],"find":[20],"optimal":[22],"rates":[23],"which":[25,36,105],"should":[28,38],"be":[29,39,109],"compressed":[30],"and":[31,56,125,133],"flows":[34],"using":[35],"they":[37],"transmitted":[40],"so":[41],"that":[42,67,86],"cost":[44,58],"transmission":[47],"minimal.":[49],"We":[50,100],"consider":[51],"networks":[52],"with":[53,122],"capacity":[54],"constraints":[55,85],"linear":[57],"functions.":[59],"complicated":[63],"by":[64,112],"fact":[66],"description":[69],"feasible":[72,118],"rate":[73,119],"region":[74],"distributed":[76],"source":[77],"coding":[78],"problems":[79,107],"typically":[80],"has":[81],"number":[83,91],"exponential":[88],"in":[89,104],"sources.":[93],"renders":[95],"general":[96],"purpose":[97],"solvers":[98],"inefficient.":[99],"present":[101],"framework":[103],"these":[106],"can":[108],"solved":[110],"efficiently":[111],"exploiting":[113],"structure":[115],"regions":[120],"coupled":[121],"dual":[123],"decomposition":[124],"optimization":[126],"techniques":[127],"such":[128],"as":[129],"subgradient":[131],"method":[132],"proximal":[135],"bundle":[136],"method.":[137]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}