The smallest list for the arbitrarily varying channel
Author:
- 1 May 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 43 (3) , 803-815
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/, 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.Keywords
This publication has 9 references indexed in Scilit:
- Estimation of the size of the list when decoding over an arbitrarily varying channelLecture Notes in Computer Science, 1994
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- Two proofs of Pinsker's conjecture concerning arbitrarily varying channelsIEEE Transactions on Information Theory, 1991
- The capacity of the arbitrarily varying channel revisited: positivity, constraintsIEEE Transactions on Information Theory, 1988
- Exponential error bounds for random codes in the arbitrarily varying channelIEEE Transactions on Information Theory, 1985
- Elimination of correlation in random codes for arbitrarily varying channelsProbability Theory and Related Fields, 1978
- Channel capacities for list codesJournal of Applied Probability, 1973
- Convex Analysis1970
- The Capacities of Certain Channel Classes Under Random CodingThe Annals of Mathematical Statistics, 1960