- vom 14.7.2021
Two-way communication complexity of sum-type functions for one processor to be informed
In: Problems of information transmission, Jg. 30 H. 1, S. 3-101994
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
In: IEEE transactions on information theory, Jg. 37 H. 6, S. 1647-16491991To 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-4081981The weak capacity of averaged channels
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 11 H. 1, S. 61-731968The 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-541969The rate-distortion region for multiple descriptions without excess rate
In: IEEE transactions on information theory, Jg. 31 H. 6, S. 721-7261985The number of values of combinatorial functions
In: Bulletin of the London Mathematical Society, Jg. 11 H. 1, S. 49-511979The maximal error capacity of arbitrarily varying channels for constant list sizes
In: IEEE transactions on information theory, Jg. 39 H. 4, S. 1416-14171993The capacity region of a channel with two senders and two receivers
In: The annals of probability, Jg. 2 H. 5, S. 805-8141974The capacity of a channel with arbitrarily varying channel probability functions and binary output
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 15 H. 3, S. 186-1941970The asymptotic behavior of diameters in the average
In: Journal of Combinatorial Theory, Series B, Jg. 61 H. 2, S. 167-1771994Spreading of sets in product spaces and hypercontraction of the Markov operator
In: The annals of probability, Jg. 4 H. 6, S. 925-9391976Source encoding with side information and a converse for degraded broadcast channels
In: IEEE transactions on information theory, Jg. IT-21 H. 6, S. 629-6371975Simple hypergraphs with maximal number of adjacent pairs of edges
In: Journal of Combinatorial Theory, Series B, Jg. 28 H. 2, S. 164-1671980Rich colorings with local constraints
In: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-2161992Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory
In: IEEE transactions on information theory, Jg. 37 H. 4, S. 1143-11501991Remarks on Shannon's secrecy systems
In: Problems of Control and Information Theory, Jg. 11 H. 4, S. 301-3181982Rank formulas for certain products of matrices
In: Applicable Algebra in Engineering, Communication and Computing, Jg. 4 H. 4, S. 253-2611993Partitioning the n-cube into sets with mutual distance 1
In: Applied Mathematics Letters, Jg. 6 H. 4, S. 17-191993Optimal coding strategies for certain permuting channels
In: IEEE transactions on information theory, Jg. 33 H. 3, S. 310-3141987On the optimal structure of recovering set pairs in lattices: the sandglass conjecture
In: Discrete Mathematics, Jg. 128 H. 1-3, S. 389-3941994On source coding with side information via a multiple-access channel and related problems in multi-user information theory
In: IEEE transactions on information theory, Jg. 29 H. 3, S. 396-4121983On partitioning and packing products with rectangles
In: Combinatorics, Probability & Computing, Jg. 3 H. 04, S. 429-4341994On multiuser write-efficient memories
In: IEEE transactions on information theory, Jg. 40 H. 3, S. 674-6861994On multiple descriptions and team guessing
In: IEEE transactions on information theory, Jg. 32 H. 4, S. 543-5491986On minimax estimation in the presence of side information about remote data
In: The annals of statistics, Jg. 18 H. 1, S. 141-1711990On identification via multiway channels with feedback
In: IEEE transactions on information theory, Jg. 37 H. 5, S. 1519-15261991On extremal set partitions in Cartesian product spaces
In: Combinatorics, Probability & Computing, Jg. 2 H. 2, S. 211-2201993On communication complexity of vector-valued functions
In: IEEE transactions on information theory, Jg. 40 H. 6, S. 2062-20671994Note on an extremal problem arising for unreliable networks in parallel computing
In: Discrete Mathematics, Jg. 47, S. 137-1521983Nonbinary codes correcting localized errors
In: IEEE transactions on information theory, Jg. 39 H. 4, S. 1413-14161993Messy broadcasting in networks
In: Communications and cryptography: two sides of one tapestry, Jg. 276, S. 13-241994Integral inequalities for increasing functions
In: Mathematical Proceedings of the Cambridge Philosophical Society, Jg. 86 H. 03, S. 391-3941979Inequalities for a pair of maps S x S -> S with S a finite set
In: Mathematische Zeitschrift, Jg. 165 H. 3, S. 267-2891979Improvements of Winograd's result on computation in the presence of noise
In: IEEE transactions on information theory, Jg. 30 H. 6, S. 872-8771984Identification in the presence of feedback: a discovery of new capacity formulas
In: IEEE transactions on information theory, Jg. 35 H. 1, S. 30-361989