{"id":"https://openalex.org/W2963619971","doi":"https://doi.org/10.1109/isit.2016.7541430","title":"Algorithmic aspects of optimal channel coding","display_name":"Algorithmic aspects of optimal channel coding","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2963619971","doi":"https://doi.org/10.1109/isit.2016.7541430","mag":"2963619971"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","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/A5039018238","display_name":"Siddharth Barman","orcid":"https://orcid.org/0000-0001-9276-2181"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Siddharth Barman","raw_affiliation_strings":["Department of Computer Science and Automation, IISc Bangalore, India","Department of Computer Science and Automation, IISc, Bangalore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automation, IISc Bangalore, India","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Department of Computer Science and Automation, IISc, Bangalore","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023562540","display_name":"Omar Fawzi","orcid":"https://orcid.org/0000-0001-8491-0359"},"institutions":[{"id":"https://openalex.org/I4210103330","display_name":"\u00c9cole Normale Sup\u00e9rieure","ror":"https://ror.org/01dp7jr64","country_code":"BI","type":"education","lineage":["https://openalex.org/I4210103330"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]},{"id":"https://openalex.org/I4210153303","display_name":"\u00c9cole Normale Sup\u00e9rieure d'Abidjan","ror":"https://ror.org/04xtpyw05","country_code":"CI","type":"education","lineage":["https://openalex.org/I4210153303"]}],"countries":["BI","CI","FR"],"is_corresponding":false,"raw_author_name":"Omar Fawzi","raw_affiliation_strings":["Laboratoire de l'Informatique du Parall&#x00E9;lisme, &#x00C9;cole Normale Sup&#x00E9;rieure de Lyon, France","Ecole Normale Sup\u00e9rieure de, Laboratoire de I'Informatique du Parall\u00e9lisme, Lyon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de l'Informatique du Parall&#x00E9;lisme, &#x00C9;cole Normale Sup&#x00E9;rieure de Lyon, France","institution_ids":["https://openalex.org/I4210144566"]},{"raw_affiliation_string":"Ecole Normale Sup\u00e9rieure de, Laboratoire de I'Informatique du Parall\u00e9lisme, Lyon","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I4210103330","https://openalex.org/I4210153303"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8833,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.86155243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"905","last_page":"909"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9983000159263611,"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/communication-source","display_name":"Communication source","score":0.6477681994438171},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5503664016723633},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.5194137096405029},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5121369361877441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.470082551240921},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46122270822525024},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45949888229370117},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4545714855194092},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.45030224323272705},{"id":"https://openalex.org/keywords/quantum-entanglement","display_name":"Quantum entanglement","score":0.44988328218460083},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.4220088720321655},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.412124365568161},{"id":"https://openalex.org/keywords/expected-value","display_name":"Expected value","score":0.41031157970428467},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39225637912750244},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3565501570701599},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.26462018489837646},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17107415199279785},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.14390769600868225},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08490237593650818}],"concepts":[{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.6477681994438171},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5503664016723633},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.5194137096405029},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5121369361877441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.470082551240921},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46122270822525024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45949888229370117},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4545714855194092},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.45030224323272705},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.44988328218460083},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.4220088720321655},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.412124365568161},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.41031157970428467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39225637912750244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3565501570701599},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.26462018489837646},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17107415199279785},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.14390769600868225},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08490237593650818},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2016.7541430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01992092v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01992092","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 2018, 64 (2), pp.1038-1045","raw_type":"Journal articles"},{"id":"pmh:oai:eprints.iisc.ac.in:58905","is_oa":false,"landing_page_url":"http://eprints.iisc.ac.in/58905/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309398","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1899372466","https://openalex.org/W1899677993","https://openalex.org/W1973315504","https://openalex.org/W1978553093","https://openalex.org/W1995875735","https://openalex.org/W2001251979","https://openalex.org/W2024830741","https://openalex.org/W2051707898","https://openalex.org/W2053861514","https://openalex.org/W2058625806","https://openalex.org/W2072291569","https://openalex.org/W2077801543","https://openalex.org/W2080169294","https://openalex.org/W2104340231","https://openalex.org/W2106864314","https://openalex.org/W2123090656","https://openalex.org/W2143996311","https://openalex.org/W2154933482","https://openalex.org/W2236569555","https://openalex.org/W2266878870","https://openalex.org/W2276299490","https://openalex.org/W2500139799","https://openalex.org/W2914679068","https://openalex.org/W2950067144","https://openalex.org/W2950733002","https://openalex.org/W2963550666","https://openalex.org/W2963619971","https://openalex.org/W3037170129","https://openalex.org/W3099057269","https://openalex.org/W3100079437","https://openalex.org/W4211058570","https://openalex.org/W4297533728","https://openalex.org/W6682689614","https://openalex.org/W6724212191"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W4313349366","https://openalex.org/W1969022758","https://openalex.org/W3187845285","https://openalex.org/W2088214533"],"abstract_inverted_index":{"A":[0],"central":[1],"question":[2],"in":[3,17,32,46],"information":[4],"theory":[5],"is":[6,97,126,173],"to":[7,128],"determine":[8],"the":[9,33,47,54,59,67,72,80,92,117,148,151,155,183,186,194,198],"maximum":[10,73,81,118],"success":[11,74,119,156],"probability":[12,75,157],"that":[13,71,103],"can":[14,76,153],"be":[15,77],"achieved":[16],"sending":[18],"a":[19,25,40,84,98,105,108,159],"fixed":[20],"number":[21],"of":[22,36,49,53,66,83,116,161,197,200],"messages":[23],"over":[24],"noisy":[26],"channel.":[27,55,68],"This":[28],"was":[29],"first":[30],"studied":[31],"pioneering":[34],"work":[35],"Shannon":[37],"who":[38],"established":[39],"simple":[41,99],"expression":[42],"characterizing":[43],"this":[44,88,123,171],"quantity":[45],"limit":[48],"multiple":[50],"independent":[51],"uses":[52],"Here,":[56],"we":[57,90],"consider":[58],"general":[60],"setting":[61],"with":[62],"only":[63],"one":[64,176],"use":[65],"We":[69,189],"observe":[70],"expressed":[78],"as":[79],"value":[82],"submodular":[85],"function.":[86],"Using":[87],"connection,":[89],"establish":[91],"following":[93],"results:":[94],"1)":[95],"There":[96],"greedy":[100],"polynomial-time":[101],"algorithm":[102],"computes":[104],"code":[106],"achieving":[107],"(1":[109,136],"-":[110,137],"e":[111,138],"<sup":[112,139,165],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[113,140,166],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-1</sup>":[114,141,167],")-approximation":[115],"probability.":[120],"Moreover,":[121],"for":[122],"problem":[124],"it":[125],"NP-hard":[127],"obtain":[129],"an":[130,178],"approximation":[131],"ratio":[132],"strictly":[133],"better":[134],"than":[135],").":[142],"2)":[143],"Shared":[144],"quantum":[145],"entanglement":[146],"between":[147,182],"sender":[149,184],"and":[150,185],"receiver":[152],"increase":[154],"by":[158],"factor":[160,172],"at":[162],"most":[163],"1/1-e":[164],".":[168],"In":[169],"addition,":[170],"tight":[174,191],"if":[175],"allows":[177],"arbitrary":[179],"non-signaling":[180],"box":[181],"receiver.":[187],"3)":[188],"give":[190],"bounds":[192],"on":[193],"one-shot":[195],"performance":[196],"meta-converse":[199],"Polyanskiy-Poor-Verd\u00fa.":[201]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}