{"paper":{"title":"Sufficiently Myopic Adversaries are Blind","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Michael Langberg, Sidharth Jaggi","submitted_at":"2016-10-05T07:08:14Z","abstract_excerpt":"In this work we consider a communication problem in which a sender, Alice, wishes to communicate with a receiver, Bob, over a channel controlled by an adversarial jammer, James, who is {\\em myopic}. Roughly speaking, for blocklength $n$, the codeword $X^n$ transmitted by Alice is corrupted by James who must base his adversarial decisions (of which locations of $X^n$ to corrupt and how to corrupt them) not on the codeword $X^n$ but on $Z^n$, an image of $X^n$ through a noisy memoryless channel. More specifically, our communication model may be described by two channels. A memoryless channel $p("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01287","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}