{"paper":{"title":"Time-Asynchronous Gaussian Multiple Access Relay Channel with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamidreza Ebrahimzadeh Saffar, Masoud Badiei Khuzani, Patrick Mitran","submitted_at":"2014-08-08T02:26:03Z","abstract_excerpt":"We study the transmission of a set of correlated sources $(U_1,\\cdots,U_K)$ over a Gaussian multiple access relay channel with time asynchronism between the encoders. We assume that the maximum possible offset ${\\mathsf{d_{max}}}(n)$ between the transmitters grows without bound as the block length $n \\rightarrow \\infty$ while the relative ratio ${{\\mathsf{d_{max}}}(n) / n}$ of the maximum possible offset to the block length asymptotically vanishes. For such a joint source-channel coding problem, and under specific gain conditions, we derive necessary and sufficient conditions for reliable comm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.1750","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"}