{"id":"https://openalex.org/W2910496827","doi":"https://doi.org/10.1109/itw.2018.8613497","title":"An Upper bound on the Error Exponent in Lossless Source Coding with a Helper","display_name":"An Upper bound on the Error Exponent in Lossless Source Coding with a Helper","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2910496827","doi":"https://doi.org/10.1109/itw.2018.8613497","mag":"2910496827"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2018.8613497","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","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/A5024845943","display_name":"Wei Kang","orcid":"https://orcid.org/0000-0003-4408-6419"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Kang","raw_affiliation_strings":["School of Information Science and Engineering and Shing-Tung Yau Center, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Engineering and Shing-Tung Yau Center, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100622088","display_name":"Nan Liu","orcid":"https://orcid.org/0000-0003-4155-0685"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Nan Liu","raw_affiliation_strings":["National Mobile Communications Research Laboratory, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"National Mobile Communications Research Laboratory, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024845943"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15940459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9950000047683716,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9889000058174133,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8407185077667236},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.7962887287139893},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.7572526931762695},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6197109222412109},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.573107123374939},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5606290102005005},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.537310004234314},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46038389205932617},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.44654327630996704},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.44372987747192383},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42652103304862976},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.41590234637260437},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4042150378227234},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3398118019104004},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.33594733476638794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2624284625053406},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1728440523147583},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15000900626182556}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8407185077667236},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.7962887287139893},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.7572526931762695},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6197109222412109},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.573107123374939},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5606290102005005},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.537310004234314},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46038389205932617},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.44654327630996704},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.44372987747192383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42652103304862976},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.41590234637260437},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4042150378227234},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3398118019104004},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.33594733476638794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2624284625053406},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1728440523147583},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15000900626182556},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2018.8613497","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613497","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1549664537","https://openalex.org/W1986741231","https://openalex.org/W2084360170","https://openalex.org/W2099213070","https://openalex.org/W2104641770","https://openalex.org/W2116661435","https://openalex.org/W2127768309","https://openalex.org/W4302366875"],"related_works":["https://openalex.org/W1776233866","https://openalex.org/W2950656357","https://openalex.org/W2154082589","https://openalex.org/W2158824308","https://openalex.org/W2159058996","https://openalex.org/W2787653234","https://openalex.org/W2963226898","https://openalex.org/W1491239575","https://openalex.org/W2032523911","https://openalex.org/W4301735652"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,9,20,27,32,35,43,51,60,66,72,75],"error":[6,44],"exponent":[7],"in":[8,31],"problem":[10],"of":[11,34,74],"lossless":[12],"source":[13],"coding":[14],"with":[15],"a":[16],"helper.":[17],"We":[18],"use":[19],"inherently":[21],"typical":[22],"subset":[23],"lemma":[24],"to":[25,50,71],"remove":[26],"Markov":[28],"chain":[29],"constraint":[30],"proof":[33],"converse":[36],"and":[37,59],"obtain":[38],"an":[39],"upper":[40,57],"bound":[41,58,63],"on":[42],"exponent,":[45],"which":[46],"is":[47,69],"very":[48],"close":[49,70],"existing":[52,61],"lower":[53,62],"bound.":[54],"The":[55],"proposed":[56],"meet":[64],"when":[65],"rate":[67,77],"pair":[68],"boundary":[73],"optimal":[76],"region.":[78]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}