{"id":"https://openalex.org/W2886889416","doi":"https://doi.org/10.1109/isit.2018.8437681","title":"Bit-wise Sequential Coding with Feedback","display_name":"Bit-wise Sequential Coding with Feedback","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886889416","doi":"https://doi.org/10.1109/isit.2018.8437681","mag":"2886889416"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5040867232","display_name":"Sung-En Chiu","orcid":"https://orcid.org/0000-0002-4220-2327"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sung-En Chiu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020991662","display_name":"Anusha Lalitha","orcid":"https://orcid.org/0000-0003-4179-7151"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anusha Lalitha","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059310658","display_name":"Tara Javidi","orcid":"https://orcid.org/0000-0001-7112-1043"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tara Javidi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":1.5586,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.80596789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"321","last_page":"325"},"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.9990000128746033,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.8248533010482788},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6861604452133179},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.6694319248199463},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6383823156356812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5994319915771484},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5562263131141663},{"id":"https://openalex.org/keywords/repetition-code","display_name":"Repetition code","score":0.5349997282028198},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5318040251731873},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.5312373638153076},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4918837547302246},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4904138743877411},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.44856828451156616},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44475552439689636},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.43347132205963135},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4140126705169678},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.33359819650650024},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.29064396023750305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2639913260936737},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.24596372246742249},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.19721999764442444},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.16021162271499634}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.8248533010482788},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6861604452133179},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.6694319248199463},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6383823156356812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5994319915771484},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5562263131141663},{"id":"https://openalex.org/C194405637","wikidata":"https://www.wikidata.org/wiki/Q369367","display_name":"Repetition code","level":5,"score":0.5349997282028198},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5318040251731873},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.5312373638153076},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4918837547302246},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4904138743877411},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.44856828451156616},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44475552439689636},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.43347132205963135},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4140126705169678},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.33359819650650024},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29064396023750305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2639913260936737},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.24596372246742249},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19721999764442444},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.16021162271499634},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437681","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1992720861","https://openalex.org/W2068028939","https://openalex.org/W2078531178","https://openalex.org/W2123980163","https://openalex.org/W2146950091","https://openalex.org/W2163356902","https://openalex.org/W2540076116","https://openalex.org/W2964122424","https://openalex.org/W3103934323","https://openalex.org/W6728960281"],"related_works":["https://openalex.org/W2538179194","https://openalex.org/W570222554","https://openalex.org/W1646184777","https://openalex.org/W1986741231","https://openalex.org/W2950014831","https://openalex.org/W4300811249","https://openalex.org/W2161290246","https://openalex.org/W1997045285","https://openalex.org/W3102602607","https://openalex.org/W2113825080"],"abstract_inverted_index":{"This":[0,74,142,159],"paper":[1,143],"considers":[2],"the":[3,26,37,48,80,196],"problem":[4],"of":[5,28,172],"bit-wise":[6,61,76,100,153],"channel":[7,122],"coding":[8,38,140,148],"over":[9,91],"a":[10,29,58,111,119,138,145,151,169,177,192],"Binary":[11,49],"Symmetric":[12],"Channel":[13,51],"(BSC)":[14],"with":[15,102,123,150,179],"feedback.":[16],"While":[17],"it":[18,32,71,84],"is":[19,33,47,55,68,72,96,132,161],"known":[20,98,126],"that":[21,83,104,155],"feedback":[22,77,103,147],"does":[23],"not":[24],"increase":[25],"capacity":[27,54],"memoryless":[30],"channel,":[31],"believed":[34],"to":[35,163],"simplify":[36],"schemes":[39],"for":[40,88,110,118,168],"some":[41],"channels.":[42],"The":[43,187],"most":[44],"significant":[45],"one":[46],"Erasure":[50],"(BEC)":[52],"where":[53],"achieved":[56],"by":[57],"simple":[59],"sequential":[60,75,99,146],"repetition":[62,157],"code":[63,78,101],"under":[64,115],"which":[65],"each":[66,130],"bit":[67],"(re-)transmitted":[69],"until":[70],"received.":[73],"has":[79],"added":[81],"advantage":[82],"can":[85,105],"be":[86],"used":[87],"streaming":[89],"applications":[90],"BECs.":[92],"In":[93],"contrast,":[94],"there":[95],"no":[97],"achieve":[106,164],"nonzero":[107],"transmission":[108],"rate":[109,167],"BSC.":[112],"For":[113],"example,":[114],"Posterior":[116],"Matching":[117],"binary":[120,173],"input":[121,174],"feedback,":[124],"also":[125],"as":[127],"Horstein":[128],"scheme,":[129],"message":[131],"considered":[133],"in":[134,137],"its":[135],"entirety":[136],"block":[139],"manner.":[141],"proposes":[144],"scheme":[149,160],"nested":[152],"structure":[154],"generalizes":[156],"codes.":[158],"shown":[162],"strictly":[165],"positive":[166],"large":[170],"class":[171],"channels":[175],"including":[176],"BSC":[178],"arbitrary":[180],"cross-over":[181],"probability":[182],"p":[183],"\u2208":[184],"(0,":[185],"1/2).":[186],"analysis":[188],"relies":[189],"on":[190,195],"characterizing":[191],"lower":[193],"bound":[194],"step-wise":[197],"Extrinsic":[198],"Jensen":[199],"Shannon":[200],"divergence.":[201]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}