Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels
L\'or\'ant Farkas, Tam\'as K\'oi
TL;DR
This paper introduces a universal coding scheme for random access in multiple access channels, providing new error exponents for joint source-channel coding and improvements with error-free communication between senders.
Contribution
It presents a novel universal coding/decoding scheme for random access with collision detection and derives improved error exponents for multiple access channels.
Findings
Universal coding scheme for two senders with collision detection
Achievable joint source-channel coding error exponent for independent sources
Enhanced error exponent with error-free 0 rate communication between senders
Abstract
A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the case of independent sources. This exponent is improved in a modified model that admits error free 0 rate communication between the senders.
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
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Energy Harvesting in Wireless Networks