Show simple item record

Robust Coding For Multiple-Access Channels.

dc.contributor.authorGeraniotis, Evaggelos A.en_US
dc.date.accessioned2007-05-23T09:34:51Z
dc.date.available2007-05-23T09:34:51Z
dc.date.issued1986en_US
dc.identifier.urihttp://hdl.handle.net/1903/4433
dc.description.abstractThe problem of minimax robust coding of classes for 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 are considered. A robust maximum-likelihood decoding rule is derived which guarantees that, for all two-user channels in this 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 blocked length or constraint regions of the class are then evaluated.en_US
dc.format.extent1130192 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1986-7en_US
dc.titleRobust Coding For Multiple-Access Channels.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record