{"id":"https://openalex.org/W2073467669","doi":"https://doi.org/10.1109/isit.2008.4595373","title":"On approximating the rate regions for lossy source coding with coded and uncoded side information","display_name":"On approximating the rate regions for lossy source coding with coded and uncoded side information","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2073467669","doi":"https://doi.org/10.1109/isit.2008.4595373","mag":"2073467669"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4595373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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/A5014095379","display_name":"WeiHsin Gut","orcid":null},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"WeiHsin Gut","raw_affiliation_strings":["California Institute of Technology, Pasadena, CA, US","Deparmment of Electr. Eng., California Inst. of Technol., Pasadena, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Institute of Technology, Pasadena, CA, US","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Deparmment of Electr. Eng., California Inst. of Technol., Pasadena, CA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103070252","display_name":"Soumya Jana","orcid":"https://orcid.org/0000-0002-2049-2239"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soumya Jana","raw_affiliation_strings":["Department of Electrical Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA","Department of Electrical Engineering, University of Illinois at Urbana-Champaign, 61801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Illinois at Urbana-Champaign, 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5097509178","display_name":"Michelle Effrost","orcid":null},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michelle Effrost","raw_affiliation_strings":["Deparmment of Electrical Engineering, California Institute of Technology, Pasadena, 91125, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Deparmment of Electrical Engineering, California Institute of Technology, Pasadena, 91125, USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7134,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89946988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2162","last_page":"2166"},"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9682000279426575,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9639999866485596,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.8691909313201904},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.6944568753242493},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6226137280464172},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5808292627334595},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.5693624019622803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5686817765235901},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.5684986114501953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5329742431640625},{"id":"https://openalex.org/keywords/shannons-source-coding-theorem","display_name":"Shannon's source coding theorem","score":0.49348247051239014},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.47462689876556396},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.47254252433776855},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.4569679796695709},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44751453399658203},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4253942370414734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36436665058135986},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.34744566679000854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34278935194015503},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.270598828792572},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.14893826842308044},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1240207850933075}],"concepts":[{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.8691909313201904},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.6944568753242493},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6226137280464172},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5808292627334595},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5693624019622803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5686817765235901},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.5684986114501953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5329742431640625},{"id":"https://openalex.org/C177409962","wikidata":"https://www.wikidata.org/wiki/Q2411312","display_name":"Shannon's source coding theorem","level":5,"score":0.49348247051239014},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.47462689876556396},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.47254252433776855},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.4569679796695709},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44751453399658203},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4253942370414734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36436665058135986},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.34744566679000854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34278935194015503},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.270598828792572},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.14893826842308044},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1240207850933075},{"id":"https://openalex.org/C44415725","wikidata":"https://www.wikidata.org/wiki/Q4913893","display_name":"Binary entropy function","level":3,"score":0.0},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C49775889","wikidata":"https://www.wikidata.org/wiki/Q6795896","display_name":"Maximum entropy thermodynamics","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2008.4595373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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":13,"referenced_works":["https://openalex.org/W1549664537","https://openalex.org/W1601541039","https://openalex.org/W2019508332","https://openalex.org/W2029236670","https://openalex.org/W2063002186","https://openalex.org/W2099213070","https://openalex.org/W2127768309","https://openalex.org/W2128126539","https://openalex.org/W2137835428","https://openalex.org/W2148986322","https://openalex.org/W2150412388","https://openalex.org/W2156310455","https://openalex.org/W3215393340"],"related_works":["https://openalex.org/W4312628177","https://openalex.org/W1579872668","https://openalex.org/W2123072960","https://openalex.org/W1607635215","https://openalex.org/W2586352442","https://openalex.org/W2156106714","https://openalex.org/W2952888030","https://openalex.org/W4251361844","https://openalex.org/W2380999719","https://openalex.org/W2786281419"],"abstract_inverted_index":{"We":[0],"derive":[1],"new":[2,51],"algorithms":[3,52],"for":[4,9,38,84],"approximating":[5],"the":[6,29,48,75,107,128,142,144,168,173,177],"rate":[7],"regions":[8,77],"a":[10,54,98,138,163],"family":[11],"of":[12,74,176],"source":[13,19,22,40,169],"coding":[14,23,41,170],"problems":[15],"that":[16,119,165],"includes":[17],"lossy":[18,21,39,65],"coding,":[20],"with":[24,42],"uncoded":[25],"side":[26,44],"information":[27,71],"at":[28,47],"receiver":[30],"(the":[31],"Wyner-Ziv":[32],"problem),":[33],"and":[34,60,111,172],"an":[35],"achievability":[36],"bound":[37,110],"coded":[43],"in":[45],"formation":[46],"receiver.":[49],"The":[50],"generalize":[53],"recent":[55],"approximation":[56],"algorithm":[57,96],"by":[58,141],"Go":[59],"Effros":[61],"from":[62],"lossless":[63],"to":[64,82,88],"coding.":[66],"In":[67],"each":[68],"case,":[69],"prior":[70],"theoretic":[72],"descriptions":[73],"desired":[76,108],"are":[78,124],"available":[79],"but":[80],"difficult":[81],"evaluate":[83],"example":[85],"sources":[86],"due":[87],"their":[89],"dependence":[90],"on":[91,167],"auxiliary":[92],"random":[93],"variables.":[94],"Our":[95],"builds":[97],"linear":[99],"program":[100],"whose":[101],"solution":[102],"is":[103,131,137,162],"no":[104,112],"less":[105],"than":[106,114],"lower":[109],"greater":[113],"(1":[115],"+":[116],"\u2208)":[117],"times":[118],"optimal":[120,129],"value.":[121],"These":[122],"guarantees":[123],"met":[125],"even":[126],"when":[127],"value":[130],"unknown.":[132],"Here":[133],"\u2208":[134],"\u226b":[135,160],"0":[136],"parameter":[139],"chosen":[140],"user;":[143],"algorithmic":[145],"complexity":[146],"grows":[147],"as":[148,154],"O(\u2208":[149],"<sup":[150],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2212M</sup>":[152],")":[153],"e":[155],"approaches":[156],"0,":[157],"where":[158],"M":[159],"4":[161],"constant":[164],"depends":[166],"problem":[171],"alphabet":[174],"sizes":[175],"sources.":[178]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}