{"id":"https://openalex.org/W1570757625","doi":"https://doi.org/10.1109/isit.2010.5513304","title":"On zero-error source coding with feedback","display_name":"On zero-error source coding with feedback","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W1570757625","doi":"https://doi.org/10.1109/isit.2010.5513304","mag":"1570757625"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513304","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513304","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 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/A5080893953","display_name":"Mayank Bakshi","orcid":"https://orcid.org/0000-0002-6051-923X"},"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":true,"raw_author_name":"Mayank Bakshi","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001054791","display_name":"Michelle Effros","orcid":"https://orcid.org/0000-0003-3757-0675"},"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 Effros","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena 91125, USA#TAB#","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080893953"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.03860512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":1.0,"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":1.0,"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.9973999857902527,"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/T12029","display_name":"DNA and Biological Computing","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6498501300811768},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.6266345977783203},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.6186001896858215},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6178715825080872},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5222259759902954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4377305507659912},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4371569752693176},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.43213361501693726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4306317865848541},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.42239809036254883},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.36990612745285034},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.30700060725212097},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16045144200325012}],"concepts":[{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6498501300811768},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.6266345977783203},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.6186001896858215},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6178715825080872},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5222259759902954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4377305507659912},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4371569752693176},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.43213361501693726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4306317865848541},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.42239809036254883},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.36990612745285034},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.30700060725212097},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16045144200325012},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513304","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513304","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.550000011920929,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1974902810","https://openalex.org/W2062782005","https://openalex.org/W2071801393","https://openalex.org/W2095647873","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2108719798","https://openalex.org/W2112285495","https://openalex.org/W2119336214","https://openalex.org/W2146778221","https://openalex.org/W2149643937","https://openalex.org/W2157674959","https://openalex.org/W2159549640","https://openalex.org/W2913409262","https://openalex.org/W4255155072","https://openalex.org/W6674292702","https://openalex.org/W6758536211"],"related_works":["https://openalex.org/W4300811249","https://openalex.org/W2950014831","https://openalex.org/W811676365","https://openalex.org/W2887343277","https://openalex.org/W2057549912","https://openalex.org/W1980293270","https://openalex.org/W2044501949","https://openalex.org/W1634535833","https://openalex.org/W2121815391","https://openalex.org/W2147544396"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,18,32,35,58,80,84,97],"problem":[3],"of":[4,41,67,99],"zero":[5,72],"error":[6],"source":[7,33,42],"coding":[8,78],"with":[9,49,96],"limited":[10],"feedback":[11,73],"when":[12],"side":[13,36,44],"information":[14,45],"is":[15],"present":[16],"at":[17,79],"receiver.":[19],"First,":[20],"we":[21,52,63,92],"derive":[22],"an":[23],"achievable":[24],"rate":[25,60,81],"region":[26],"for":[27,69,87],"arbitrary":[28],"joint":[29],"distributions":[30],"on":[31],"and":[34,43],"information.":[37],"When":[38],"all":[39],"pairs":[40],"symbols":[46],"are":[47],"observed":[48],"non-zero":[50],"probability,":[51],"show":[53],"that":[54],"this":[55],"characterization":[56],"gives":[57],"entire":[59],"region.":[61],"Next,":[62],"demonstrate":[64],"a":[65],"class":[66],"sources":[68],"which":[70],"asymptotically":[71,88],"suffices":[74],"to":[75],"achieve":[76],"zero-error":[77],"promised":[82],"by":[83],"Slepian-Wolf":[85],"bound":[86],"lossless":[89],"coding.":[90],"Finally,":[91],"illustrate":[93],"these":[94],"results":[95],"aid":[98],"three":[100],"simple":[101],"examples.":[102]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
