Title: The smallest list for the arbitrarily varying channel
Abstract:The capacity of the discrete memoryless arbitrarily varying channel (AVC) is investigated for deterministic list codes with fixed list size L. For every AVC with positive random code capacity C/sub r/...The capacity of the discrete memoryless arbitrarily varying channel (AVC) is investigated for deterministic list codes with fixed list size L. For every AVC with positive random code capacity C/sub r/, a nonnegative integer M called the symmetrizability is defined. For the average probability of error criterion, it is shown that the list capacity is given by C(L)=C/sub r/ for L>M and C(L)=0 otherwise. Bounds are given which relate C/sub r/ and M. Also, explicit formulas for C(L) are given for a family of noiseless, additive AVCs.Read More
Publication Year: 1997
Publication Date: 1997-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 41
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot