Distributed Joint Source-Channel Coding for Functions over a Multiple Access Channel
R Rajesh, Vinod Sharma
TL;DR
This paper establishes sufficient conditions and efficient coding schemes for transmitting functions of correlated data over a multiple access channel, extending Yamamoto's results to both discrete and continuous sources.
Contribution
It generalizes Yamamoto's conditions and proposes practical joint source-channel coding schemes for correlated sources over MACs.
Findings
Derived generalized sufficient conditions for lossy function transmission over MAC.
Developed efficient coding schemes for discrete and continuous sources.
Extended theoretical results to practical coding implementations.
Abstract
In this paper we provide sufficient conditions for lossy transmission of functions of correlated data over a multiple access channel (MAC). The conditions obtained can be shown as generalized version of Yamamoto's result. We also obtain efficient joint source-channel coding schemes for transmission of discrete and continuous alphabet sources to recover the function values. Keywords: Joint source-channel coding, Graph coloring, Lipschitz functions, Correlated sources.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Wireless Communication Security Techniques · DNA and Biological Computing