期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 58, 期 3, 页码 1372-1384出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2011.2178153
关键词
Arbitrarily varying channels (AVCs); list-decoding
资金
- National Science Foundation [CCF-0347298]
- California Institute for Telecommunications and Information Technology (CALIT2) at UC San Diego
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据