{"id":"https://openalex.org/W2099265255","doi":"https://doi.org/10.1109/isit.2011.6034077","title":"Distributed compression of linear functions: Partial sum-rate tightness and gap to optimal sum-rate","display_name":"Distributed compression of linear functions: Partial sum-rate tightness and gap to optimal sum-rate","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2099265255","doi":"https://doi.org/10.1109/isit.2011.6034077","mag":"2099265255"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6034077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6034077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"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/A5100397670","display_name":"Yang Yang","orcid":"https://orcid.org/0000-0002-7891-2670"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Yang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA","Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058154161","display_name":"Zixiang Xiong","orcid":"https://orcid.org/0000-0002-4714-3311"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zixiang Xiong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA","Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Texas A&M University, College Station, 77843, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.3425,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78777141,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2766","last_page":"2770"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9970999956130981,"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/rate-distortion","display_name":"Rate distortion","score":0.7145626544952393},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6849032044410706},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5708447098731995},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.4648147523403168},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.43591535091400146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43518245220184326},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42650169134140015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4179858863353729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3612498939037323},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.3534373641014099},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1652790904045105},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15402275323867798},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.13232412934303284}],"concepts":[{"id":"https://openalex.org/C2982755384","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate distortion","level":3,"score":0.7145626544952393},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6849032044410706},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5708447098731995},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.4648147523403168},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.43591535091400146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43518245220184326},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42650169134140015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4179858863353729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3612498939037323},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.3534373641014099},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1652790904045105},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15402275323867798},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13232412934303284},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2011.6034077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6034077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1505612824","https://openalex.org/W2012366779","https://openalex.org/W2019307453","https://openalex.org/W2099265255","https://openalex.org/W2109053700","https://openalex.org/W2120864408","https://openalex.org/W2124317079","https://openalex.org/W2124482080","https://openalex.org/W2172236196"],"related_works":["https://openalex.org/W2153045475","https://openalex.org/W2141359779","https://openalex.org/W2166218295","https://openalex.org/W2771169645","https://openalex.org/W4386322314","https://openalex.org/W2272138664","https://openalex.org/W2794142556","https://openalex.org/W2306212322","https://openalex.org/W2065946673","https://openalex.org/W2271827173"],"abstract_inverted_index":{"We":[0,42],"consider":[1],"the":[2,8,49,54,57,61,89,116,125,134],"problem":[3,39,59,65],"of":[4,7,56,88,140],"distributed":[5],"compression":[6],"difference":[9],"Z":[10],"=":[11],"Y1-cY2of":[12],"two":[13],"jointly":[14],"Gaussian":[15],"sources":[16],"Y1and":[17],"Y2(with":[18],"positive":[19,24],"correlation":[20],"coefficient":[21],"\u03c1":[22],"and":[23,100,143],"c)":[25],"under":[26],"an":[27],"MSE":[28],"distortion":[29],"constraint":[30],"D":[31,101],"on":[32,48],"Z.":[33],"The":[34],"rate":[35],"region":[36],"for":[37,137],"this":[38],"is":[40,94,102],"unknown.":[41],"provide":[43],"a":[44],"new":[45],"lower":[46,70,109],"bound":[47,71,110],"minimum":[50],"sum-rate":[51,86,136],"by":[52],"utilizing":[53],"connection":[55],"above":[58],"with":[60,66],"two-terminal":[62],"source":[63],"coding":[64],"matrix-distortion":[67],"constraint.":[68],"Our":[69],"not":[72],"only":[73],"improves":[74],"existing":[75],"bounds":[76],"in":[77,122],"many":[78],"cases,":[79],"but":[80],"also":[81],"allows":[82],"us":[83,112],"to":[84,113],"prove":[85],"tightness":[87],"Berger-Tung":[90],"scheme":[91,119],"when":[92],"c":[93],"either":[95],"relatively":[96],"small":[97],"or":[98],"large":[99],"larger":[103],"than":[104],"some":[105],"threshold.":[106],"Furthermore,":[107],"our":[108],"enables":[111],"show":[114],"that":[115],"improved":[117],"lattice-based":[118],"recently":[120],"introduced":[121],"[1]":[123],"(with":[124],"smallest":[126],"achievable":[127],"sum-rate)":[128],"performs":[129],"within":[130],"1.18":[131],"b/s":[132],"from":[133],"optimal":[135],"all":[138],"values":[139],"\u03c1,":[141],"c,":[142],"D.":[144]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
