{"paper":{"title":"On the Capacity of the Slotted Strongly Asynchronous Channel with a Bursty User","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","submitted_at":"2017-01-30T19:06:37Z","abstract_excerpt":"In this paper, the trade-off between the number of transmissions (or burstiness) $K_n=e^{n\\nu}$ of a user, the asynchronism level $A_n=e^{n\\alpha}$ in a slotted strongly asynchronous channel, and the ability to distinguish $M_n=e^{nR}$ messages per transmission with vanishingly error probability is investigated in the asymptotic regime as blocklength $n$ goes to infinity. The receiver must locate and decode, with vanishing error probability in $n$, all of the transmitted messages. Achievability and converse bounds on the trade-off among $(R,\\alpha,\\nu)$ is derived. For cases where $\\nu=0$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08783","kind":"arxiv","version":4},"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"}