Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 58, Issue 3, Pages 1372-1384Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2011.2178153
Keywords
Arbitrarily varying channels (AVCs); list-decoding
Funding
- National Science Foundation [CCF-0347298]
- California Institute for Telecommunications and Information Technology (CALIT2) at UC San Diego
Ask authors/readers for more resources
List-decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within 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 the average error criterion, an achievable rate 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 which shows that for list size L, the capacity may be positive but strictly smaller than the randomized coding capacity, in contrast to the situation without constraints.
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