On the capacity of the arbitrarily varying channel for maximum probability of error

DOI10.1007/BF00533715zbMath0479.94014MaRDI QIDQ3937283

János Körner, Imre Csiszár

Publication date: 1981

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)

zbMATH Keywords

discrete memoryless channel

Mathematics Subject Classification ID

Error probability in coding theory (94B70) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items

Capacities: From information theory to extremal set theory, Forbiddance and capacity, On types of growth for graph-different permutations, Probabilistic refinement of the asymptotic spectrum of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Channels with arbitrarily varying channel probability functions
• Universally attainable error exponents for broadcast channels with degraded message sets
• Graph decomposition: A new key to coding theorems
• Elimination of correlation in random codes for arbitrarily varying channels
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• On the Shannon capacity of a graph
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
• 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 Capacity