AAAAAA

   
Results: 1-25 | 26-30
Results: 1-25/30
ISOPERIMETRIC THEOREMS IN THE BINARY SEQUENCES OF FINITE LENGTHS
Authors: AHLSWEDE R CAI N
Citation: R. Ahlswede et N. Cai, ISOPERIMETRIC THEOREMS IN THE BINARY SEQUENCES OF FINITE LENGTHS, Applied mathematics letters, 11(5), 1998, pp. 121-126
THE DIAMETRIC THEOREM IN HAMMING-SPACES - OPTIMAL ANTICODES
Authors: AHLSWEDE R KHACHATRIAN LH
Citation: R. Ahlswede et Lh. Khachatrian, THE DIAMETRIC THEOREM IN HAMMING-SPACES - OPTIMAL ANTICODES, Advances in applied mathematics, 20(4), 1998, pp. 429-449
ZERO-ERROR CAPACITY FOR MODELS WITH MEMORY AND THE ENLIGHTENED DICTATOR CHANNEL
Authors: AHLSWEDE R CAI N ZHANG Z
Citation: R. Ahlswede et al., ZERO-ERROR CAPACITY FOR MODELS WITH MEMORY AND THE ENLIGHTENED DICTATOR CHANNEL, IEEE transactions on information theory, 44(3), 1998, pp. 1250-1252
INFORMATION AND CONTROL - MATCHING CHANNELS
Authors: AHLSWEDE R CAI N
Citation: R. Ahlswede et N. Cai, INFORMATION AND CONTROL - MATCHING CHANNELS, IEEE transactions on information theory, 44(2), 1998, pp. 542-563
COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY - PART-II - CR CAPACITY
Authors: AHLSWEDE R CSISZAR I
Citation: R. Ahlswede et I. Csiszar, COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY - PART-II - CR CAPACITY, IEEE transactions on information theory, 44(1), 1998, pp. 225-240
MODELS OF MULTIUSER WRITE-EFFICIENT MEMORIES AND GENERAL DIAMETRIC THEOREMS
Authors: AHLSWEDE R CAI N
Citation: R. Ahlswede et N. Cai, MODELS OF MULTIUSER WRITE-EFFICIENT MEMORIES AND GENERAL DIAMETRIC THEOREMS, Information and computation, 135(1), 1997, pp. 37-67
COUNTEREXAMPLE TO THE FRANKL-PACH CONJECTURE FOR UNIFORM, DENSE FAMILIES
Authors: AHLSWEDE R KHACHATRIAN LH
Citation: R. Ahlswede et Lh. Khachatrian, COUNTEREXAMPLE TO THE FRANKL-PACH CONJECTURE FOR UNIFORM, DENSE FAMILIES, Combinatorica, 17(2), 1997, pp. 299-301
SHADOWS AND ISOPERIMETRY UNDER THE SEQUENCE-SUBSEQUENCE RELATION
Authors: AHLSWEDE R CAI N
Citation: R. Ahlswede et N. Cai, SHADOWS AND ISOPERIMETRY UNDER THE SEQUENCE-SUBSEQUENCE RELATION, Combinatorica, 17(1), 1997, pp. 11-29
CORRELATED SOURCES HELP TRANSMISSION OVER AN ARBITRARILY VARYING CHANNEL
Authors: AHLSWEDE R CAI N
Citation: R. Ahlswede et N. Cai, CORRELATED SOURCES HELP TRANSMISSION OVER AN ARBITRARILY VARYING CHANNEL, IEEE transactions on information theory, 43(4), 1997, pp. 1254-1255
UNIVERSAL CODING OF INTEGERS AND UNBOUNDED SEARCH-TREES
Authors: AHLSWEDE R HAN TS KOBAYASHI K
Citation: R. Ahlswede et al., UNIVERSAL CODING OF INTEGERS AND UNBOUNDED SEARCH-TREES, IEEE transactions on information theory, 43(2), 1997, pp. 669-682
ON INTERACTIVE COMMUNICATION
Authors: AHLSWEDE R CAI N ZHANG Z
Citation: R. Ahlswede et al., ON INTERACTIVE COMMUNICATION, IEEE transactions on information theory, 43(1), 1997, pp. 22-37
IDENTIFICATION VIA COMPRESSED DATA
Authors: AHLSWEDE R YANG EH ZHANG Z
Citation: R. Ahlswede et al., IDENTIFICATION VIA COMPRESSED DATA, IEEE transactions on information theory, 43(1), 1997, pp. 48-70
THE COMPLETE NONTRIVIAL-INTERSECTION THEOREM FOR SYSTEMS OF FINITE SETS
Authors: AHLSWEDE R KHACHATRIAN LH
Citation: R. Ahlswede et Lh. Khachatrian, THE COMPLETE NONTRIVIAL-INTERSECTION THEOREM FOR SYSTEMS OF FINITE SETS, J COMB TH A, 76(1), 1996, pp. 121-138
SETS OF INTEGERS WITH PAIRWISE COMMON DIVISOR AND A FACTOR FROM A SPECIFIED SET OF PRIMES
Authors: AHLSWEDE R KHACHATRIAN LH
Citation: R. Ahlswede et Lh. Khachatrian, SETS OF INTEGERS WITH PAIRWISE COMMON DIVISOR AND A FACTOR FROM A SPECIFIED SET OF PRIMES, Acta Arithmetica, 75(3), 1996, pp. 259-276
SETS OF INTEGERS AND QUASI-INTEGERS WITH PAIRWISE COMMON DIVISOR
Authors: AHLSWEDE R KHACHATRIAN LH
Citation: R. Ahlswede et Lh. Khachatrian, SETS OF INTEGERS AND QUASI-INTEGERS WITH PAIRWISE COMMON DIVISOR, Acta Arithmetica, 74(2), 1996, pp. 141-153
FAULT-TOLERANT MINIMUM BROADCAST NETWORKS
Authors: AHLSWEDE R GARGANO L HAROUTUNIAN HS KHACHATRIAN LH
Citation: R. Ahlswede et al., FAULT-TOLERANT MINIMUM BROADCAST NETWORKS, Networks, 27(4), 1996, pp. 293-307
ERASURE, LIST, AND DETECTION ZERO-ERROR CAPACITIES FOR LOW-NOISE AND A RELATION TO IDENTIFICATION
Authors: AHLSWEDE R CAI N ZHANG Z
Citation: R. Ahlswede et al., ERASURE, LIST, AND DETECTION ZERO-ERROR CAPACITIES FOR LOW-NOISE AND A RELATION TO IDENTIFICATION, IEEE transactions on information theory, 42(1), 1996, pp. 55-62
EDGE ISOPERIMETRIC THEOREMS FOR INTEGER POINT ARRAYS
Authors: AHLSWEDE R BEZRUKOV SL
Citation: R. Ahlswede et Sl. Bezrukov, EDGE ISOPERIMETRIC THEOREMS FOR INTEGER POINT ARRAYS, Applied mathematics letters, 8(2), 1995, pp. 75-80
MAXIMAL SETS OF NUMBERS NOT CONTAINING K+1 PAIRWISE COPRIME INTEGERS
Authors: AHLSWEDE R KHACHATRIAN LH
Citation: R. Ahlswede et Lh. Khachatrian, MAXIMAL SETS OF NUMBERS NOT CONTAINING K+1 PAIRWISE COPRIME INTEGERS, Acta Arithmetica, 72(1), 1995, pp. 77-100
NEW DIRECTIONS IN THE THEORY OF IDENTIFICATION VIA CHANNELS
Authors: AHLSWEDE R ZHANG Z
Citation: R. Ahlswede et Z. Zhang, NEW DIRECTIONS IN THE THEORY OF IDENTIFICATION VIA CHANNELS, IEEE transactions on information theory, 41(4), 1995, pp. 1040-1050
LOCALIZED RANDOM AND ARBITRARY ERRORS IN THE LIGHT OF ARBITRARILY VARYING CHANNEL THEORY
Authors: AHLSWEDE R BASSALYGO LA PINSKER MS
Citation: R. Ahlswede et al., LOCALIZED RANDOM AND ARBITRARY ERRORS IN THE LIGHT OF ARBITRARILY VARYING CHANNEL THEORY, IEEE transactions on information theory, 41(1), 1995, pp. 14-25
THE ASYMPTOTIC-BEHAVIOR OF DIAMETERS IN THE AVERAGE
Authors: AHLSWEDE R ALTHOFER I
Citation: R. Ahlswede et I. Althofer, THE ASYMPTOTIC-BEHAVIOR OF DIAMETERS IN THE AVERAGE, J COMB TH B, 61(2), 1994, pp. 167-177
ON EXTREMAL SETS WITHOUT COPRIMES
Authors: AHLSWEDE R KHACHATRIAN LH
Citation: R. Ahlswede et Lh. Khachatrian, ON EXTREMAL SETS WITHOUT COPRIMES, Acta Arithmetica, 66(1), 1994, pp. 89-99
ON COMMUNICATION COMPLEXITY OF FECTOR-VALUED FUNCTIONS
Authors: AHLSWEDE R CAI N
Citation: R. Ahlswede et N. Cai, ON COMMUNICATION COMPLEXITY OF FECTOR-VALUED FUNCTIONS, IEEE transactions on information theory, 40(6), 1994, pp. 2062-2067
ON MULTIUSER WRITE-EFFICIENT MEMORIES
Authors: AHLSWEDE R ZHANG Z
Citation: R. Ahlswede et Z. Zhang, ON MULTIUSER WRITE-EFFICIENT MEMORIES, IEEE transactions on information theory, 40(3), 1994, pp. 674-686
Risultati: 1-25 | 26-30