On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding

DOI10.1109/TIT.2013.2242514zbMATH Open1364.94725arXiv1006.2498MaRDI QIDQ2989243FDOQ2989243

Authors: Sirin Nitinawarat 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study the capacity region $C_L$ of an arbitrarily varying multiple-access channel (AVMAC) for deterministic codes with decoding into a list of a fixed size $L$ and for the average error probability criterion. Motivated by known results in the study of fixed size list decoding for a point-to-point arbitrarily varying channel, we define for every AVMAC whose capacity region for random codes has a nonempty interior, a nonnegative integer $Omega$ called its symmetrizability. It is shown that for every $LleqOmega$, $C_L$ has an empty interior, and for every $Lgeq(Omega+1{)}^2$, $C_L$ equals the nondegenerate capacity region of the AVMAC for random codes with a known single-letter characterization. For a binary AVMAC with a nondegenerate random code capacity region, it is shown that the symmetrizability is always finite.

Full work available at URL: https://arxiv.org/abs/1006.2498

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Cited In (6)

• The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
• The smallest list for the arbitrarily varying channel
• List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability
• List-Decoding for the Arbitrarily Varying Channel Under State Constraints
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• Seminoisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback

This page was built for publication: On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989243)