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

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

2010-06-12

arxiv.org/abs/1006.2498v1

Computer Science

Information Theory

To appear in Proceedings of The IEEE International Symposium on Information Theory, June 2010

Scientific paper

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 is nonempty, a nonnegative integer $U$ called its symmetrizability. It is shown that for every $L \leq U$, $C_L$ has an empty interior, and for every $L \geq (U+1)^2$, $C_L$ equals the capacity region of the AVMAC for random codes with a known single-letter characterization.

Affiliated with

Also associated with

No associations

Rating

On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-625339