{"paper":{"title":"Multiple-access Network Information-flow and Correction Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elona Erez, Hongyi Yao, Joerg Kliewer, Michelle Effros, Sidharth Jaggi, Svitlana Vyetrenko, Theodoros K. Dikaliotis, Tracey Ho","submitted_at":"2010-12-01T07:08:13Z","abstract_excerpt":"This work considers the multiple-access multicast error-correction scenario over a packetized network with $z$ malicious edge adversaries. The network has min-cut $m$ and packets of length $\\ell$, and each sink demands all information from the set of sources $\\sources$. The capacity region is characterized for both a \"side-channel\" model (where sources and sinks share some random bits that are secret from the adversary) and an \"omniscient\" adversarial model (where no limitations on the adversary's knowledge are assumed). In the \"side-channel\" adversarial model, the use of a secret channel allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0112","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"}