{"id":"https://openalex.org/W2001251979","doi":"https://doi.org/10.1109/tit.2012.2236382","title":"Saddle Point in the Minimax Converse for Channel Coding","display_name":"Saddle Point in the Minimax Converse for Channel Coding","publication_year":2012,"publication_date":"2012-12-25","ids":{"openalex":"https://openalex.org/W2001251979","doi":"https://doi.org/10.1109/tit.2012.2236382","mag":"2001251979"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2236382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2236382","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,"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"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/79372","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA","Dept. of Electrical Engineering & Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Dept. of Electrical Engineering & Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031031216"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":7.4694,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.97527647,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"59","issue":"5","first_page":"2576","last_page":"2595"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9983000159263611,"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/T11513","display_name":"stochastic dynamics and bifurcation","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.83637934923172},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6526563763618469},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6440023183822632},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6130689382553101},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5504254102706909},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.5378726124763489},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5019972324371338},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49307700991630554},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4737214148044586},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.45743328332901},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.43530505895614624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4299226999282837},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.42940741777420044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42451682686805725},{"id":"https://openalex.org/keywords/symmetry","display_name":"Symmetry (geometry)","score":0.42097383737564087},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.32796335220336914},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.24535667896270752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23860734701156616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2290038764476776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21726453304290771},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.1813138723373413},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1636972725391388}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.83637934923172},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6526563763618469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6440023183822632},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6130689382553101},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5504254102706909},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.5378726124763489},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5019972324371338},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49307700991630554},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4737214148044586},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.45743328332901},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.43530505895614624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4299226999282837},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.42940741777420044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42451682686805725},{"id":"https://openalex.org/C2779886137","wikidata":"https://www.wikidata.org/wiki/Q21030012","display_name":"Symmetry (geometry)","level":2,"score":0.42097383737564087},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.32796335220336914},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.24535667896270752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23860734701156616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2290038764476776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21726453304290771},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.1813138723373413},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1636972725391388},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2012.2236382","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2236382","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,"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:dspace.mit.edu:1721.1/79372","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/79372","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polyanskiy via Amy Stout","raw_type":"http://purl.org/eprint/type/JournalArticle"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/79372","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/79372","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Polyanskiy via Amy Stout","raw_type":"http://purl.org/eprint/type/JournalArticle"},"sustainable_development_goals":[{"score":0.7799999713897705,"id":"https://metadata.un.org/sdg/1","display_name":"No poverty"}],"awards":[{"id":"https://openalex.org/G1739869781","display_name":null,"funder_award_id":"CCF-0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4246297169","display_name":null,"funder_award_id":"CCF-093937","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6244900323","display_name":null,"funder_award_id":"0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":35,"referenced_works":["https://openalex.org/W615510159","https://openalex.org/W1539118602","https://openalex.org/W1549664537","https://openalex.org/W1989550696","https://openalex.org/W2005530146","https://openalex.org/W2020347709","https://openalex.org/W2024830741","https://openalex.org/W2031831394","https://openalex.org/W2034597819","https://openalex.org/W2044180609","https://openalex.org/W2046495522","https://openalex.org/W2064039105","https://openalex.org/W2078645667","https://openalex.org/W2106215079","https://openalex.org/W2106864314","https://openalex.org/W2107168432","https://openalex.org/W2121373845","https://openalex.org/W2132280433","https://openalex.org/W2142901448","https://openalex.org/W2149685491","https://openalex.org/W2151414914","https://openalex.org/W2153251655","https://openalex.org/W2155890986","https://openalex.org/W2157552746","https://openalex.org/W2276299490","https://openalex.org/W2323265544","https://openalex.org/W2401360159","https://openalex.org/W2578992305","https://openalex.org/W3105659800","https://openalex.org/W3190595840","https://openalex.org/W4205855417","https://openalex.org/W4285719527","https://openalex.org/W6682840654","https://openalex.org/W6713343292","https://openalex.org/W6786017572"],"related_works":["https://openalex.org/W2139769859","https://openalex.org/W2962908977","https://openalex.org/W2140357074","https://openalex.org/W2502955786","https://openalex.org/W2113562070","https://openalex.org/W2583282232","https://openalex.org/W2766354467","https://openalex.org/W2028268383","https://openalex.org/W2372190485","https://openalex.org/W3103136794"],"abstract_inverted_index":{"A":[0,116],"minimax":[1],"metaconverse":[2],"has":[3],"recently":[4],"been":[5],"proposed":[6],"as":[7],"a":[8,12,18,53,86,110,137],"simultaneous":[9],"generalization":[10],"of":[11,14,33,50,55,58,113,139,146,161,173],"number":[13,54],"classical":[15],"results":[16,57],"and":[17,37,74,141,168,177],"tool":[19],"for":[20,119],"the":[21,31,35,45,48,51,69,82,93,96,120,128,144,147,152,158,162,171],"nonasymptotic":[22],"analysis.":[23],"In":[24,47,63],"this":[25],"paper,":[26],"it":[27,65,88],"is":[28,66,72,89,124,155,166],"shown":[29,67],"that":[30,68,91],"order":[32],"optimizing":[34],"input":[36,98],"output":[38,131],"distributions":[39],"can":[40,75,105],"be":[41,76,106,109],"interchanged":[42],"without":[43],"affecting":[44],"bound.":[46],"course":[49],"proof,":[52],"auxiliary":[56],"separate":[59],"interest":[60],"are":[61,179],"obtained.":[62],"particular,":[64],"optimization":[70],"problem":[71],"convex":[73],"solved":[77],"in":[78,92,100,157],"many":[79],"cases":[80],"by":[81,126,175],"symmetry":[83,164,174],"considerations.":[84],"As":[85],"consequence,":[87],"demonstrated":[90],"latter":[94],"cases,":[95],"(multiletter)":[97],"distribution":[99],"information-spectrum":[101],"(Verd\u00fa\u2013Han)":[102],"converse":[103,118],"bound":[104,150],"taken":[107],"to":[108],"(memoryless)":[111],"product":[112],"single-letter":[114],"ones.":[115],"tight":[117],"binary":[121],"erasure":[122],"channel":[123,163],"rederived":[125],"computing":[127],"optimal":[129],"(nonproduct)":[130],"distribution.":[132],"For":[133],"discrete":[134],"memoryless":[135],"channels,":[136],"conjecture":[138],"Poor":[140],"Verd\u00fa":[142],"regarding":[143],"tightness":[145],"information":[148],"spectrum":[149],"on":[151],"error":[153],"exponents":[154],"resolved":[156],"negative.":[159],"Concept":[160],"group":[165],"established":[167],"relations":[169],"with":[170],"definitions":[172],"Gallager":[176],"Dobrushin":[178],"investigated.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}