{"id":"https://openalex.org/W1978948309","doi":"https://doi.org/10.1109/isit.2012.6284300","title":"Improved upper bounds on the capacity of binary channels with causal adversaries","display_name":"Improved upper bounds on the capacity of binary channels with causal adversaries","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W1978948309","doi":"https://doi.org/10.1109/isit.2012.6284300","mag":"1978948309"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","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/A5064926409","display_name":"Bikash Kumar Dey","orcid":"https://orcid.org/0000-0003-0333-2257"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Bikash Kumar Dey","raw_affiliation_strings":["IIT Bombay, India"],"affiliations":[{"raw_affiliation_string":"IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108615688","display_name":"Sidharth Jaggi","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Sidharth Jaggi","raw_affiliation_strings":["CUHK, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"CUHK, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]},{"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/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Langberg","raw_affiliation_strings":["Open University, Israel"],"affiliations":[{"raw_affiliation_string":"Open University, Israel","institution_ids":["https://openalex.org/I164950643"]}]},{"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/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anand D. Sarwate","raw_affiliation_strings":["TTI-Chicago, USA"],"affiliations":[{"raw_affiliation_string":"TTI-Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5064926409"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":1.4979,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.83238726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"681","last_page":"685"},"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/T10796","display_name":"Cooperative Communication and Network Coding","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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6695336103439331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5596057176589966},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5500321984291077},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33918288350105286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2970083951950073},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12945717573165894}],"concepts":[{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6695336103439331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5596057176589966},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5500321984291077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33918288350105286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2970083951950073},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12945717573165894},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/isit.2012.6284300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.673.5013","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.673.5013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.rutgers.edu/%7Easarwate/pdfs/DeyJLS13upper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.704.5879","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.704.5879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://personal.ie.cuhk.edu.hk/%7Esjaggi/files/journal_final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.722.5736","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.5736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://personal.ie.cuhk.edu.hk/%7Esjaggi/files/StochOnly5page02.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/50213ed3-f91f-4dc0-a509-22f6351837c1","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/50213ed3-f91f-4dc0-a509-22f6351837c1","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dey, B K, Jaggi, S, Langberg, M & Sarwate, A D 2012, Improved upper bounds on the capacity of binary channels with causal adversaries. in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. Institute of Electrical and Electronics Engineers (IEEE), pp. 681-685.","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/50213ed3-f91f-4dc0-a509-22f6351837c1","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/50213ed3-f91f-4dc0-a509-22f6351837c1","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dey, B K, Jaggi, S, Langberg, M & Sarwate, A D 2012, Improved upper bounds on the capacity of binary channels with causal adversaries. in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. Institute of Electrical and Electronics Engineers (IEEE), pp. 681-685.","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W58239232","https://openalex.org/W1902733887","https://openalex.org/W1989102762","https://openalex.org/W1994481523","https://openalex.org/W1995875735","https://openalex.org/W2014944833","https://openalex.org/W2015204845","https://openalex.org/W2065999483","https://openalex.org/W2109084006","https://openalex.org/W2123681043","https://openalex.org/W2137267299","https://openalex.org/W2139194398","https://openalex.org/W2147549456","https://openalex.org/W2155979661","https://openalex.org/W2162569911","https://openalex.org/W2963294993","https://openalex.org/W2993383518","https://openalex.org/W6602325378","https://openalex.org/W6667031780"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"In":[0,17,165],"this":[1,166],"work":[2],"we":[3,168],"consider":[4],"the":[5,10,18,59,80,83,100,127,174],"communication":[6,52],"of":[7,12,77,82,140],"information":[8],"in":[9,88,124,152],"presence":[11],"a":[13,22,27,30,34,51,68,75,89],"causal":[14,90,145],"adversarial":[15,55,129,146],"jammer.":[16],"setting":[19],"under":[20],"study,":[21],"sender":[23],"wishes":[24],"to":[25,29,74,105,126],"communicate":[26],"message":[28],"receiver":[31],"by":[32],"transmitting":[33],"codeword":[35],"x":[36,44,62,96,114],"=":[37],"(x":[38],"<sub":[39,45,63,97,115],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[40,46,64,98,116],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[41],",":[42],"...,":[43],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[47],")":[48],"bit-by-bit":[49],"over":[50],"channel.":[53],"The":[54],"jammer":[56,84,130],"can":[57,71],"view":[58],"transmitted":[60],"bits":[61],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[65,99],"one":[66],"at":[67],"time,":[69],"and":[70,157,181],"change":[72],"up":[73],"p-fraction":[76],"them.":[78],"However,":[79],"decisions":[81,135],"must":[85,110],"be":[86],"made":[87],"manner.":[91],"Namely,":[92],"for":[93,118,178],"each":[94],"bit":[95],"jammer's":[101],"decision":[102],"on":[103,113,136,160,173],"whether":[104],"corrupt":[106],"it":[107],"or":[108],"not":[109],"depend":[111],"only":[112],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">j</sub>":[117],"j":[119],"\u2264":[120],"i.":[121],"This":[122],"is":[123,163],"contrast":[125],"\u201cclassical\u201d":[128],"which":[131,153,176],"may":[132],"base":[133],"its":[134,137],"complete":[138],"knowledge":[139],"x.":[141],"Binary":[142],"channels":[143],"with":[144],"jammers":[147],"have":[148],"seen":[149],"recent":[150],"studies":[151],"both":[154,179],"lower":[155],"bounds":[156,159,172],"upper":[158,171],"their":[161],"capacity":[162,175],"derived.":[164],"work,":[167],"present":[169],"improved":[170],"hold":[177],"deterministic":[180],"stochastic":[182],"encoding":[183],"schemes.":[184]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}