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.

翻译：本文提出了一种用于离散无记忆信源与信道联合信源信道编码的随机编码技术。该方法建立在Somekh-Baruch等人提出的随机Gilbert-Varshamov码构造基础上，并将其扩展至联合信源信道场景。我们证明所得编码集合能够同时达到随机编码指数与删减错误指数的最大值。