On the capacity of the arbitrarily varying channel for maximum probability of error
- 1 January 1981
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 57 (1), 87-101
- https://doi.org/10.1007/bf00533715
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Graph decomposition: A new key to coding theoremsIEEE Transactions on Information Theory, 1981
- Universally attainable error exponents for broadcast channels with degraded message setsIEEE Transactions on Information Theory, 1980
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)IEEE Transactions on Information Theory, 1979
- Elimination of correlation in random codes for arbitrarily varying channelsProbability Theory and Related Fields, 1978
- Coding Theorems of Information TheoryPublished by Springer Nature ,1978
- 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
- Channels with arbitrarily varying channel probability functionsInformation and Control, 1962
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956