Robust Coding for Multiple-Access Channels
Abstract
The problem of ininimax robust coding for classes of multiple-access channels with uncertainty in their statistical description is addressed. We consider: (i) discrete memoryless multiple-access channels with uncertainty in the probability transition matrices and (ii) discrete-time stationary additive Gaussian multiple-access channels with spectral uncertainty. The uncertainty is modeled using classes determined by 2- alternating Choquet capacities. Both block codes and tree codes are considered. A robust maximum-likelihood decoding rule is derived which guarantees that for all two-user channels in the uncertainty class and all pairs of code rates in a critical rate region the average probability of decoding error for the ensemble of pairs of random block codes and the ensemble of pairs of random tree codes converges to zero exponentially with increasing block length or constraint length, respectively. The channel capacity and cut-off rate regions of the class are then evaluated.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1986
- Accession Number
- ADA452433
Entities
People
- Evaggelos A. Geraniotis
Organizations
- University of Maryland