Random Gilbert-Varshamov Codes for Joint Source-Channel Coding
Information Theory
2026-01-22 v1 math.IT
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.
Cite
@article{arxiv.2601.14987,
title = {Random Gilbert-Varshamov Codes for Joint Source-Channel Coding},
author = {AmirPouya Moeini and Albert Guillén i Fàbregas},
journal= {arXiv preprint arXiv:2601.14987},
year = {2026}
}
Comments
This paper has been submitted to ISIT 2026 for review