{"id":"https://openalex.org/W2268511771","doi":"https://doi.org/10.1109/tit.2017.2696963","title":"Algorithmic Aspects of Optimal Channel Coding","display_name":"Algorithmic Aspects of Optimal Channel Coding","publication_year":2017,"publication_date":"2017-04-24","ids":{"openalex":"https://openalex.org/W2268511771","doi":"https://doi.org/10.1109/tit.2017.2696963","mag":"2268511771"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2696963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2696963","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1508.04095","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Siddharth Barman","orcid":null},"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":["Indian Institute of Science, Bengaluru, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bengaluru, India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":null,"display_name":"Omar Fawzi","orcid":"https://orcid.org/0000-0001-8491-0359"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Omar Fawzi","raw_affiliation_strings":["Laboratoire de l\u2019Informatique du Parall\u00e9lisme, ENS Lyon, Universit\u00e9 de Lyon, Lyon, France"],"raw_orcid":"https://orcid.org/0000-0001-8491-0359","affiliations":[{"raw_affiliation_string":"Laboratoire de l\u2019Informatique du Parall\u00e9lisme, ENS Lyon, Universit\u00e9 de Lyon, Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I113428412","https://openalex.org/I100532134"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5848,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.68441917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"64","issue":"2","first_page":"1038","last_page":"1045"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.2833000123500824,"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.2833000123500824,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.21469999849796295,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.1736000031232834,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.7124999761581421},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6579999923706055},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.5583999752998352},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.498199999332428},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48840001225471497},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.47279998660087585},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.46650001406669617},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4415999948978424},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.40209999680519104},{"id":"https://openalex.org/keywords/expected-value","display_name":"Expected value","score":0.3952000141143799}],"concepts":[{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.7124999761581421},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6579999923706055},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.5583999752998352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5059999823570251},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.498199999332428},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48840001225471497},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.47279998660087585},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.46650001406669617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4456000030040741},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4415999948978424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41280001401901245},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.40209999680519104},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.3952000141143799},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.39100000262260437},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.3772999942302704},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.3646000027656555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35839998722076416},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35670000314712524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35499998927116394},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3546000123023987},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.3474999964237213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3431999981403351},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C152139883","wikidata":"https://www.wikidata.org/wiki/Q252973","display_name":"Mutual information","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C13944312","wikidata":"https://www.wikidata.org/wiki/Q7512748","display_name":"Signal-to-noise ratio (imaging)","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2802000045776367},{"id":"https://openalex.org/C122203268","wikidata":"https://www.wikidata.org/wiki/Q5862903","display_name":"Probability theory","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.2547999918460846},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2017.2696963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2696963","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:arXiv.org:1508.04095","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1508.04095","pdf_url":"https://arxiv.org/pdf/1508.04095","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1508.04095","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1508.04095","pdf_url":"https://arxiv.org/pdf/1508.04095","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2268511771.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1588709600","https://openalex.org/W1680189815","https://openalex.org/W1973315504","https://openalex.org/W1978553093","https://openalex.org/W1995875735","https://openalex.org/W2001251979","https://openalex.org/W2024830741","https://openalex.org/W2053861514","https://openalex.org/W2058625806","https://openalex.org/W2072291569","https://openalex.org/W2077801543","https://openalex.org/W2104340231","https://openalex.org/W2106864314","https://openalex.org/W2123090656","https://openalex.org/W2143996311","https://openalex.org/W2167830490","https://openalex.org/W2236569555","https://openalex.org/W2266878870","https://openalex.org/W2276299490","https://openalex.org/W2950067144","https://openalex.org/W2963550666","https://openalex.org/W4211058570","https://openalex.org/W6682689614","https://openalex.org/W6724212191"],"related_works":[],"abstract_inverted_index":{"A":[0],"central":[1],"question":[2],"in":[3,17,32,46],"information":[4],"theory":[5],"is":[6,97,150,208],"to":[7,133,145,152],"determine":[8],"the":[9,33,47,54,59,67,72,80,92,117,136,141,168,172,181,184,188,218,221,229,233],"maximum":[10,73,81,118,173],"success":[11,74,119,174,189],"probability":[12,75,190],"that":[13,71,103],"can":[14,76,128,186],"be":[15,77,129,146],"achieved":[16],"sending":[18],"a":[19,25,40,84,98,105,108,192],"fixed":[20],"number":[21,142],"of":[22,36,49,53,66,83,116,138,143,170,194,232,235],"messages":[23,144],"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,206],"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,211],"use":[65],"We":[69,224],"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,160],"-":[110,161,198],"e":[111,162,199],"<sup":[112,124,163,200],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[113,125,164,201],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-1</sup>":[114,126,165,202],")-approximation":[115],"probability.":[120,175],"The":[121],"factor":[122,193,207],"(1-e":[123],")":[127,166],"improved":[130],"arbitrarily":[131],"close":[132],"1":[134],"at":[135,195],"cost":[137],"slightly":[139],"reducing":[140],"sent.":[147],"Moreover,":[148],"it":[149],"NP-hard":[151],"obtain":[153],"an":[154,213],"approximation":[155],"ratio":[156],"strictly":[157],"better":[158],"than":[159],"for":[167],"problem":[169],"computing":[171],"2)":[176],"Shared":[177],"quantum":[178],"entanglement":[179],"between":[180,217],"sender":[182,219],"and":[183,220],"receiver":[185],"increase":[187],"by":[191],"most":[196],"(1/(1":[197],")).":[203],"In":[204],"addition,":[205],"tight":[209,226],"if":[210],"allows":[212],"arbitrary":[214],"non-signaling":[215],"box":[216],"receiver.":[222],"3)":[223],"give":[225],"bounds":[227],"on":[228],"one-shot":[230],"performance":[231],"meta-converse":[234],"Polyanskiy-Poor-Verd\u00fa.":[236]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}