Simple hypergraphs with maximal number of adjacent pairs of edges
In: Journal of Combinatorial Theory, Series B, Jg. 28 H. 2, S. 164-1671980
Source encoding with side information and a converse for degraded broadcast channels
In: IEEE transactions on information theory, Jg. IT-21 H. 6, S. 629-6371975Spreading of sets in product spaces and hypercontraction of the Markov operator
In: The annals of probability, Jg. 4 H. 6, S. 925-9391976The structure of capacity functions for compound channels
In: Probability and information theory, Jg. vol. 1: Proceedings of the international symposium at McMaster University, Canada, April 1968, S. 12-541969To get a bit of information may be as hard as to get full information
In: IEEE transactions on information theory, Jg. 27 H. 4, S. 398-4081981Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
In: IEEE transactions on information theory, Jg. 37 H. 6, S. 1647-16491991Two-way communication complexity of sum-type functions for one processor to be informed
In: Problems of information transmission, Jg. 30 H. 1, S. 3-101994The weak capacity of averaged channels
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 11 H. 1, S. 61-731968