{"id":"https://openalex.org/W2146778221","doi":"https://doi.org/10.1109/tit.2002.806154","title":"On zero-error source coding with decoder side information","display_name":"On zero-error source coding with decoder side information","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2146778221","doi":"https://doi.org/10.1109/tit.2002.806154","mag":"2146778221"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2002.806154","doi":"https://doi.org/10.1109/tit.2002.806154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2002.806154","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,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},"volume":null,"type":"article","is_traditional":true,"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/A5046237305","display_name":"Prashant Koulgi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Koulgi","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA","Dept. of Electr. & Comput. Eng., Univ. of California Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of California Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076381426","display_name":"Ertem Tuncel","orcid":"https://orcid.org/0000-0001-9002-7562","observed_orcids":["https://orcid.org/0000-0001-9002-7562"]},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Tuncel","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA","Dept. of Electr. & Comput. Eng., Univ. of California Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of California Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007015819","display_name":"Shankar L. Regunathan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.L. Regunathan","raw_affiliation_strings":["Microsoft Corporation, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Corporation, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026459097","display_name":"Kenneth H. Rose","orcid":"https://orcid.org/0000-0001-9463-2647","observed_orcids":["https://orcid.org/0000-0001-9463-2647"]},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Rose","raw_affiliation_strings":["Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":4.1816,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.92420538,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"49","issue":"1","first_page":"99","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.57669997215271,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.57669997215271,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.26100000739097595,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.055399999022483826,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/decoder-side-information","display_name":"decoder side information","score":0.9459999799728394},{"id":"https://openalex.org/keywords/perfect-graphs","display_name":"perfect graphs","score":0.9100000262260437},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8289999961853027},{"id":"https://openalex.org/keywords/suboptimal-algorithms","display_name":"suboptimal algorithms","score":0.7139999866485596},{"id":"https://openalex.org/keywords/performance-guarantees","display_name":"performance guarantees","score":0.6399999856948853}],"concepts":[{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.7340552806854248},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5429375767707825},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5313416719436646},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.529569149017334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5240473747253418},{"id":"https://openalex.org/C200801453","wikidata":"https://www.wikidata.org/wiki/Q5283181","display_name":"Distributed source coding","level":4,"score":0.5029889941215515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4950084090232849},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4882340729236603},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4619584083557129},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.455486923456192},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.451550155878067},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4485347867012024},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.4467692971229553},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.44406017661094666},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.44279250502586365},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.4359479546546936},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.427133709192276},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4235067069530487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34788233041763306},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2928413450717926},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.24661344289779663},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10759961605072021},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2002.806154","doi":"https://doi.org/10.1109/tit.2002.806154","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2002.806154","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,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.367.3442","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.scl.ece.ucsb.edu/pubs/pubs_D/d03_3.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W86626612","https://openalex.org/W1530753374","https://openalex.org/W1573715174","https://openalex.org/W1608472120","https://openalex.org/W1825115363","https://openalex.org/W1963893227","https://openalex.org/W1971612822","https://openalex.org/W1977529491","https://openalex.org/W1990992471","https://openalex.org/W2011039300","https://openalex.org/W2019262465","https://openalex.org/W2060108852","https://openalex.org/W2071801393","https://openalex.org/W2078289947","https://openalex.org/W2098632144","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2110110846","https://openalex.org/W2112575355","https://openalex.org/W2119336214","https://openalex.org/W2125423176","https://openalex.org/W2138522979","https://openalex.org/W2146963604","https://openalex.org/W2148986322","https://openalex.org/W2153663865","https://openalex.org/W2164684058","https://openalex.org/W2478708596","https://openalex.org/W2577446513","https://openalex.org/W4210731599"],"related_works":["https://openalex.org/W1715417177","https://openalex.org/W2473688526","https://openalex.org/W4394847360","https://openalex.org/W2132561826","https://openalex.org/W2076675021","https://openalex.org/W1974902810","https://openalex.org/W2160142064","https://openalex.org/W7006125549","https://openalex.org/W2119265570","https://openalex.org/W2120805995"],"abstract_inverted_index":{"Let":[0],"(X,Y)":[1],"be":[2,55],"a":[3,10,18],"pair":[4],"of":[5,50,60,88,94],"random":[6],"variables":[7],"distributed":[8],"over":[9],"finite":[11],"product":[12],"set":[13],"V/spl":[14],"times/W":[15],"according":[16],"to":[17,40,54],"probability":[19],"distribution":[20],"P(x,y).":[21],"The":[22,45,91],"following":[23],"source":[24],"coding":[25],"problem":[26],"is":[27,52,102,108,115],"considered:":[28],"the":[29,34,56,68,85],"encoder":[30],"knows":[31,36],"X,":[32],"while":[33],"decoder":[35],"Y":[37],"and":[38,72,123,126],"wants":[39],"learn":[41],"X":[42],"without":[43],"error.":[44],"minimum":[46,77],"zero-error":[47],"asymptotic":[48],"rate":[49,78],"transmission":[51],"shown":[53,103],"complementary":[57],"graph":[58],"entropy":[59],"an":[61],"associated":[62],"graph.":[63],"Thus,":[64],"previous":[65],"results":[66],"in":[67],"literature":[69],"provide":[70],"upper":[71],"lower":[73],"bounds":[74,81],"for":[75,84],"this":[76],"(further,":[79],"these":[80],"are":[82,98,120,131],"tight":[83],"important":[86],"class":[87],"perfect":[89],"graphs).":[90],"algorithmic":[92],"aspects":[93],"instantaneous":[95],"code":[96,106,112],"design":[97,107,113],"considered":[99],"next.":[100],"It":[101],"that":[104],"optimal":[105,111],"NP-hard.":[109],"An":[110],"algorithm":[114],"derived.":[116],"Polynomial-time":[117],"suboptimal":[118],"algorithms":[119],"also":[121],"presented,":[122],"their":[124],"average":[125],"worst":[127],"case":[128],"performance":[129],"guarantees":[130],"established.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}