Random Gilbert-Varshamov Codes for Joint Source-Channel Coding
AmirPouya Moeini, Albert Guill\'en i F\`abregas
TL;DR
This paper introduces a novel random coding method based on Gilbert-Varshamov codes for joint source-channel coding, achieving optimal error exponents for discrete memoryless sources and channels.
Contribution
It extends the Gilbert-Varshamov code construction to joint source-channel coding, providing a new ensemble that attains maximum error exponents.
Findings
Achieves maximum random-coding error exponent
Attains maximum expurgated error exponent
Extends Gilbert-Varshamov codes to joint source-channel setting
Abstract
We propose a random coding technique for joint source-channel coding of discrete memoryless sources and channels. The approach builds on the random Gilbert-Varshamov code construction of Somekh-Baruch et al. and extends it to the joint source-channel setting. We show that the resulting ensemble attains the maximum of the random-coding and expurgated error exponents.
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 · Error Correcting Code Techniques