On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding
From MaRDI portal
Publication:2989243
Abstract: We study the capacity region of an arbitrarily varying multiple-access channel (AVMAC) for deterministic codes with decoding into a list of a fixed size 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 called its symmetrizability. It is shown that for every , has an empty interior, and for every , 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.
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
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- List-Decoding for the Arbitrarily Varying Channel Under State Constraints
- 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)