CUED Publications database

Random coding bounds that attain the joint source-channel exponent

Campo, AT and Vazquez-Vilar, G and Fabregas, AGI and Koch, T and Martinez, A (2012) Random coding bounds that attain the joint source-channel exponent. In: UNSPECIFIED.

Full text not available from this repository.


This paper presents a random-coding upper bound on the average error probability of joint source-channel coding that attains Csiszár's error exponent. The bound is based on a code construction for which source messages are assigned to disjoint subsets (classes), and codewords are generated according to a distribution that depends on the class of the source message. For a single class, the bound recovers Gallager's exponent; identifying the classes with source type classes, it recovers Csiszár's exponent. Moreover, it is shown that as a two appropriately designed classes are sufficient to attain Csiszár's exponent. © 2012 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 19:32
Last Modified: 05 Feb 2019 12:36
DOI: 10.1109/CISS.2012.6310910