On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding - Computer Science > Information TheoryReportar como inadecuado




On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We study the capacity region $C L$ of an arbitrarily varying multiple-accesschannel AVMAC for deterministic codes with decoding into a list of a fixedsize $L$ and for the average error probability criterion. Motivated by knownresults in the study of fixed size list decoding for a point-to-pointarbitrarily varying channel, we define for every AVMAC whose capacity regionfor random codes has a nonempty interior, a nonnegative integer $\Omega$ calledits symmetrizability. It is shown that for every $L \leq \Omega$, $C L$ has anempty interior, and for every $L \geq \Omega+1^2$, $C L$ equals thenondegenerate capacity region of the AVMAC for random codes with a knownsingle-letter characterization. For a binary AVMAC with a nondegenerate randomcode capacity region, it is shown that the symmetrizability is always finite.



Autor: Sirin Nitinawarat

Fuente: https://arxiv.org/







Documentos relacionados