{"id":"https://openalex.org/W4386072110","doi":"https://doi.org/10.1109/isit54713.2023.10206731","title":"Computationally Efficient Codes for Adversarial Binary-Erasure Channels","display_name":"Computationally Efficient Codes for Adversarial Binary-Erasure Channels","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386072110","doi":"https://doi.org/10.1109/isit54713.2023.10206731"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206731","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/files/452931459/polynomial_time_codes_for_myopic_and_causal_BEC_channels_2_.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089055825","display_name":"Sijie Li","orcid":"https://orcid.org/0000-0002-0040-8976"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sijie Li","raw_affiliation_strings":["UT Austin"],"affiliations":[{"raw_affiliation_string":"UT Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001685956","display_name":"Prasad Krishnan","orcid":"https://orcid.org/0000-0001-9182-6278"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prasad Krishnan","raw_affiliation_strings":["IIIT Hyderabad"],"affiliations":[{"raw_affiliation_string":"IIIT Hyderabad","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108615688","display_name":"Sidharth Jaggi","orcid":null},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sidharth Jaggi","raw_affiliation_strings":["University of Bristol"],"affiliations":[{"raw_affiliation_string":"University of Bristol","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011741113","display_name":"Michael Langberg","orcid":"https://orcid.org/0000-0002-7470-0718"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Langberg","raw_affiliation_strings":["University at Buffalo"],"affiliations":[{"raw_affiliation_string":"University at Buffalo","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087162046","display_name":"Anand D. Sarwate","orcid":"https://orcid.org/0000-0001-6123-5282"},"institutions":[{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Anand D. Sarwate","raw_affiliation_strings":["Rutgers University"],"affiliations":[{"raw_affiliation_string":"Rutgers University","institution_ids":["https://openalex.org/I4210096112"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5089055825"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.2631,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53570482,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"228","last_page":"233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9994000196456909,"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.9994000196456909,"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/T12029","display_name":"DNA and Biological Computing","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9984999895095825,"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/erasure","display_name":"Erasure","score":0.8339080810546875},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7182488441467285},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6960242986679077},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6759952306747437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6723558306694031},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5808959007263184},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5802403092384338},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5797606110572815},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5702871680259705},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5211932063102722},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4937041699886322},{"id":"https://openalex.org/keywords/adversary-model","display_name":"Adversary model","score":0.48220503330230713},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.48105549812316895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4589653015136719},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.4452711045742035},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.4164107143878937},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3604046106338501},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.29376980662345886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2748017907142639},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2356746792793274},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.22700297832489014},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19137519598007202},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.09911811351776123},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09596514701843262}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.8339080810546875},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7182488441467285},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6960242986679077},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6759952306747437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6723558306694031},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5808959007263184},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5802403092384338},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5797606110572815},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5702871680259705},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5211932063102722},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4937041699886322},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.48220503330230713},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.48105549812316895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4589653015136719},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.4452711045742035},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.4164107143878937},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3604046106338501},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.29376980662345886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2748017907142639},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2356746792793274},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.22700297832489014},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19137519598007202},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.09911811351776123},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09596514701843262},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit54713.2023.10206731","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/c9a05196-9b3e-41b7-b66f-54f04b667427","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/c9a05196-9b3e-41b7-b66f-54f04b667427","pdf_url":"https://research-information.bris.ac.uk/files/452931459/polynomial_time_codes_for_myopic_and_causal_BEC_channels_2_.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, S, Krishnan, P, Jaggi, S, Langberg, M & Sarwate, A D 2023, Computationally Efficient Codes for Adversarial Binary-Erasure Channels. in 2023 IEEE International Symposium on Information Theory, ISIT 2023. IEEE International Symposium on Information Theory - Proceedings, vol. 2023-June, Institute of Electrical and Electronics Engineers (IEEE), pp. 228-233. https://doi.org/10.1109/ISIT54713.2023.10206731","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/c9a05196-9b3e-41b7-b66f-54f04b667427","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/c9a05196-9b3e-41b7-b66f-54f04b667427","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, S, Krishnan, P, Jaggi, S, Langberg, M & Sarwate, A D 2023, Computationally Efficient Codes for Adversarial Binary-Erasure Channels. in 2023 IEEE International Symposium on Information Theory, ISIT 2023. IEEE International Symposium on Information Theory - Proceedings, vol. 2023-June, Institute of Electrical and Electronics Engineers (IEEE), pp. 228-233. https://doi.org/10.1109/ISIT54713.2023.10206731","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/c9a05196-9b3e-41b7-b66f-54f04b667427","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/c9a05196-9b3e-41b7-b66f-54f04b667427","pdf_url":"https://research-information.bris.ac.uk/files/452931459/polynomial_time_codes_for_myopic_and_causal_BEC_channels_2_.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, S, Krishnan, P, Jaggi, S, Langberg, M & Sarwate, A D 2023, Computationally Efficient Codes for Adversarial Binary-Erasure Channels. in 2023 IEEE International Symposium on Information Theory, ISIT 2023. IEEE International Symposium on Information Theory - Proceedings, vol. 2023-June, Institute of Electrical and Electronics Engineers (IEEE), pp. 228-233. https://doi.org/10.1109/ISIT54713.2023.10206731","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386072110.pdf","grobid_xml":"https://content.openalex.org/works/W4386072110.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W925244956","https://openalex.org/W1948599384","https://openalex.org/W1978948309","https://openalex.org/W1989102762","https://openalex.org/W1990514974","https://openalex.org/W1994481523","https://openalex.org/W2013841965","https://openalex.org/W2015204845","https://openalex.org/W2021253860","https://openalex.org/W2137267299","https://openalex.org/W2147549456","https://openalex.org/W2155979661","https://openalex.org/W2517554431","https://openalex.org/W2946556807","https://openalex.org/W2951262303","https://openalex.org/W2962864210","https://openalex.org/W2963051325","https://openalex.org/W2963279554","https://openalex.org/W2963294993","https://openalex.org/W2963628132","https://openalex.org/W2963629492","https://openalex.org/W2963790453","https://openalex.org/W2965893095","https://openalex.org/W2975286556","https://openalex.org/W3122736160","https://openalex.org/W3166668984","https://openalex.org/W4226208834","https://openalex.org/W4280600604","https://openalex.org/W4289655301","https://openalex.org/W6667558405","https://openalex.org/W6848770324"],"related_works":["https://openalex.org/W2744779861","https://openalex.org/W2149057203","https://openalex.org/W1971149437","https://openalex.org/W2049418428","https://openalex.org/W2964092494","https://openalex.org/W2053950481","https://openalex.org/W4294811123","https://openalex.org/W1521979079","https://openalex.org/W4366717779","https://openalex.org/W2105667212"],"abstract_inverted_index":{"We":[0,50],"study":[1],"communication":[2],"models":[3],"for":[4,32,117,141],"channels":[5,33],"with":[6,19,34,37,91],"erasures":[7],"in":[8],"which":[9],"the":[10,23,47,83,110,118,125,129,137],"erasure":[11,78,89],"pattern":[12,79],"can":[13,41,75],"be":[14],"controlled":[15],"by":[16],"an":[17,38,59,77],"adversary":[18,39],"partial":[20],"knowledge":[21,63],"of":[22,46,64,144,150],"transmitted":[24,48,69,84],"codeword.":[25],"In":[26],"particular,":[27],"we":[28,97],"design":[29,98],"block":[30],"codes":[31],"binary":[35,88],"inputs":[36],"who":[40,54,74],"erase":[42,58],"a":[43,87,142],"fraction":[44],"p":[45],"bits.":[49],"consider":[51],"causal":[52,119],"adversaries,":[53,73],"must":[55],"choose":[56,76],"to":[57],"input":[60],"bit":[61,66],"using":[62],"that":[65,106,151],"and":[67,71,103,120],"previously":[68],"bits,":[70],"myopic":[72],"based":[80],"on":[81],"observing":[82],"codeword":[85],"through":[86],"channel":[90],"random":[92],"erasures.":[93],"For":[94,124,146],"both":[95],"settings":[96],"efficient":[99],"(polynomial":[100],"time)":[101],"encoding":[102],"decoding":[104],"algorithms":[105],"use":[107],"randomization":[108],"at":[109],"encoder":[111],"only.":[112],"Our":[113],"constructions":[114],"achieve":[115],"capacity":[116,130,138],"\"sufficiently":[121],"myopic\"":[122,127],"models.":[123],"\"insufficiently":[126],"adversary,":[128],"is":[131,139],"unknown,":[132],"but":[133],"existing":[134],"converses":[135],"show":[136],"zero":[140],"range":[143],"parameters.":[145],"all":[147],"parameters":[148],"outside":[149],"range,":[152],"our":[153],"construction":[154],"achieves":[155],"positive":[156],"rates.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}