State constraints and list decoding for the AVC

Details State constraints and list decoding for the AVC State constraints and list decoding for the AVC

2007-01-24

arxiv.org/abs/cs/0701146v3

Computer Science

Information Theory

22 pages, significantly changed version submitted to IEEE Transactions on Information Theory

Scientific paper

List decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within $\epsilon$ of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error with list decoding using lists of size $O(1/\epsilon)$. Under average error an achievable rate region and converse bound are given for lists of size $L$. These bounds are based on two different notions of symmetrizability and do not coincide in general. An example is given that shows that for list size $L$ the capacity may be positive but strictly smaller than the randomized coding capacity. This behavior is different than the situation without state constraints.

Affiliated with

Also associated with

No associations

Rating

State constraints and list decoding for the AVC 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 State constraints and list decoding for the AVC, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State constraints and list decoding for the AVC will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603290