The maximal error capacity of arbitrarily varying channels for constant list sizes
Ahlswede, RudolfIn: IEEE transactions on information theory, Jg. 39 H. 4, S. 1416-14171993The asymptotic behavior of diameters in the average
Ahlswede, Rudolf ; Althöfer, IngoIn: Journal of Combinatorial Theory, Series B, Jg. 61 H. 2, S. 167-1771994Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: Comptes rendus de l' Académie bulgare des Sciences, Jg. 46 H. 1, S. 35-371993Asymptotically optimal binary codes of polynomial complexity correcting localized errors
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: Probl. Peredachi Inf., Jg. 31 H. 2, S. 76-831995Binary constant-weight codes correcting localized errors and defects
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: Problems of information transmission, Jg. 30 H. 2, S. 102-1041994Nonbinary codes correcting localized errors
Ahlswede, Rudolf ; Bassalygo, L. A. ; Pinsker, M. S.In: IEEE transactions on information theory, Jg. 39 H. 4, S. 1413-14161993A generalization of the AZ identity
Ahlswede, Rudolf ; Cai, NingIn: Combinatorica, Jg. 13 H. 3, S. 241-2471993On communication complexity of vector-valued functions
Ahlswede, Rudolf ; Cai, NingIn: IEEE transactions on information theory, Jg. 40 H. 6, S. 2062-20671994On extremal set partitions in Cartesian product spaces
Ahlswede, Rudolf ; Cai, NingIn: Combinatorics, Probability & Computing, Jg. 2 H. 2, S. 211-2201993On partitioning and packing products with rectangles
Ahlswede, Rudolf ; Cai, NingIn: Combinatorics, Probability & Computing, Jg. 3 H. 04, S. 429-4341994Rank formulas for certain products of matrices
Ahlswede, Rudolf ; Cai, NingIn: Applicable Algebra in Engineering, Communication and Computing, Jg. 4 H. 4, S. 253-2611993Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede, Rudolf ; Cai, NingIn: 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
Ahlswede, Rudolf ; Cai, NingIn: Problems of information transmission, Jg. 30 H. 1, S. 3-101994Communication complexity in lattices
Ahlswede, Rudolf ; Cai, Ning ; Tamm, UlrichIn: Applied Mathematics Letters, Jg. 6 H. 6, S. 53-581993Diametric theorems in sequence spaces
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Combinatorica, Jg. 12 H. 1, S. 1-171992A new direction in extremal theory
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information and system sciences, Jg. 19 H. 3, S. 269-2801994Rich colorings with local constraints
Ahlswede, Rudolf ; Cai, Ning ; Zhang, ZhenIn: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-2161992Common randomness in information theory and cryptography. Part I: secret sharing
Ahlswede, Rudolf ; Csiszár, ImreIn: IEEE transactions on information theory, Jg. 39 H. 4, S. 1121-11321993Messy broadcasting in networks
Ahlswede, Rudolf ; Haroutunian, H. S. ; Khachatrian, Levon H. ; Blahut, Richard E. (Hrsg.)In: Communications and cryptography: two sides of one tapestry, Jg. 276, S. 13-241994