{"id":"https://openalex.org/W2164176006","doi":"https://doi.org/10.1109/isit.2009.5205656","title":"The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function","display_name":"The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2164176006","doi":"https://doi.org/10.1109/isit.2009.5205656","mag":"2164176006"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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/A5077741905","display_name":"Himanshu Tyagi","orcid":"https://orcid.org/0000-0003-2950-706X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Himanshu Tyagi","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Institute of Systems Research, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute of Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102896474","display_name":"Prakash Narayan","orcid":"https://orcid.org/0000-0002-0710-6305"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prakash Narayan","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Institute of Systems Research, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute of Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077741905"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.6096,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.7414443,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"9","issue":null,"first_page":"1954","last_page":"1957"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9930999875068665,"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.9930999875068665,"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9915000200271606,"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/T12029","display_name":"DNA and Biological Computing","score":0.9872999787330627,"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/converse","display_name":"Converse","score":0.9764349460601807},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.7934979796409607},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7820885181427002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6864629983901978},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.596266508102417},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5240179300308228},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5121524333953857},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4946260154247284},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.41461920738220215},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3926181197166443},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32834580540657043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20591005682945251},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1202426552772522},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08505600690841675}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.9764349460601807},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.7934979796409607},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7820885181427002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6864629983901978},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.596266508102417},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5240179300308228},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5121524333953857},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4946260154247284},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41461920738220215},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3926181197166443},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32834580540657043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20591005682945251},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1202426552772522},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08505600690841675},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2009.5205656","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.249.2517","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.249.2517","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0910.0653v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.716.1170","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.716.1170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.iisc.ernet.in/%7Ehtyagi/papers/tyagi-narayan09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.41999998688697815,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1549664537","https://openalex.org/W1978910765","https://openalex.org/W2035894387","https://openalex.org/W2795945545"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2963377682","https://openalex.org/W2043159103","https://openalex.org/W2391769344","https://openalex.org/W4297790016","https://openalex.org/W2359260952","https://openalex.org/W1998171255","https://openalex.org/W4221036368","https://openalex.org/W155536188"],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2,11,37,63,73,77,81,94,100],"Gelfand-Pinsker":[3],"discrete":[4],"memoryless":[5],"channel":[6],"(DMC)":[7],"model":[8],"and":[9],"provide":[10],"strong":[12,18],"converse":[13,19],"for":[14,46,80,107],"its":[15],"capacity.":[16],"The":[17],"is":[20,36,72],"then":[21],"used":[22],"to":[23],"obtain":[24],"an":[25,43,87],"upper":[26,44,88],"bound":[27,45,89],"on":[28,90],"the":[29,47,91,109],"reliability":[30],"function.":[31],"Instrumental":[32],"in":[33],"our":[34],"proofs":[35],"new":[38],"technical":[39,70],"lemma":[40],"which":[41],"provides":[42,86],"rate":[48,92],"of":[49,62,66,76,93,99],"codes":[50],"with":[51,97],"codewords":[52,98],"that":[53,85],"are":[54],"conditionally":[55],"typical":[56,64],"over":[57],"large":[58],"message":[59],"dependent":[60],"subsets":[61],"set":[65],"state":[67],"sequences.":[68],"This":[69],"result":[71,79],"nonstraightforward":[74],"analog":[75],"known":[78],"DMC":[82],"without":[83],"states":[84],"good":[95],"code":[96],"fixed":[101],"type":[102],"(to":[103],"be":[104],"found":[105],"in,":[106],"instance,":[108],"Csiszar-Kurner":[110],"book).":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}