The 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-1751978Group 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-2401971A 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-351980Simple hypergraphs with maximal number of adjacent pairs of edges
Ahlswede, RudolfIn: Journal of Combinatorial Theory, Series B, Jg. 28 H. 2, S. 164-1671980Approximation o continuous functions in p-Adic Analysis
Ahlswede, Rudolf ; Bojanic, R.In: Journal of Approximation Theory, Jg. 15 H. 3, S. 190-2051975An inequality for the weights of two families of sets, their unions and intersections
Ahlswede, Rudolf ; Daykin, David E.In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 43 H. 3, S. 183-1851978Inequalities for a pair of maps S x S -> S with S a finite set
Ahlswede, Rudolf ; Daykin, David E.In: Mathematische Zeitschrift, Jg. 165 H. 3, S. 267-2891979Integral inequalities for increasing functions
Ahlswede, Rudolf ; Daykin, David E.In: Mathematical Proceedings of the Cambridge Philosophical Society, Jg. 86 H. 03, S. 391-3941979The number of values of combinatorial functions
Ahlswede, Rudolf ; Daykin, David E.In: Bulletin of the London Mathematical Society, Jg. 11 H. 1, S. 49-511979Every bad code has a good subcode: a local converse to the coding theorem
Ahlswede, Rudolf ; Dueck, GunterIn: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 34 H. 2, S. 179-1821976Bounds on algebraic code capacities for noisy channels. I
Ahlswede, Rudolf ; Gemma, J.In: Information and Control, Jg. 18 H. 2, S. 124-1451971Bounds on algebraic code capacities for noisy channels. II
Ahlswede, Rudolf ; Gemma, J.In: Information and Control, Jg. 19 H. 2, S. 146-1581971Spreading of sets in product spaces and hypercontraction of the Markov operator
Ahlswede, Rudolf ; Gács, PeterIn: The annals of probability, Jg. 4 H. 6, S. 925-9391976Two contributions to information theory
Ahlswede, Rudolf ; Gács, Peter ; Csiszár, Imre (Hrsg.)In: Topics in information theory, Jg. 16, S. 17-401975Bounds on conditional probabilities with applications in multi-user communication
Ahlswede, Rudolf ; Gács, Peter ; Körner, JánosIn: Zeitschrift fr Wahrscheinlichkeitstheorie und Verwandte Gebiete, Jg. 34 H. 2, S. 157-1771976