AAAAAA

   
Results: 1-16 |
Results: 16
On perfect codes and related concepts
Authors: Ahlswede, R Aydinian, HK Khachatrian, LH
Citation: R. Ahlswede et al., On perfect codes and related concepts, DES CODES C, 22(3), 2001, pp. 221-237
Quantum data processing
Authors: Ahlswede, R Lober, P
Citation: R. Ahlswede et P. Lober, Quantum data processing, IEEE INFO T, 47(1), 2001, pp. 474-478
A diametric theorem for edges
Authors: Ahlswede, R Khachatrian, LH
Citation: R. Ahlswede et Lh. Khachatrian, A diametric theorem for edges, J COMB TH A, 92(1), 2000, pp. 1-16
Network information flow
Authors: Ahlswede, R Cai, N Li, SYR Yeung, RW
Citation: R. Ahlswede et al., Network information flow, IEEE INFO T, 46(4), 2000, pp. 1204-1216
On prefix-free and suffix-free sequences of integers
Authors: Ahlswede, R Khachatrian, LH Sarkozy, A
Citation: R. Ahlswede et al., On prefix-free and suffix-free sequences of integers, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 1-16
Splitting properties in partially ordered sets and set systems
Authors: Ahlswede, R Khachatrian, LH
Citation: R. Ahlswede et Lh. Khachatrian, Splitting properties in partially ordered sets and set systems, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 29-44
The AVC with noiseless feedback and maximal error probability: A capacity formula with a trichotomy
Authors: Ahlswede, R Cai, N
Citation: R. Ahlswede et N. Cai, The AVC with noiseless feedback and maximal error probability: A capacity formula with a trichotomy, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 151-176
On maximal shadows of members in left-compressed sets
Authors: Ahlswede, R Zhang, Z
Citation: R. Ahlswede et Z. Zhang, On maximal shadows of members in left-compressed sets, DISCR APP M, 95(1-3), 1999, pp. 3-9
A counterexample in rate-distortion theory for correlated sources
Authors: Ahlswede, R Cai, N
Citation: R. Ahlswede et N. Cai, A counterexample in rate-distortion theory for correlated sources, APPL MATH L, 12(7), 1999, pp. 1-3
A pushing-pulling method: New proofs of intersection theorems
Authors: Ahlswede, R Khachatrian, LH
Citation: R. Ahlswede et Lh. Khachatrian, A pushing-pulling method: New proofs of intersection theorems, COMBINATORI, 19(1), 1999, pp. 1-15
On the quotient sequence of sequences of integers
Authors: Ahlswede, R Khachatrian, LH Sarkozy, A
Citation: R. Ahlswede et al., On the quotient sequence of sequences of integers, ACT ARITH, 91(2), 1999, pp. 117-132
On the counting function of primitive sets of integers
Authors: Ahlswede, R Khachatrian, LH Sarkozy, A
Citation: R. Ahlswede et al., On the counting function of primitive sets of integers, J NUMBER TH, 79(2), 1999, pp. 330-344
Identification without randomization
Authors: Ahlswede, R Cai, N
Citation: R. Ahlswede et N. Cai, Identification without randomization, IEEE INFO T, 45(7), 1999, pp. 2636-2642
Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is true
Authors: Ahlswede, R Cai, N
Citation: R. Ahlswede et N. Cai, Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is true, IEEE INFO T, 45(2), 1999, pp. 742-749
Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission
Authors: Ahlswede, R Cai, N
Citation: R. Ahlswede et N. Cai, Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission, IEEE INFO T, 45(2), 1999, pp. 749-756
Construction of uniquely decodable codes for the two-user binary adder channel
Authors: Ahlswede, R Balakirsky, VB
Citation: R. Ahlswede et Vb. Balakirsky, Construction of uniquely decodable codes for the two-user binary adder channel, IEEE INFO T, 45(1), 1999, pp. 326-330
Risultati: 1-16 |