Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 59, Issue 5, Pages 2683-2693Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2013.2242514
Keywords
Arbitrarily varying channel (AVC); capacity region; deterministic code; list decoding; multiple-access channel; random code; symmetrizability
Funding
- National Science Foundation [CCF0515124, CCF0635271, CCF0830697]
Ask authors/readers for more resources
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 L <= Omega, C-L has an empty interior, and for every L >= (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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available