Channel capacities for list codes
- 1 December 1973
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 10 (4) , 824-836
- https://doi.org/10.2307/3212384
Abstract
In the present paper we demonstrate that the concept of a list code is from a mathematical point of view a more canonical notion than the classical code concept (list size one) in that it allows a unified treatment of various coding problems. In particular we determine for small list sizes the capacities of arbitrarily varying channels.Keywords
This publication has 9 references indexed in Scilit:
- Channels with arbitrarily varying channel probability functions in the presence of noiseless feedbackProbability Theory and Related Fields, 1973
- A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error CapacityThe Annals of Mathematical Statistics, 1970
- The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabetProbability Theory and Related Fields, 1970
- The strong converse theorem in the decoding scheme of list size $L$Kodai Mathematical Journal, 1969
- Exponential error bounds for erasure, list, and decision feedback schemesIEEE Transactions on Information Theory, 1968
- The weak capacity of averaged channelsProbability Theory and Related Fields, 1968
- Lower bounds to error probability for coding on discrete memoryless channels. IInformation and Control, 1967
- Simultaneous channelsArchive for Rational Mechanics and Analysis, 1959
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956