{"id":"https://openalex.org/W1975231568","doi":"https://doi.org/10.1109/tit.2015.2428234","title":"An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels","display_name":"An Efficient Feedback Coding Scheme With Low Error Probability for Discrete Memoryless Channels","publication_year":2015,"publication_date":"2015-04-30","ids":{"openalex":"https://openalex.org/W1975231568","doi":"https://doi.org/10.1109/tit.2015.2428234","mag":"1975231568"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2015.2428234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2428234","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/1311.0100","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084702636","display_name":"Cheuk Ting Li","orcid":"https://orcid.org/0000-0002-4803-212X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cheuk Ting Li","raw_affiliation_strings":["Department of Electrical Engineering, Stanford University, Stanford, CA, USA","Department of Electrical Engineering, Stanford University Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078716556","display_name":"Abbas El Gamal","orcid":"https://orcid.org/0000-0002-0853-0415"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abbas El Gamal","raw_affiliation_strings":["Department of Electrical Engineering, Stanford University, Stanford, CA, USA","Department of Electrical Engineering, Stanford University Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4058,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.83538345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"61","issue":"6","first_page":"2953","last_page":"2963"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9997000098228455,"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.9994000196456909,"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/decoding-methods","display_name":"Decoding methods","score":0.7758383750915527},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6698296070098877},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.602523922920227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5536047220230103},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.48030394315719604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47997474670410156},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.445231556892395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43575331568717957},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4346333146095276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4344734847545624},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.3075777292251587},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11969047784805298},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07200601696968079}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7758383750915527},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6698296070098877},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.602523922920227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5536047220230103},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.48030394315719604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47997474670410156},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.445231556892395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43575331568717957},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4346333146095276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4344734847545624},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.3075777292251587},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11969047784805298},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07200601696968079}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2015.2428234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2428234","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:1311.0100","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1311.0100","pdf_url":"https://arxiv.org/pdf/1311.0100","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.706.1230","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.706.1230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://isl.stanford.edu/%7Eabbas/papers/An%20Efficient%20Feedback%20Coding%20Scheme%20with%20Low%20Error%20Probability%20for%20Discrete%20Memoryless%20Channels_IEEE.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1311.0100","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1311.0100","pdf_url":"https://arxiv.org/pdf/1311.0100","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":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2011914761","https://openalex.org/W2040877654","https://openalex.org/W2078531178","https://openalex.org/W2096307573","https://openalex.org/W2106864314","https://openalex.org/W2115844072","https://openalex.org/W2130055503","https://openalex.org/W2146719334","https://openalex.org/W2149685491","https://openalex.org/W2156754961","https://openalex.org/W2157875630","https://openalex.org/W2164684058","https://openalex.org/W2212502649","https://openalex.org/W3103934323","https://openalex.org/W3175179020","https://openalex.org/W6644119327"],"related_works":["https://openalex.org/W2368824897","https://openalex.org/W4312628177","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W2148686647","https://openalex.org/W2123072960","https://openalex.org/W2379365082","https://openalex.org/W2370747590","https://openalex.org/W2030109976","https://openalex.org/W2147544396"],"abstract_inverted_index":{"Existing":[0],"fixed-length":[1,39],"feedback":[2,25,40],"communication":[3],"schemes":[4,85],"are":[5,28,77],"either":[6,19],"specialized":[7],"to":[8,15,30],"particular":[9],"channels":[10,17],"(Schalkwijk-Kailath,":[11],"Horstein),":[12],"or":[13,27],"apply":[14],"general":[16],"but":[18],"have":[20],"high":[21],"coding":[22,41,73],"complexity":[23],"(block":[24],"schemes)":[26],"difficult":[29],"analyze":[31],"(posterior":[32],"matching).":[33],"This":[34],"paper":[35],"introduces":[36],"a":[37],"new":[38,87,94,105],"scheme":[42,106],"which":[43],"achieves":[44],"the":[45,58,63,66,97,100,104],"capacity":[46],"for":[47,103,109],"all":[48],"discrete":[49],"memoryless":[50],"channels,":[51],"has":[52,69],"an":[53],"error":[54,101],"exponent":[55],"that":[56],"approaches":[57,65],"sphere":[59],"packing":[60],"bound":[61],"as":[62],"rate":[64],"capacity,":[67],"and":[68,90],"O(n":[70],"log":[71],"n)":[72],"complexity.":[74],"These":[75,93],"benefits":[76],"achieved":[78],"by":[79],"judiciously":[80],"combining":[81],"features":[82,95],"from":[83],"previous":[84],"with":[86],"randomization":[88],"technique":[89],"encoding/decoding":[91],"rule.":[92],"make":[96],"analysis":[98],"of":[99],"probability":[102],"easier":[107],"than":[108],"posterior":[110],"matching.":[111]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}