An elementary proof of the strong converse theorem for the multiple-access channel
Ahlswede, RudolfIn: J. Combinatorics, Information and System Sciences, Jg. 7 H. 3, S. 216-2301982Arbitrarily varying channels with states sequence known to the sender
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 32 H. 5, S. 621-6291986Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle
Ahlswede, RudolfIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 10 H. 1, S. 1-421968The capacity region of a channel with two senders and two receivers
Ahlswede, RudolfIn: The annals of probability, Jg. 2 H. 5, S. 805-8141974Channel capacities for list codes
Ahlswede, RudolfIn: Journal of applied probability, Jg. 10, S. 824-8361973Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
Ahlswede, RudolfIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 25 H. 3, S. 239-2521973Coloring hypergraphs: A new approach to multi-user source coding, 1
Ahlswede, RudolfIn: Journal of combinatorics, information & system sciences, Jg. 4 H. 1, S. 76-1151979Coloring hypergraphs: A new approach to multi-user source coding, 2
Ahlswede, RudolfIn: Journal of combinatorics, information & system sciences, Jg. 5 H. 3, S. 220-2681980Elimination of correlation in random codes for arbitrarily varying channels
Ahlswede, RudolfIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 44 H. 2, S. 159-1751978Extremal properties of rate distortion functions
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 36 H. 1, S. 166-1711990Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels
Ahlswede, RudolfIn: The Annals of Mathematical Statistics, Jg. 42 H. 1, S. 224-2401971Improvements of Winograd's result on computation in the presence of noise
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 30 H. 6, S. 872-8771984Jacob Wolfowitz (1910-1981)
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 28 H. 5, S. 687-6901982The maximal error capacity of arbitrarily varying channels for constant list sizes
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 39 H. 4, S. 1416-14171993A method of coding and its application to arbitrarily varying channels
Ahlswede, RudolfIn: Journal of combinatorics, information and system sciences, Jg. 5 H. 1, S. 10-351980A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error [...]
Ahlswede, RudolfIn: The annals of mathematical statistics, Jg. 41 H. 3, S. 1027-10331970On multiple descriptions and team guessing
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 32 H. 4, S. 543-5491986The rate-distortion region for multiple descriptions without excess rate
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 31 H. 6, S. 721-7261985Remarks on Shannon's secrecy systems
Ahlswede, RudolfIn: Problems of Control and Information Theory, Jg. 11 H. 4, S. 301-3181982Simple hypergraphs with maximal number of adjacent pairs of edges
Ahlswede, RudolfIn: Journal of Combinatorial Theory, Series B, Jg. 28 H. 2, S. 164-1671980