206 Publikationen

Alle markieren

[206]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2560225
Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels
Ahlswede, Rudolf, Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels. Communications In Mathematical Physics 317 (1). , 2013
PUB | DOI | WoS
 
[205]
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530
Threshold and Majority Group Testing
Ahlswede, Rudolf, Threshold and Majority Group Testing. Information Theory, Combinatorics, and Search Theory 7777 (). , 2013
PUB | DOI
 
[204]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2489365
On Generic Erasure Correcting Sets and Related Problems
Ahlswede, Rudolf, On Generic Erasure Correcting Sets and Related Problems. IEEE Transactions on Information Theory 58 (2). , 2012
PUB | DOI | WoS
 
[203]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2518066
Finding one of D defective elements in some group testing models
Ahlswede, Rudolf, Finding one of D defective elements in some group testing models. Problems of Information Transmission 48 (2). , 2012
PUB | DOI | WoS
 
[202]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814
Two Batch Search With Lie Cost
Ahlswede, Rudolf, Two Batch Search With Lie Cost. IEEE TRANSACTIONS ON INFORMATION THEORY 55 (4). , 2009
PUB | DOI | WoS
 
[201]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636468
On diagnosability of large multiprocessor networks
Ahlswede, Rudolf, On diagnosability of large multiprocessor networks. Discrete Applied Mathematics 156 (18). , 2008
PUB | DOI | WoS
 
[200]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592906
Error control codes for parallel asymmetric channels
Ahlswede, Rudolf, Error control codes for parallel asymmetric channels. IEEE Transactions on Information Theory 54 (2). , 2008
PUB | DOI | WoS
 
[199]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587905
Multiple packing in sum-type metric spaces
Ahlswede, Rudolf, Multiple packing in sum-type metric spaces. DISCRETE APPLIED MATHEMATICS 156 (9). , 2008
PUB | DOI | WoS
 
[198]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1587909
On the correlation of binary sequences
Ahlswede, Rudolf, On the correlation of binary sequences. 156 (9). , 2008
PUB | DOI | WoS
 
[197]
2008 | Sonderausgabe Zeitschrift | Veröffentlicht | PUB-ID: 2450290
General theory of information transfer and combinatorics
Ahlswede, Rudolf, General theory of information transfer and combinatorics. Discrete applied mathematics 156 (9, Special Issue). , 2008
PUB
 
[196]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133
T-Shift synchronization codes
Ahlswede, Rudolf, T-Shift synchronization codes. Discrete Applied Mathematics 156 (9). , 2008
PUB | DOI | WoS
 
[195]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587890
Ratewise-optimal non-sequential search strategies under constraints on the tests
Ahlswede, Rudolf, Ratewise-optimal non-sequential search strategies under constraints on the tests. Discrete Applied Mathematics 156 (9: Special Issue). , 2008
PUB | DOI | WoS
 
[194]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587881
Special issue: General theory of information transfer and combinatorics - Preface
Ahlswede, Rudolf, Special issue: General theory of information transfer and combinatorics - Preface. Discrete Applied Mathematics 156 (9: Special Issue). , 2008
PUB | DOI | WoS
 
[193]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893
Searching with lies under error cost constraints
Ahlswede, Rudolf, Searching with lies under error cost constraints. Discrete Applied Mathematics 156 (9). , 2008
PUB | DOI | WoS
 
[192]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587887
General theory of information transfer: Updated
Ahlswede, Rudolf, General theory of information transfer: Updated. Discrete Applied Mathematics 156 (9: Special Issue). , 2008
PUB | DOI | WoS
 
[191]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592060
The final form of Tao's inequality relating conditional expectation and conditional mutual information
Ahlswede, Rudolf, The final form of Tao's inequality relating conditional expectation and conditional mutual information. ADVANCES IN MATHEMATICS OF COMMUNICATIONS 1 (2). , 2007
PUB | DOI | WoS
 
[190]
2007 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1595873
Classical capacity of classical-quantum arbitrarily varying channels
Ahlswede, Rudolf, Classical capacity of classical-quantum arbitrarily varying channels. 53 (2). , 2007
PUB | DOI | WoS
 
[189]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599920
Intersection theorems under dimension constraints
Ahlswede, Rudolf, Intersection theorems under dimension constraints. Journal of Combinatorial Theory, Series A 113 (3). , 2006
PUB | DOI | WoS
 
[188]
2006 | Herausgeber Sammelwerk | Veröffentlicht | PUB-ID: 2449061
General theory of information transfer and combinatorics
Ahlswede, Rudolf, General theory of information transfer and combinatorics. 4123 (). Berlin, 2006
PUB
 
[187]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597070
Construction of asymmetric connectors of depth two
Ahlswede, Rudolf, Construction of asymmetric connectors of depth two. Journal of Combinatorial Theory. Series A 113 (8). , 2006
PUB | DOI | WoS
 
[186]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1598126
An interpretation of identification entropy
Ahlswede, Rudolf, An interpretation of identification entropy. IEEE TRANSACTIONS ON INFORMATION THEORY 52 (9). , 2006
PUB | DOI | WoS
 
[185]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597073
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes
Ahlswede, Rudolf, Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. JOURNAL OF COMBINATORIAL THEORY SERIES A 113 (8). , 2006
PUB | DOI | WoS
 
[184]
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516
Information Theoretic Models in Language Evolution
Ahlswede, Rudolf, Information Theoretic Models in Language Evolution. General Theory of Information Transfer and Combinatorics 4123 (). , 2006
PUB | DOI
 
[183]
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503
A Fast Suffix-Sorting Algorithm
Ahlswede, Rudolf, A Fast Suffix-Sorting Algorithm. General Theory of Information Transfer and Combinatorics 4123 (). , 2006
PUB | DOI
 
[182]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1602477
Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case
Ahlswede, Rudolf, Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography 37 (1). , 2005
PUB | DOI | WoS
 
[181]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605326
Katona's intersection theorem: Four proofs
Ahlswede, Rudolf, Katona's intersection theorem: Four proofs. COMBINATORICA 25 (1). , 2005
PUB | WoS
 
[180]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668
Searching with lies under error transition cost constraints
Ahlswede, Rudolf, Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics 21 (). , 2005
PUB | DOI
 
[179]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1596231
On the number of step functions with restrictions
Ahlswede, Rudolf, On the number of step functions with restrictions. THEORY OF PROBABILITY AND ITS APPLICATIONS 50 (4). , 2005
PUB | DOI | WoS
 
[178]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091
Non-binary error correcting codes with noiseless feedback, localized errors, or both
Ahlswede, Rudolf, Non-binary error correcting codes with noiseless feedback, localized errors, or both. Annals of the European Academy of Sciences 1 (). , 2005
PUB
 
[177]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1606261
On shadows of intersecting families
Ahlswede, Rudolf, On shadows of intersecting families. Combinatorica 24 (4). , 2004
PUB | DOI | WoS
 
[176]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1608584
Bohman's conjecture related to a sum packing problem of Erdos
Ahlswede, Rudolf, Bohman's conjecture related to a sum packing problem of Erdos. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY 132 (05). , 2004
PUB | DOI | WoS
 
[175]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1607764
On lossless quantum data compression with a classical helper
Ahlswede, Rudolf, On lossless quantum data compression with a classical helper. IEEE TRANSACTIONS ON INFORMATION THEORY 50 (6). , 2004
PUB | DOI | WoS
 
[174]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605457
On the density of primitive sets
Ahlswede, Rudolf, On the density of primitive sets. JOURNAL OF NUMBER THEORY 109 (2). , 2004
PUB | DOI | WoS
 
[173]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611107
More about shifting techniques
Ahlswede, Rudolf, More about shifting techniques. European Journal of Combinatorics 24 (5). , 2003
PUB | DOI | WoS
 
[172]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1610768
Maximum number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace
Ahlswede, Rudolf, Maximum number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace. 23 (1). , 2003
PUB | DOI | WoS
 
[171]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609595
Maximal antichains under dimension constraints
Ahlswede, Rudolf, Maximal antichains under dimension constraints. 273 (1-3). , 2003
PUB | DOI | WoS
 
[170]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609590
Extremal problems under dimension constraints
Ahlswede, Rudolf, Extremal problems under dimension constraints. 273 (1-3). , 2003
PUB | DOI | WoS
 
[169]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1611224
Cone dependence - A basic combinatorial concept
Ahlswede, Rudolf, Cone dependence - A basic combinatorial concept. 29 (1-3). , 2003
PUB | DOI | WoS
 
[168]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611220
Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case
Ahlswede, Rudolf, Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography 29 (1-3). , 2003
PUB | DOI | WoS
 
[167]
2003 | Zeitschriftenaufsatz | PUB-ID: 1882110
Addendum to: "Strong converse for identification via quantum channels"
Winter, Andreas, Addendum to: "Strong converse for identification via quantum channels". IEEE Trans. Inform. Theory 49 (1). , 2003
PUB
 
[166]
2003 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1878790
On lossless quantum data compression and quantum variable-length codes
Ahlswede, Rudolf, On lossless quantum data compression and quantum variable-length codes. Quantum Information Processing (). Weinheim, 2003
PUB
 
[165]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913390
A complexity measure for families of binary sequences
Ahlswede, Rudolf, A complexity measure for families of binary sequences. Periodica Mathematica Hungarica 46 (2). , 2003
PUB
 
[164]
2003 | Zeitschriftenaufsatz | PUB-ID: 1913395
Large deviations in quantum information theory
Ahlswede, Rudolf, Large deviations in quantum information theory. Problems of Information Transmission 39 (4). , 2003
PUB
 
[163]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614890
Parallel error correcting codes
Ahlswede, Rudolf, Parallel error correcting codes. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (4). , 2002
PUB | DOI | WoS
 
[162]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614063
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback
Ahlswede, Rudolf, Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (8). , 2002
PUB | DOI | WoS
 
[161]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1613448
The t-intersection problem in the truncated boolean lattice
Ahlswede, Rudolf, The t-intersection problem in the truncated boolean lattice. EUROPEAN JOURNAL OF COMBINATORICS 23 (5). , 2002
PUB | DOI | WoS
 
[160]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1878792
Unidirectional error control codes and related combinatorial problems
Ahlswede, Rudolf, Unidirectional error control codes and related combinatorial problems. Proceedings of Eight International Workshop on Algebraic and Combinatorial Coding Theory 2002 (). , 2002
PUB
 
[159]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1615280
Strong converse for identification via quantum channels
Ahlswede, Rudolf, Strong converse for identification via quantum channels. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (3). , 2002
PUB | DOI | WoS
 
[158]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883908
On perfect codes and related concepts
Ahlswede, Rudolf, On perfect codes and related concepts. Designs, Codes and Cryptography 22 (3). , 2001
PUB | DOI | WoS
 
[157]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883911
On primitive sets of squarefree integers
Ahlswede, Rudolf, On primitive sets of squarefree integers. Periodica Mathematica Hungarica 42 (1). , 2001
PUB | DOI
 
[156]
2001 | Sammelwerksbeitrag | PUB-ID: 1883914
Advances on extremal problems in number theory and combinatorics
Ahlswede, Rudolf, Advances on extremal problems in number theory and combinatorics. European Congress of Mathematics : Barcelona, July 10 - 14, 2000 201 (). Basel, 2001
PUB
 
[155]
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1617846
Quantum data processing
Ahlswede, Rudolf, Quantum data processing. 47 (1). , 2001
PUB | DOI | WoS
 
[154]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973
An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection
Ahlswede, Rudolf, An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection. Problems of Information Transmission 37 (4). , 2001
PUB | DOI
 
[153]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883897
On prefix-free and suffix-free sequences of integers
Ahlswede, Rudolf, On prefix-free and suffix-free sequences of integers. Numbers, Information and Complexity (). Boston, 2000
PUB
 
[152]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883900
The AVC with noiseless feedback
Ahlswede, Rudolf, The AVC with noiseless feedback. Numbers, Information and Complexity (). Boston, 2000
PUB
 
[151]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1618855
A diametric theorem for edges
Ahlswede, Rudolf, A diametric theorem for edges. JOURNAL OF COMBINATORIAL THEORY SERIES A 92 (1). , 2000
PUB | WoS
 
[150]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883895
Splitting properties in partially ordered sets and set systems
Ahlswede, Rudolf, Splitting properties in partially ordered sets and set systems. Numbers, Information and Complexity (). Boston, 2000
PUB
 
[149]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1619489
Network information flow
Ahlswede, Rudolf, Network information flow. 46 (4). , 2000
PUB | DOI | WoS
 
[148]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1620439
On the quotient sequence of sequences of integers
Ahlswede, Rudolf, On the quotient sequence of sequences of integers. Acta Arithmetica 91 (2). , 1999
PUB | WoS
 
[147]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621019
On the counting function of primitive sets of integers
Ahlswede, Rudolf, On the counting function of primitive sets of integers. Journal of Number Theory 79 (2). , 1999
PUB | DOI | WoS
 
[146]
1999 | Zeitschriftenaufsatz | PUB-ID: 1883870
Construction of uniquely decodable codes for the two-user binary adder channel
Ahlswede, Rudolf, Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory 45 (1). , 1999
PUB | DOI | WoS
 
[145]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623402
Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is true
Ahlswede, Rudolf, Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is true. IEEE Transactions on Information Theory 45 (2). , 1999
PUB | DOI | WoS
 
[144]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621975
A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problem
Ahlswede, Rudolf, A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problem. Combinatorics, Probability and Computing 8 (4). , 1999
PUB | DOI | WoS
 
[143]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883892
On the Hamming bound for nonbinary localized-error-correcting codes
Bassalygo, Leonid, On the Hamming bound for nonbinary localized-error-correcting codes. Probl. of Inf. Transmission 35 (2). , 1999
PUB
 
[142]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621563
Identification without randomization
Ahlswede, Rudolf, Identification without randomization. IEEE Transactions on Information Theory 45 (7). , 1999
PUB | DOI | WoS
 
[141]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623405
Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission
Ahlswede, Rudolf, Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission. IEEE Transactions on Information Theory 45 (2). , 1999
PUB | DOI | WoS
 
[140]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1622320
On maximal shadows of members in left-compressed sets
Ahlswede, Rudolf, On maximal shadows of members in left-compressed sets. Discrete Applied Mathematics 95 (1-3). , 1999
PUB | DOI | WoS
 
[139]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883876
A pushing-pulling method: new proofs of intersection theorems
Ahlswede, Rudolf, A pushing-pulling method: new proofs of intersection theorems. Combinatorica 19 (1). , 1999
PUB | DOI | WoS
 
[138]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913368
Asymptotical isoperimetric problem
Ahlswede, Rudolf, Asymptotical isoperimetric problem. (). , 1999
PUB
 
[137]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913370
Nonstandard coding method for nonbinary codes correcting localized errors
Ahlswede, Rudolf, Nonstandard coding method for nonbinary codes correcting localized errors. (). , 1999
PUB
 
[136]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625316
Code pairs with specified parity of the Hamming distances
Ahlswede, Rudolf, Code pairs with specified parity of the Hamming distances. DISCRETE MATHEMATICS 188 (1-3). , 1998
PUB | DOI | WoS
 
[135]
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1626601
Common randomness in information theory and cryptography - Part II: CR capacity
Ahlswede, Rudolf, Common randomness in information theory and cryptography - Part II: CR capacity. 44 (1). , 1998
PUB | DOI | WoS
 
[134]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1626351
Information and control: Matching channels
Ahlswede, Rudolf, Information and control: Matching channels. IEEE TRANSACTIONS ON INFORMATION THEORY 44 (2). , 1998
PUB | DOI | WoS
 
[133]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624985
Isoperimetric theorems in the binary sequences of finite lengths
Ahlswede, Rudolf, Isoperimetric theorems in the binary sequences of finite lengths. APPLIED MATHEMATICS LETTERS 11 (5). , 1998
PUB | DOI | WoS
 
[132]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625787
The diametric theorem in Hamming spaces - Optimal anticodes
Ahlswede, Rudolf, The diametric theorem in Hamming spaces - Optimal anticodes. ADVANCES IN APPLIED MATHEMATICS 20 (4). , 1998
PUB | DOI | WoS
 
[131]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625772
Zero-error capacity for models with memory and the enlightened dictator channel
Ahlswede, Rudolf, Zero-error capacity for models with memory and the enlightened dictator channel. IEEE TRANSACTIONS ON INFORMATION THEORY 44 (3). , 1998
PUB | DOI | WoS
 
[130]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624907
The intersection theorem for direct products
Ahlswede, Rudolf, The intersection theorem for direct products. European Journal of Combinatorics 19 (6). , 1998
PUB | DOI | WoS
 
[129]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627492
Shadows and isoperimetry under the sequence-subsequence relation
Ahlswede, Rudolf, Shadows and isoperimetry under the sequence-subsequence relation. Combinatorica 17 (1). , 1997
PUB | DOI | WoS
 
[128]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636801
Correlated sources help transmission over an arbitrarily varying channel
Ahlswede, Rudolf, Correlated sources help transmission over an arbitrarily varying channel. IEEE TRANSACTIONS ON INFORMATION THEORY 43 (4). , 1997
PUB | DOI | WoS
 
[127]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627477
Counterexample to the Frankl-Pach conjecture for uniform, dense families
Ahlswede, Rudolf, Counterexample to the Frankl-Pach conjecture for uniform, dense families. COMBINATORICA 17 (2). , 1997
PUB | DOI | WoS
 
[126]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637377
Edge-isoperimetric inequalities .1. Information-theoretical methods
Ahlswede, Rudolf, Edge-isoperimetric inequalities .1. Information-theoretical methods. EUROPEAN JOURNAL OF COMBINATORICS 18 (4). , 1997
PUB | DOI | WoS
 
[125]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636745
General edge-isoperimetric inequalities .2. A local-global principle for lexicographical solutions
Ahlswede, Rudolf, General edge-isoperimetric inequalities .2. A local-global principle for lexicographical solutions. EUROPEAN JOURNAL OF COMBINATORICS 18 (5). , 1997
PUB | DOI | WoS
 
[124]
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628236
Identification via compressed data
Ahlswede, Rudolf, Identification via compressed data. 43 (1). , 1997
PUB | DOI | WoS
 
[123]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636775
Models of multi-user write-efficient memories and general diametric theorems
Ahlswede, Rudolf, Models of multi-user write-efficient memories and general diametric theorems. INFORMATION AND COMPUTATION 135 (1). , 1997
PUB | DOI | WoS
 
[122]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637712
Number theoretic correlation inequalities for Dirichlet densities
Ahlswede, Rudolf, Number theoretic correlation inequalities for Dirichlet densities. JOURNAL OF NUMBER THEORY 63 (1). , 1997
PUB | DOI | WoS
 
[121]
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628232
On interactive communication
Ahlswede, Rudolf, On interactive communication. 43 (1). , 1997
PUB | DOI | WoS
 
[120]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637812
The complete intersection theorem for systems of finite sets
Ahlswede, Rudolf, The complete intersection theorem for systems of finite sets. EUROPEAN JOURNAL OF COMBINATORICS 18 (2). , 1997
PUB | DOI | WoS
 
[119]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637805
Universal coding of integers and unbounded search trees
Ahlswede, Rudolf, Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY 43 (2). , 1997
PUB | DOI | WoS
 
[118]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628669
A counterexample to Aharoni's strongly maximal matching conjecture
Ahlswede, Rudolf, A counterexample to Aharoni's strongly maximal matching conjecture. DISCRETE MATHEMATICS 149 (1-3). , 1996
PUB | DOI | WoS
 
[117]
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913322
Cross-disjoint pairs of clouds in the interval lattice
Ahlswede, Rudolf, Cross-disjoint pairs of clouds in the interval lattice. The Mathematics of Paul Erdos, Vol. I (). Berlin/Heidelberg/New York, 1996
PUB
 
[116]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628906
Erasure, list, and detection zero-error capacities for low noise and a relation to identification
Ahlswede, Rudolf, Erasure, list, and detection zero-error capacities for low noise and a relation to identification. IEEE TRANSACTIONS ON INFORMATION THEORY 42 (1). , 1996
PUB | DOI | WoS
 
[115]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638929
Fault-tolerant minimum broadcast networks
Ahlswede, Rudolf, Fault-tolerant minimum broadcast networks. NETWORKS 27 (4). , 1996
PUB | DOI | WoS
 
[114]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638192
Incomparability and intersection properties of Boolean interval lattices and chain posets
Ahlswede, Rudolf, Incomparability and intersection properties of Boolean interval lattices and chain posets. EUROPEAN JOURNAL OF COMBINATORICS 17 (8). , 1996
PUB | DOI | WoS
 
[113]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639105
Optimal pairs of incomparable clouds in multisets
Ahlswede, Rudolf, Optimal pairs of incomparable clouds in multisets. GRAPHS AND COMBINATORICS 12 (1). , 1996
PUB | DOI | WoS
 
[112]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639674
Sets of integers and quasi-integers with pairwise common divisor
Ahlswede, Rudolf, Sets of integers and quasi-integers with pairwise common divisor. ACTA ARITHMETICA 74 (2). , 1996
PUB | WoS
 
[111]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639022
Sets of integers with pairwise common divisor and a factor from a specified set of primes
Ahlswede, Rudolf, Sets of integers with pairwise common divisor and a factor from a specified set of primes. ACTA ARITHMETICA 75 (3). , 1996
PUB | WoS
 
[110]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638542
The complete nontrivial-intersection theorem for systems of finite sets
Ahlswede, Rudolf, The complete nontrivial-intersection theorem for systems of finite sets. JOURNAL OF COMBINATORIAL THEORY SERIES A 76 (1). , 1996
PUB | DOI | WoS
 
[109]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913328
Identification under random processes
Ahlswede, Rudolf, Identification under random processes. Problems of Information Transmission 32 (1). , 1996
PUB
 
[108]
1996 | Preprint | Veröffentlicht | PUB-ID: 1913331
Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching
Ahlswede, Rudolf, Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching. Ergänzungsreihe des SFB 343 ``Diskrete Strukturen in der Mathematik'' 95-004 (). , 1996
PUB
 
[107]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913343
Intersecting Systems
Ahlswede, Rudolf, Intersecting Systems. Combinatorics, Probability and Computing 6 (). , 1996
PUB
 
[106]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913355
Higher level extremal problems
Ahlswede, Rudolf, Higher level extremal problems. Comb. Inf. & Syst. Sc. 21 (3-4). , 1996
PUB
 
[105]
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913333
Classical results on primitive and recent results on cross-primitive sequences
Ahlswede, Rudolf, Classical results on primitive and recent results on cross-primitive sequences. The Mathematics of Paul Erdos, Vol. I I (). Berlin/Heidelberg/New York, 1996
PUB
 
[104]
1996 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913352
Some properties of fix-free codes
Ahlswede, Rudolf, Some properties of fix-free codes. (). Thahkadzor, Armenia, 1996
PUB
 
[103]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1629125
Density inequalities for sets of multiples
Ahlswede, Rudolf, Density inequalities for sets of multiples. JOURNAL OF NUMBER THEORY 55 (2). , 1995
PUB | DOI | WoS
 
[102]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913242
New directions in the theory of identification via channels
Ahlswede, Rudolf, New directions in the theory of identification via channels. IEEE Trans. Inf. Theory 41 (4). , 1995
PUB | DOI | WoS
 
[101]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913254
Maximal sets of numbers not containing k+1 pairwise coprime integers
Ahlswede, Rudolf, Maximal sets of numbers not containing k+1 pairwise coprime integers. Acta Arithmetica 72 (1). , 1995
PUB | WoS
 
[100]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913278
A splitting property of maximal antichains
Ahlswede, Rudolf, A splitting property of maximal antichains. Combinatorica 15 (4). , 1995
PUB | DOI | WoS
 
[99]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780563
Asymptotically optimal binary codes of polynomial complexity correcting localized errors
Ahlswede, Rudolf, Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf. 31 (2). , 1995
PUB | PDF
 
[98]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1641640
Localized random and arbitrary errors in the light of AV channel theory
Ahlswede, Rudolf, Localized random and arbitrary errors in the light of AV channel theory. IEEE Transactions on Information Theory 41 (1). , 1995
PUB | DOI | WoS
 
[97]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913236
Edge isoperimetric theorems for integer point arrays
Ahlswede, Rudolf, Edge isoperimetric theorems for integer point arrays. Applied Mathematics Letters 8 (2). , 1995
PUB | DOI | WoS
 
[96]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913248
Towards characterising equality in correlation inequalities
Ahlswede, Rudolf, Towards characterising equality in correlation inequalities. European J. of Combinatorics 16 (). , 1995
PUB | DOI | WoS
 
[95]
1994 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780546
Messy broadcasting in networks
Ahlswede, Rudolf, Messy broadcasting in networks. Communications and cryptography: two sides of one tapestry 276 (). Boston [u.a.], 1994
PUB | PDF
 
[94]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774967
On extremal sets without coprimes
Ahlswede, Rudolf, On extremal sets without coprimes. Acta Arithmetica 66 (1). , 1994
PUB | PDF | DOI | WoS
 
[93]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780530
The maximal length of cloud-antichains
Ahlswede, Rudolf, The maximal length of cloud-antichains. Discrete Mathematics 131 (1-3). , 1994
PUB | PDF | DOI | WoS
 
[92]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781092
A new direction in extremal theory
Ahlswede, Rudolf, A new direction in extremal theory. Journal of combinatorics, information and system sciences 19 (3). , 1994
PUB | PDF
 
[91]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780544
Two-way communication complexity of sum-type functions for one processor to be informed
Ahlswede, Rudolf, Two-way communication complexity of sum-type functions for one processor to be informed. Problems of information transmission 30 (1). , 1994
PUB | PDF
 
[90]
1994 | Preprint | Veröffentlicht | PUB-ID: 1780556
On sets of words with pairwise common letter in different positions
Ahlswede, Rudolf, On sets of words with pairwise common letter in different positions. (). , 1994
PUB | PDF
 
[89]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780560
On partitioning and packing products with rectangles
Ahlswede, Rudolf, On partitioning and packing products with rectangles. Combinatorics, Probability & Computing 3 (04). , 1994
PUB | PDF | DOI
 
[88]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780527
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture
Ahlswede, Rudolf, On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics 128 (1-3). , 1994
PUB | PDF | DOI | WoS
 
[87]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780541
The asymptotic behavior of diameters in the average
Ahlswede, Rudolf, The asymptotic behavior of diameters in the average. Journal of Combinatorial Theory, Series B 61 (2). , 1994
PUB | PDF | DOI | WoS
 
[86]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780553
Binary constant-weight codes correcting localized errors and defects
Ahlswede, Rudolf, Binary constant-weight codes correcting localized errors and defects. Problems of information transmission 30 (2). , 1994
PUB | PDF
 
[85]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780497
On communication complexity of vector-valued functions
Ahlswede, Rudolf, On communication complexity of vector-valued functions. IEEE transactions on information theory 40 (6). , 1994
PUB | PDF | DOI | WoS
 
[84]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780494
On multiuser write-efficient memories
Ahlswede, Rudolf, On multiuser write-efficient memories. IEEE transactions on information theory 40 (3). , 1994
PUB | PDF | DOI | WoS
 
[83]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774963
Rank formulas for certain products of matrices
Ahlswede, Rudolf, Rank formulas for certain products of matrices. Applicable Algebra in Engineering, Communication and Computing 4 (4). , 1993
PUB | PDF | DOI | WoS
 
[82]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780491
Common randomness in information theory and cryptography. Part I: secret sharing
Ahlswede, Rudolf, Common randomness in information theory and cryptography. Part I: secret sharing. IEEE transactions on information theory 39 (4). , 1993
PUB | PDF | DOI | WoS
 
[81]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780525
On extremal set partitions in Cartesian product spaces
Ahlswede, Rudolf, On extremal set partitions in Cartesian product spaces. Combinatorics, Probability & Computing 2 (2). , 1993
PUB | PDF
 
[80]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780515
Partitioning the n-cube into sets with mutual distance 1
Blokhuis, A., Partitioning the n-cube into sets with mutual distance 1. Applied Mathematics Letters 6 (4). , 1993
PUB | PDF | DOI | WoS
 
[79]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774960
A generalization of the AZ identity
Ahlswede, Rudolf, A generalization of the AZ identity. Combinatorica 13 (3). , 1993
PUB | PDF | DOI | WoS
 
[78]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780485
The maximal error capacity of arbitrarily varying channels for constant list sizes
Ahlswede, Rudolf, The maximal error capacity of arbitrarily varying channels for constant list sizes. IEEE transactions on information theory 39 (4). , 1993
PUB | PDF | DOI | WoS
 
[77]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780512
Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]
Ahlswede, Rudolf, Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]. Comptes rendus de l' Académie bulgare des Sciences 46 (1). , 1993
PUB | PDF
 
[76]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780487
Nonbinary codes correcting localized errors
Ahlswede, Rudolf, Nonbinary codes correcting localized errors. IEEE transactions on information theory 39 (4). , 1993
PUB | PDF | DOI | WoS
 
[75]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780521
Communication complexity in lattices
Ahlswede, Rudolf, Communication complexity in lattices. Applied Mathematics Letters 6 (6). , 1993
PUB | PDF | DOI | WoS
 
[74]
1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780509
Rich colorings with local constraints
Ahlswede, Rudolf, Rich colorings with local constraints. Journal of combinatorics, information & system sciences 17 (3). , 1992
PUB | PDF
 
[73]
1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774877
Diametric theorems in sequence spaces
Ahlswede, Rudolf, Diametric theorems in sequence spaces. Combinatorica 12 (1). , 1992
PUB | PDF | DOI | WoS
 
[72]
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780477
Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory
Ahlswede, Rudolf, Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory. IEEE transactions on information theory 37 (4). , 1991
PUB | PDF | DOI | WoS
 
[71]
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780480
On identification via multiway channels with feedback
Ahlswede, Rudolf, On identification via multiway channels with feedback. IEEE transactions on information theory 37 (5). , 1991
PUB | PDF | DOI | WoS
 
[70]
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780482
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede, Rudolf, Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. IEEE transactions on information theory 37 (6). , 1991
PUB | PDF | DOI | WoS
 
[69]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775120
On cloud-antichains and related configurations
Ahlswede, Rudolf, On cloud-antichains and related configurations. Discrete Mathematics 85 (3). , 1990
PUB | PDF | DOI | WoS
 
[68]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781090
On minimax estimation in the presence of side information about remote data
Ahlswede, Rudolf, On minimax estimation in the presence of side information about remote data. The annals of statistics 18 (1). , 1990
PUB | PDF | DOI | WoS
 
[67]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775117
Creating order in sequence spaces with simple machines
Ahlswede, Rudolf, Creating order in sequence spaces with simple machines. Information and Computation 89 (1). , 1990
PUB | PDF | DOI | WoS
 
[66]
1990 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780506
A recursive bound for the number of complete K-subgraphs of a graph
Ahlswede, Rudolf, A recursive bound for the number of complete K-subgraphs of a graph. Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel (). Heidelberg, 1990
PUB | PDF
 
[65]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780503
An identity in combinatorial extremal theory
Ahlswede, Rudolf, An identity in combinatorial extremal theory. Advances in Mathematics 80 (2). , 1990
PUB | PDF | DOI | WoS
 
[64]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780475
Extremal properties of rate distortion functions
Ahlswede, Rudolf, Extremal properties of rate distortion functions. IEEE transactions on information theory 36 (1). , 1990
PUB | PDF | DOI | WoS
 
[63]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775113
Contributions to a theory of ordering for sequence spaces
Ahlswede, Rudolf, Contributions to a theory of ordering for sequence spaces. Problems of Control and Information Theory 18 (4). , 1989
PUB | PDF | WoS
 
[62]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780472
Identification in the presence of feedback: a discovery of new capacity formulas
Ahlswede, Rudolf, Identification in the presence of feedback: a discovery of new capacity formulas. IEEE transactions on information theory 35 (1). , 1989
PUB | PDF | DOI | WoS
 
[61]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780469
Identification via channels
Ahlswede, Rudolf, Identification via channels. IEEE transactions on information theory 35 (1). , 1989
PUB | PDF | DOI | WoS
 
[60]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775115
Coding for write-efficient memory
Ahlswede, Rudolf, Coding for write-efficient memory. Information and Computation 83 (1). , 1989
PUB | PDF | DOI | WoS
 
[59]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780500
A general 4-words inequality with consequences for 2-way communication complexity
Ahlswede, Rudolf, A general 4-words inequality with consequences for 2-way communication complexity. Advances in Applied Mathematics 10 (1). , 1989
PUB | PDF | DOI | WoS
 
[58]
1988 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775111
Inequalities for code pairs
Ahlswede, Rudolf, Inequalities for code pairs. European Journal of Combinatorics 9 (). , 1988
PUB | PDF | DOI | WoS
 
[57]
1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780468
On code pairs with specified Hamming distances
Ahlswede, Rudolf, On code pairs with specified Hamming distances. Combinatorics 52 (). Amsterdam [u.a.], 1987
PUB | PDF
 
[56]
1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780605
Eight problems in information theory
Ahlswede, Rudolf, Eight problems in information theory. Open problems in communication and computation (). New York [u.a.], 1987
PUB | PDF
 
[55]
1987 | Monographie | Veröffentlicht | PUB-ID: 1913125
Search Problems
Ahlswede, Rudolf, Search Problems. (). , 1987
PUB
 
[54]
1987 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780452
Optimal coding strategies for certain permuting channels
Ahlswede, Rudolf, Optimal coding strategies for certain permuting channels. IEEE transactions on information theory 33 (3). , 1987
PUB | PDF | DOI | WoS
 
[53]
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780427
Hypothesis testing with communication constraints
Ahlswede, Rudolf, Hypothesis testing with communication constraints. IEEE transactions on information theory 32 (4). , 1986
PUB | PDF | DOI | WoS
 
[52]
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780441
Arbitrarily varying channels with states sequence known to the sender
Ahlswede, Rudolf, Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory 32 (5). , 1986
PUB | PDF | DOI | WoS
 
[51]
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780429
On multiple descriptions and team guessing
Ahlswede, Rudolf, On multiple descriptions and team guessing. IEEE transactions on information theory 32 (4). , 1986
PUB | PDF | DOI | WoS
 
[50]
1985 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780426
The rate-distortion region for multiple descriptions without excess rate
Ahlswede, Rudolf, The rate-distortion region for multiple descriptions without excess rate. IEEE transactions on information theory 31 (6). , 1985
PUB | PDF | DOI | WoS
 
[49]
1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775096
A two-family extremal problem in hamming space
Ahlswede, Rudolf, A two-family extremal problem in hamming space. Discrete Mathematics 49 (1). , 1984
PUB | PDF | DOI | WoS
 
[48]
1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780416
Improvements of Winograd's result on computation in the presence of noise
Ahlswede, Rudolf, Improvements of Winograd's result on computation in the presence of noise. IEEE transactions on information theory 30 (6). , 1984
PUB | PDF | DOI | WoS
 
[47]
1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775100
Note on an extremal problem arising for unreliable networks in parallel computing
Ahlswede, Rudolf, Note on an extremal problem arising for unreliable networks in parallel computing. Discrete Mathematics 47 (). , 1983
PUB | PDF | DOI | WoS
 
[46]
1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780414
On source coding with side information via a multiple-access channel and related problems in multi-user information theory
Ahlswede, Rudolf, On source coding with side information via a multiple-access channel and related problems in multi-user information theory. IEEE transactions on information theory 29 (3). , 1983
PUB | PDF | DOI | WoS
 
[45]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913152
An elementary proof of the strong converse theorem for the multiple-access channel
Ahlswede, Rudolf, An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences 7 (3). , 1982
PUB | PDF
 
[44]
1982 | Monographie | Veröffentlicht | PUB-ID: 1913139
Zadaci poiska
Ahlswede, Rudolf, Zadaci poiska. (). Moskau, 1982
PUB
 
[43]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775489
Remarks on Shannon's secrecy systems
Ahlswede, Rudolf, Remarks on Shannon's secrecy systems. Problems of Control and Information Theory 11 (4). , 1982
PUB | PDF
 
[42]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775509
Bad codes are good ciphers
Ahlswede, Rudolf, Bad codes are good ciphers. Problems of Control and Information Theory 11 (5). , 1982
PUB | PDF
 
[41]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780388
Jacob Wolfowitz (1910-1981)
Ahlswede, Rudolf, Jacob Wolfowitz (1910-1981). IEEE transactions on information theory 28 (5). , 1982
PUB | PDF
 
[40]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1776125
Good codes can be produced by a few permutations
Ahlswede, Rudolf, Good codes can be produced by a few permutations. IEEE transactions on information theory 28 (3). , 1982
PUB | PDF | DOI | WoS
 
[39]
1981 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775487
To get a bit of information may be as hard as to get full information
Ahlswede, Rudolf, To get a bit of information may be as hard as to get full information. IEEE transactions on information theory 27 (4). , 1981
PUB | PDF | DOI | WoS
 
[38]
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780400
Simple hypergraphs with maximal number of adjacent pairs of edges
Ahlswede, Rudolf, Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B 28 (2). , 1980
PUB | PDF | DOI | WoS
 
[37]
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775420
Coloring hypergraphs: A new approach to multi-user source coding, 2
Ahlswede, Rudolf, Coloring hypergraphs: A new approach to multi-user source coding, 2. Journal of combinatorics, information & system sciences 5 (3). , 1980
PUB | PDF
 
[36]
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775486
A method of coding and its application to arbitrarily varying channels
Ahlswede, Rudolf, A method of coding and its application to arbitrarily varying channels. Journal of combinatorics, information and system sciences 5 (1). , 1980
PUB | PDF
 
[35]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774874
Inequalities for a pair of maps S x S -> S with S a finite set
Ahlswede, Rudolf, Inequalities for a pair of maps S x S -> S with S a finite set. Mathematische Zeitschrift 165 (3). , 1979
PUB | PDF | DOI | WoS
 
[34]
1979 | Monographie | Veröffentlicht | PUB-ID: 1913120
Suchprobleme
Ahlswede, Rudolf, Suchprobleme. (). , 1979
PUB
 
[33]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780382
The number of values of combinatorial functions
Ahlswede, Rudolf, The number of values of combinatorial functions. Bulletin of the London Mathematical Society 11 (1). , 1979
PUB | PDF | DOI
 
[32]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775419
Coloring hypergraphs: A new approach to multi-user source coding, 1
Ahlswede, Rudolf, Coloring hypergraphs: A new approach to multi-user source coding, 1. Journal of combinatorics, information & system sciences 4 (1). , 1979
PUB | PDF
 
[31]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780389
Integral inequalities for increasing functions
Ahlswede, Rudolf, Integral inequalities for increasing functions. Mathematical Proceedings of the Cambridge Philosophical Society 86 (03). , 1979
PUB | PDF | DOI | WoS
 
[30]
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774867
Elimination of correlation in random codes for arbitrarily varying channels
Ahlswede, Rudolf, Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 44 (2). , 1978
PUB | PDF | DOI | WoS
 
[29]
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780385
Graphs with maximal number of adjacent pairs of edges
Ahlswede, Rudolf, Graphs with maximal number of adjacent pairs of edges. Acta mathematica Academiae Scientiarum Hungaricae 32 (1-2). , 1978
PUB | PDF | DOI | WoS
 
[28]
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774869
An inequality for the weights of two families of sets, their unions and intersections
Ahlswede, Rudolf, An inequality for the weights of two families of sets, their unions and intersections. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 43 (3). , 1978
PUB | PDF | DOI | WoS
 
[27]
1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775092
Contributions to the geometry of hamming spaces
Ahlswede, Rudolf, Contributions to the geometry of hamming spaces. Discrete Mathematics 17 (1). , 1977
PUB | PDF | DOI | WoS
 
[26]
1977 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780380
On the connection between the entropies of input and output distributions of discrete memoryless channels
Ahlswede, Rudolf, On the connection between the entropies of input and output distributions of discrete memoryless channels. Proceedings of the fifth Conference on Probability Theory (). Bucuresti, 1977
PUB | PDF
 
[25]
1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774860
Correction to: Bounds on conditional probabilities with applications
Ahlswede, Rudolf, Correction to: Bounds on conditional probabilities with applications. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 39 (4). , 1977
PUB | PDF | DOI | WoS
 
[24]
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781088
Spreading of sets in product spaces and hypercontraction of the Markov operator
Ahlswede, Rudolf, Spreading of sets in product spaces and hypercontraction of the Markov operator. The annals of probability 4 (6). , 1976
PUB | PDF
 
[23]
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774864
Every bad code has a good subcode: a local converse to the coding theorem
Ahlswede, Rudolf, Every bad code has a good subcode: a local converse to the coding theorem. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 34 (2). , 1976
PUB | PDF | DOI | WoS
 
[22]
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774856
Bounds on conditional probabilities with applications in multi-user communication
Ahlswede, Rudolf, Bounds on conditional probabilities with applications in multi-user communication. 34 (2). , 1976
PUB | PDF | DOI | WoS
 
[21]
1975 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775417
Two contributions to information theory
Ahlswede, Rudolf, Two contributions to information theory. Topics in information theory 16 (). Amsterdam, 1975
PUB | PDF
 
[20]
1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775415
Source encoding with side information and a converse for degraded broadcast channels
Ahlswede, Rudolf, Source encoding with side information and a converse for degraded broadcast channels. IEEE transactions on information theory IT-21 (6). , 1975
PUB | PDF
 
[19]
1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775089
Approximation o continuous functions in p-Adic Analysis
Ahlswede, Rudolf, Approximation o continuous functions in p-Adic Analysis. Journal of Approximation Theory 15 (3). , 1975
PUB | PDF | DOI | WoS
 
[18]
1974 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781087
The capacity region of a channel with two senders and two receivers
Ahlswede, Rudolf, The capacity region of a channel with two senders and two receivers. The annals of probability 2 (5). , 1974
PUB | PDF
 
[17]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780371
Multi-way communication channels
Ahlswede, Rudolf, Multi-way communication channels. Second International Symposium on Information Theory: Tsahkadsor, Armenia, USSR, Sept. 2 - 8, 1971 (). Budapest, 1973
PUB | PDF
 
[16]
1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774854
Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
Ahlswede, Rudolf, Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 25 (3). , 1973
PUB | PDF | DOI | WoS
 
[15]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780373
A constructive proof of the coding theorem for discrete memoryless channels with feedback
Ahlswede, Rudolf, A constructive proof of the coding theorem for discrete memoryless channels with feedback. Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971 (). München, 1973
PUB | PDF
 
[14]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780372
On two-way communication channels and a problem by Zarankiewicz
Ahlswede, Rudolf, On two-way communication channels and a problem by Zarankiewicz. Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971 (). München, 1973
PUB | PDF
 
[13]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780374
The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions
Ahlswede, Rudolf, The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions. Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971 (). München, 1973
PUB | PDF
 
[12]
1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781086
Channel capacities for list codes
Ahlswede, Rudolf, Channel capacities for list codes. Journal of applied probability 10 (). , 1973
PUB | PDF
 
[11]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775343
Channels without synchronization
Ahlswede, Rudolf, Channels without synchronization. Advances in applied probability 3 (2). , 1971
PUB | PDF
 
[10]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775381
Bounds on algebraic code capacities for noisy channels. II
Ahlswede, Rudolf, Bounds on algebraic code capacities for noisy channels. II. Information and Control 19 (2). , 1971
PUB | PDF | DOI | WoS
 
[9]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774872
Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels
Ahlswede, Rudolf, Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels. The Annals of Mathematical Statistics 42 (1). , 1971
PUB | PDF | DOI | WoS
 
[8]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775378
Bounds on algebraic code capacities for noisy channels. I
Ahlswede, Rudolf, Bounds on algebraic code capacities for noisy channels. I. Information and Control 18 (2). , 1971
PUB | PDF | DOI | WoS
 
[7]
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781084
A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacity
Ahlswede, Rudolf, A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacity. The annals of mathematical statistics 41 (3). , 1970
PUB | PDF
 
[6]
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774851
The capacity of a channel with arbitrarily varying channel probability functions and binary output
Ahlswede, Rudolf, The capacity of a channel with arbitrarily varying channel probability functions and binary output. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 15 (3). , 1970
PUB | PDF | DOI | WoS
 
[5]
1969 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775340
Correlated decoding for channels with arbitrarily varying channel probability functions
Ahlswede, Rudolf, Correlated decoding for channels with arbitrarily varying channel probability functions. Information and Control 14 (5). , 1969
PUB | PDF | DOI | WoS
 
[4]
1969 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775145
The structure of capacity functions for compound channels
Ahlswede, Rudolf, The structure of capacity functions for compound channels. Probability and information theory vol. 1: Proceedings of the international symposium at McMaster University, Canada, April 1968 (). Berlin, 1969
PUB | PDF
 
[3]
1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774842
The weak capacity of averaged channels
Ahlswede, Rudolf, The weak capacity of averaged channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 11 (1). , 1968
PUB | PDF | DOI | WoS
 
[2]
1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774845
Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle
Ahlswede, Rudolf, Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 10 (1). , 1968
PUB | PDF | DOI | WoS
 
[1]
1967 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780342
Certain results in coding theory for compound channels
Ahlswede, Rudolf, Certain results in coding theory for compound channels. Proceedings of the Colloquium on Information Theory (). Budapest, 1967
PUB | PDF
 

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: default

Export / Einbettung

206 Publikationen

Alle markieren

[206]
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2560225
Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels
Ahlswede, Rudolf, Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels. Communications In Mathematical Physics 317 (1). , 2013
PUB | DOI | WoS
 
[205]
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530
Threshold and Majority Group Testing
Ahlswede, Rudolf, Threshold and Majority Group Testing. Information Theory, Combinatorics, and Search Theory 7777 (). , 2013
PUB | DOI
 
[204]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2489365
On Generic Erasure Correcting Sets and Related Problems
Ahlswede, Rudolf, On Generic Erasure Correcting Sets and Related Problems. IEEE Transactions on Information Theory 58 (2). , 2012
PUB | DOI | WoS
 
[203]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2518066
Finding one of D defective elements in some group testing models
Ahlswede, Rudolf, Finding one of D defective elements in some group testing models. Problems of Information Transmission 48 (2). , 2012
PUB | DOI | WoS
 
[202]
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814
Two Batch Search With Lie Cost
Ahlswede, Rudolf, Two Batch Search With Lie Cost. IEEE TRANSACTIONS ON INFORMATION THEORY 55 (4). , 2009
PUB | DOI | WoS
 
[201]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636468
On diagnosability of large multiprocessor networks
Ahlswede, Rudolf, On diagnosability of large multiprocessor networks. Discrete Applied Mathematics 156 (18). , 2008
PUB | DOI | WoS
 
[200]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592906
Error control codes for parallel asymmetric channels
Ahlswede, Rudolf, Error control codes for parallel asymmetric channels. IEEE Transactions on Information Theory 54 (2). , 2008
PUB | DOI | WoS
 
[199]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587905
Multiple packing in sum-type metric spaces
Ahlswede, Rudolf, Multiple packing in sum-type metric spaces. DISCRETE APPLIED MATHEMATICS 156 (9). , 2008
PUB | DOI | WoS
 
[198]
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1587909
On the correlation of binary sequences
Ahlswede, Rudolf, On the correlation of binary sequences. 156 (9). , 2008
PUB | DOI | WoS
 
[197]
2008 | Sonderausgabe Zeitschrift | Veröffentlicht | PUB-ID: 2450290
General theory of information transfer and combinatorics
Ahlswede, Rudolf, General theory of information transfer and combinatorics. Discrete applied mathematics 156 (9, Special Issue). , 2008
PUB
 
[196]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133
T-Shift synchronization codes
Ahlswede, Rudolf, T-Shift synchronization codes. Discrete Applied Mathematics 156 (9). , 2008
PUB | DOI | WoS
 
[195]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587890
Ratewise-optimal non-sequential search strategies under constraints on the tests
Ahlswede, Rudolf, Ratewise-optimal non-sequential search strategies under constraints on the tests. Discrete Applied Mathematics 156 (9: Special Issue). , 2008
PUB | DOI | WoS
 
[194]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587881
Special issue: General theory of information transfer and combinatorics - Preface
Ahlswede, Rudolf, Special issue: General theory of information transfer and combinatorics - Preface. Discrete Applied Mathematics 156 (9: Special Issue). , 2008
PUB | DOI | WoS
 
[193]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893
Searching with lies under error cost constraints
Ahlswede, Rudolf, Searching with lies under error cost constraints. Discrete Applied Mathematics 156 (9). , 2008
PUB | DOI | WoS
 
[192]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587887
General theory of information transfer: Updated
Ahlswede, Rudolf, General theory of information transfer: Updated. Discrete Applied Mathematics 156 (9: Special Issue). , 2008
PUB | DOI | WoS
 
[191]
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592060
The final form of Tao's inequality relating conditional expectation and conditional mutual information
Ahlswede, Rudolf, The final form of Tao's inequality relating conditional expectation and conditional mutual information. ADVANCES IN MATHEMATICS OF COMMUNICATIONS 1 (2). , 2007
PUB | DOI | WoS
 
[190]
2007 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1595873
Classical capacity of classical-quantum arbitrarily varying channels
Ahlswede, Rudolf, Classical capacity of classical-quantum arbitrarily varying channels. 53 (2). , 2007
PUB | DOI | WoS
 
[189]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599920
Intersection theorems under dimension constraints
Ahlswede, Rudolf, Intersection theorems under dimension constraints. Journal of Combinatorial Theory, Series A 113 (3). , 2006
PUB | DOI | WoS
 
[188]
2006 | Herausgeber Sammelwerk | Veröffentlicht | PUB-ID: 2449061
General theory of information transfer and combinatorics
Ahlswede, Rudolf, General theory of information transfer and combinatorics. 4123 (). Berlin, 2006
PUB
 
[187]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597070
Construction of asymmetric connectors of depth two
Ahlswede, Rudolf, Construction of asymmetric connectors of depth two. Journal of Combinatorial Theory. Series A 113 (8). , 2006
PUB | DOI | WoS
 
[186]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1598126
An interpretation of identification entropy
Ahlswede, Rudolf, An interpretation of identification entropy. IEEE TRANSACTIONS ON INFORMATION THEORY 52 (9). , 2006
PUB | DOI | WoS
 
[185]
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597073
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes
Ahlswede, Rudolf, Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. JOURNAL OF COMBINATORIAL THEORY SERIES A 113 (8). , 2006
PUB | DOI | WoS
 
[184]
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516
Information Theoretic Models in Language Evolution
Ahlswede, Rudolf, Information Theoretic Models in Language Evolution. General Theory of Information Transfer and Combinatorics 4123 (). , 2006
PUB | DOI
 
[183]
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503
A Fast Suffix-Sorting Algorithm
Ahlswede, Rudolf, A Fast Suffix-Sorting Algorithm. General Theory of Information Transfer and Combinatorics 4123 (). , 2006
PUB | DOI
 
[182]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1602477
Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case
Ahlswede, Rudolf, Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography 37 (1). , 2005
PUB | DOI | WoS
 
[181]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605326
Katona's intersection theorem: Four proofs
Ahlswede, Rudolf, Katona's intersection theorem: Four proofs. COMBINATORICA 25 (1). , 2005
PUB | WoS
 
[180]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668
Searching with lies under error transition cost constraints
Ahlswede, Rudolf, Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics 21 (). , 2005
PUB | DOI
 
[179]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1596231
On the number of step functions with restrictions
Ahlswede, Rudolf, On the number of step functions with restrictions. THEORY OF PROBABILITY AND ITS APPLICATIONS 50 (4). , 2005
PUB | DOI | WoS
 
[178]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091
Non-binary error correcting codes with noiseless feedback, localized errors, or both
Ahlswede, Rudolf, Non-binary error correcting codes with noiseless feedback, localized errors, or both. Annals of the European Academy of Sciences 1 (). , 2005
PUB
 
[177]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1606261
On shadows of intersecting families
Ahlswede, Rudolf, On shadows of intersecting families. Combinatorica 24 (4). , 2004
PUB | DOI | WoS
 
[176]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1608584
Bohman's conjecture related to a sum packing problem of Erdos
Ahlswede, Rudolf, Bohman's conjecture related to a sum packing problem of Erdos. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY 132 (05). , 2004
PUB | DOI | WoS
 
[175]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1607764
On lossless quantum data compression with a classical helper
Ahlswede, Rudolf, On lossless quantum data compression with a classical helper. IEEE TRANSACTIONS ON INFORMATION THEORY 50 (6). , 2004
PUB | DOI | WoS
 
[174]
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605457
On the density of primitive sets
Ahlswede, Rudolf, On the density of primitive sets. JOURNAL OF NUMBER THEORY 109 (2). , 2004
PUB | DOI | WoS
 
[173]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611107
More about shifting techniques
Ahlswede, Rudolf, More about shifting techniques. European Journal of Combinatorics 24 (5). , 2003
PUB | DOI | WoS
 
[172]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1610768
Maximum number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace
Ahlswede, Rudolf, Maximum number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace. 23 (1). , 2003
PUB | DOI | WoS
 
[171]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609595
Maximal antichains under dimension constraints
Ahlswede, Rudolf, Maximal antichains under dimension constraints. 273 (1-3). , 2003
PUB | DOI | WoS
 
[170]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609590
Extremal problems under dimension constraints
Ahlswede, Rudolf, Extremal problems under dimension constraints. 273 (1-3). , 2003
PUB | DOI | WoS
 
[169]
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1611224
Cone dependence - A basic combinatorial concept
Ahlswede, Rudolf, Cone dependence - A basic combinatorial concept. 29 (1-3). , 2003
PUB | DOI | WoS
 
[168]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611220
Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case
Ahlswede, Rudolf, Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography 29 (1-3). , 2003
PUB | DOI | WoS
 
[167]
2003 | Zeitschriftenaufsatz | PUB-ID: 1882110
Addendum to: "Strong converse for identification via quantum channels"
Winter, Andreas, Addendum to: "Strong converse for identification via quantum channels". IEEE Trans. Inform. Theory 49 (1). , 2003
PUB
 
[166]
2003 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1878790
On lossless quantum data compression and quantum variable-length codes
Ahlswede, Rudolf, On lossless quantum data compression and quantum variable-length codes. Quantum Information Processing (). Weinheim, 2003
PUB
 
[165]
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913390
A complexity measure for families of binary sequences
Ahlswede, Rudolf, A complexity measure for families of binary sequences. Periodica Mathematica Hungarica 46 (2). , 2003
PUB
 
[164]
2003 | Zeitschriftenaufsatz | PUB-ID: 1913395
Large deviations in quantum information theory
Ahlswede, Rudolf, Large deviations in quantum information theory. Problems of Information Transmission 39 (4). , 2003
PUB
 
[163]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614890
Parallel error correcting codes
Ahlswede, Rudolf, Parallel error correcting codes. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (4). , 2002
PUB | DOI | WoS
 
[162]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614063
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback
Ahlswede, Rudolf, Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (8). , 2002
PUB | DOI | WoS
 
[161]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1613448
The t-intersection problem in the truncated boolean lattice
Ahlswede, Rudolf, The t-intersection problem in the truncated boolean lattice. EUROPEAN JOURNAL OF COMBINATORICS 23 (5). , 2002
PUB | DOI | WoS
 
[160]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1878792
Unidirectional error control codes and related combinatorial problems
Ahlswede, Rudolf, Unidirectional error control codes and related combinatorial problems. Proceedings of Eight International Workshop on Algebraic and Combinatorial Coding Theory 2002 (). , 2002
PUB
 
[159]
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1615280
Strong converse for identification via quantum channels
Ahlswede, Rudolf, Strong converse for identification via quantum channels. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (3). , 2002
PUB | DOI | WoS
 
[158]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883908
On perfect codes and related concepts
Ahlswede, Rudolf, On perfect codes and related concepts. Designs, Codes and Cryptography 22 (3). , 2001
PUB | DOI | WoS
 
[157]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883911
On primitive sets of squarefree integers
Ahlswede, Rudolf, On primitive sets of squarefree integers. Periodica Mathematica Hungarica 42 (1). , 2001
PUB | DOI
 
[156]
2001 | Sammelwerksbeitrag | PUB-ID: 1883914
Advances on extremal problems in number theory and combinatorics
Ahlswede, Rudolf, Advances on extremal problems in number theory and combinatorics. European Congress of Mathematics : Barcelona, July 10 - 14, 2000 201 (). Basel, 2001
PUB
 
[155]
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1617846
Quantum data processing
Ahlswede, Rudolf, Quantum data processing. 47 (1). , 2001
PUB | DOI | WoS
 
[154]
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973
An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection
Ahlswede, Rudolf, An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection. Problems of Information Transmission 37 (4). , 2001
PUB | DOI
 
[153]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883897
On prefix-free and suffix-free sequences of integers
Ahlswede, Rudolf, On prefix-free and suffix-free sequences of integers. Numbers, Information and Complexity (). Boston, 2000
PUB
 
[152]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883900
The AVC with noiseless feedback
Ahlswede, Rudolf, The AVC with noiseless feedback. Numbers, Information and Complexity (). Boston, 2000
PUB
 
[151]
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1618855
A diametric theorem for edges
Ahlswede, Rudolf, A diametric theorem for edges. JOURNAL OF COMBINATORIAL THEORY SERIES A 92 (1). , 2000
PUB | WoS
 
[150]
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883895
Splitting properties in partially ordered sets and set systems
Ahlswede, Rudolf, Splitting properties in partially ordered sets and set systems. Numbers, Information and Complexity (). Boston, 2000
PUB
 
[149]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1619489
Network information flow
Ahlswede, Rudolf, Network information flow. 46 (4). , 2000
PUB | DOI | WoS
 
[148]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1620439
On the quotient sequence of sequences of integers
Ahlswede, Rudolf, On the quotient sequence of sequences of integers. Acta Arithmetica 91 (2). , 1999
PUB | WoS
 
[147]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621019
On the counting function of primitive sets of integers
Ahlswede, Rudolf, On the counting function of primitive sets of integers. Journal of Number Theory 79 (2). , 1999
PUB | DOI | WoS
 
[146]
1999 | Zeitschriftenaufsatz | PUB-ID: 1883870
Construction of uniquely decodable codes for the two-user binary adder channel
Ahlswede, Rudolf, Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory 45 (1). , 1999
PUB | DOI | WoS
 
[145]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623402
Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is true
Ahlswede, Rudolf, Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is true. IEEE Transactions on Information Theory 45 (2). , 1999
PUB | DOI | WoS
 
[144]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621975
A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problem
Ahlswede, Rudolf, A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problem. Combinatorics, Probability and Computing 8 (4). , 1999
PUB | DOI | WoS
 
[143]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883892
On the Hamming bound for nonbinary localized-error-correcting codes
Bassalygo, Leonid, On the Hamming bound for nonbinary localized-error-correcting codes. Probl. of Inf. Transmission 35 (2). , 1999
PUB
 
[142]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621563
Identification without randomization
Ahlswede, Rudolf, Identification without randomization. IEEE Transactions on Information Theory 45 (7). , 1999
PUB | DOI | WoS
 
[141]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623405
Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission
Ahlswede, Rudolf, Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmission. IEEE Transactions on Information Theory 45 (2). , 1999
PUB | DOI | WoS
 
[140]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1622320
On maximal shadows of members in left-compressed sets
Ahlswede, Rudolf, On maximal shadows of members in left-compressed sets. Discrete Applied Mathematics 95 (1-3). , 1999
PUB | DOI | WoS
 
[139]
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883876
A pushing-pulling method: new proofs of intersection theorems
Ahlswede, Rudolf, A pushing-pulling method: new proofs of intersection theorems. Combinatorica 19 (1). , 1999
PUB | DOI | WoS
 
[138]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913368
Asymptotical isoperimetric problem
Ahlswede, Rudolf, Asymptotical isoperimetric problem. (). , 1999
PUB
 
[137]
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913370
Nonstandard coding method for nonbinary codes correcting localized errors
Ahlswede, Rudolf, Nonstandard coding method for nonbinary codes correcting localized errors. (). , 1999
PUB
 
[136]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625316
Code pairs with specified parity of the Hamming distances
Ahlswede, Rudolf, Code pairs with specified parity of the Hamming distances. DISCRETE MATHEMATICS 188 (1-3). , 1998
PUB | DOI | WoS
 
[135]
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1626601
Common randomness in information theory and cryptography - Part II: CR capacity
Ahlswede, Rudolf, Common randomness in information theory and cryptography - Part II: CR capacity. 44 (1). , 1998
PUB | DOI | WoS
 
[134]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1626351
Information and control: Matching channels
Ahlswede, Rudolf, Information and control: Matching channels. IEEE TRANSACTIONS ON INFORMATION THEORY 44 (2). , 1998
PUB | DOI | WoS
 
[133]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624985
Isoperimetric theorems in the binary sequences of finite lengths
Ahlswede, Rudolf, Isoperimetric theorems in the binary sequences of finite lengths. APPLIED MATHEMATICS LETTERS 11 (5). , 1998
PUB | DOI | WoS
 
[132]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625787
The diametric theorem in Hamming spaces - Optimal anticodes
Ahlswede, Rudolf, The diametric theorem in Hamming spaces - Optimal anticodes. ADVANCES IN APPLIED MATHEMATICS 20 (4). , 1998
PUB | DOI | WoS
 
[131]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625772
Zero-error capacity for models with memory and the enlightened dictator channel
Ahlswede, Rudolf, Zero-error capacity for models with memory and the enlightened dictator channel. IEEE TRANSACTIONS ON INFORMATION THEORY 44 (3). , 1998
PUB | DOI | WoS
 
[130]
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624907
The intersection theorem for direct products
Ahlswede, Rudolf, The intersection theorem for direct products. European Journal of Combinatorics 19 (6). , 1998
PUB | DOI | WoS
 
[129]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627492
Shadows and isoperimetry under the sequence-subsequence relation
Ahlswede, Rudolf, Shadows and isoperimetry under the sequence-subsequence relation. Combinatorica 17 (1). , 1997
PUB | DOI | WoS
 
[128]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636801
Correlated sources help transmission over an arbitrarily varying channel
Ahlswede, Rudolf, Correlated sources help transmission over an arbitrarily varying channel. IEEE TRANSACTIONS ON INFORMATION THEORY 43 (4). , 1997
PUB | DOI | WoS
 
[127]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627477
Counterexample to the Frankl-Pach conjecture for uniform, dense families
Ahlswede, Rudolf, Counterexample to the Frankl-Pach conjecture for uniform, dense families. COMBINATORICA 17 (2). , 1997
PUB | DOI | WoS
 
[126]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637377
Edge-isoperimetric inequalities .1. Information-theoretical methods
Ahlswede, Rudolf, Edge-isoperimetric inequalities .1. Information-theoretical methods. EUROPEAN JOURNAL OF COMBINATORICS 18 (4). , 1997
PUB | DOI | WoS
 
[125]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636745
General edge-isoperimetric inequalities .2. A local-global principle for lexicographical solutions
Ahlswede, Rudolf, General edge-isoperimetric inequalities .2. A local-global principle for lexicographical solutions. EUROPEAN JOURNAL OF COMBINATORICS 18 (5). , 1997
PUB | DOI | WoS
 
[124]
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628236
Identification via compressed data
Ahlswede, Rudolf, Identification via compressed data. 43 (1). , 1997
PUB | DOI | WoS
 
[123]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636775
Models of multi-user write-efficient memories and general diametric theorems
Ahlswede, Rudolf, Models of multi-user write-efficient memories and general diametric theorems. INFORMATION AND COMPUTATION 135 (1). , 1997
PUB | DOI | WoS
 
[122]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637712
Number theoretic correlation inequalities for Dirichlet densities
Ahlswede, Rudolf, Number theoretic correlation inequalities for Dirichlet densities. JOURNAL OF NUMBER THEORY 63 (1). , 1997
PUB | DOI | WoS
 
[121]
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628232
On interactive communication
Ahlswede, Rudolf, On interactive communication. 43 (1). , 1997
PUB | DOI | WoS
 
[120]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637812
The complete intersection theorem for systems of finite sets
Ahlswede, Rudolf, The complete intersection theorem for systems of finite sets. EUROPEAN JOURNAL OF COMBINATORICS 18 (2). , 1997
PUB | DOI | WoS
 
[119]
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637805
Universal coding of integers and unbounded search trees
Ahlswede, Rudolf, Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY 43 (2). , 1997
PUB | DOI | WoS
 
[118]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628669
A counterexample to Aharoni's strongly maximal matching conjecture
Ahlswede, Rudolf, A counterexample to Aharoni's strongly maximal matching conjecture. DISCRETE MATHEMATICS 149 (1-3). , 1996
PUB | DOI | WoS
 
[117]
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913322
Cross-disjoint pairs of clouds in the interval lattice
Ahlswede, Rudolf, Cross-disjoint pairs of clouds in the interval lattice. The Mathematics of Paul Erdos, Vol. I (). Berlin/Heidelberg/New York, 1996
PUB
 
[116]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628906
Erasure, list, and detection zero-error capacities for low noise and a relation to identification
Ahlswede, Rudolf, Erasure, list, and detection zero-error capacities for low noise and a relation to identification. IEEE TRANSACTIONS ON INFORMATION THEORY 42 (1). , 1996
PUB | DOI | WoS
 
[115]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638929
Fault-tolerant minimum broadcast networks
Ahlswede, Rudolf, Fault-tolerant minimum broadcast networks. NETWORKS 27 (4). , 1996
PUB | DOI | WoS
 
[114]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638192
Incomparability and intersection properties of Boolean interval lattices and chain posets
Ahlswede, Rudolf, Incomparability and intersection properties of Boolean interval lattices and chain posets. EUROPEAN JOURNAL OF COMBINATORICS 17 (8). , 1996
PUB | DOI | WoS
 
[113]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639105
Optimal pairs of incomparable clouds in multisets
Ahlswede, Rudolf, Optimal pairs of incomparable clouds in multisets. GRAPHS AND COMBINATORICS 12 (1). , 1996
PUB | DOI | WoS
 
[112]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639674
Sets of integers and quasi-integers with pairwise common divisor
Ahlswede, Rudolf, Sets of integers and quasi-integers with pairwise common divisor. ACTA ARITHMETICA 74 (2). , 1996
PUB | WoS
 
[111]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639022
Sets of integers with pairwise common divisor and a factor from a specified set of primes
Ahlswede, Rudolf, Sets of integers with pairwise common divisor and a factor from a specified set of primes. ACTA ARITHMETICA 75 (3). , 1996
PUB | WoS
 
[110]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638542
The complete nontrivial-intersection theorem for systems of finite sets
Ahlswede, Rudolf, The complete nontrivial-intersection theorem for systems of finite sets. JOURNAL OF COMBINATORIAL THEORY SERIES A 76 (1). , 1996
PUB | DOI | WoS
 
[109]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913328
Identification under random processes
Ahlswede, Rudolf, Identification under random processes. Problems of Information Transmission 32 (1). , 1996
PUB
 
[108]
1996 | Preprint | Veröffentlicht | PUB-ID: 1913331
Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching
Ahlswede, Rudolf, Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching. Ergänzungsreihe des SFB 343 ``Diskrete Strukturen in der Mathematik'' 95-004 (). , 1996
PUB
 
[107]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913343
Intersecting Systems
Ahlswede, Rudolf, Intersecting Systems. Combinatorics, Probability and Computing 6 (). , 1996
PUB
 
[106]
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913355
Higher level extremal problems
Ahlswede, Rudolf, Higher level extremal problems. Comb. Inf. & Syst. Sc. 21 (3-4). , 1996
PUB
 
[105]
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913333
Classical results on primitive and recent results on cross-primitive sequences
Ahlswede, Rudolf, Classical results on primitive and recent results on cross-primitive sequences. The Mathematics of Paul Erdos, Vol. I I (). Berlin/Heidelberg/New York, 1996
PUB
 
[104]
1996 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913352
Some properties of fix-free codes
Ahlswede, Rudolf, Some properties of fix-free codes. (). Thahkadzor, Armenia, 1996
PUB
 
[103]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1629125
Density inequalities for sets of multiples
Ahlswede, Rudolf, Density inequalities for sets of multiples. JOURNAL OF NUMBER THEORY 55 (2). , 1995
PUB | DOI | WoS
 
[102]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913242
New directions in the theory of identification via channels
Ahlswede, Rudolf, New directions in the theory of identification via channels. IEEE Trans. Inf. Theory 41 (4). , 1995
PUB | DOI | WoS
 
[101]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913254
Maximal sets of numbers not containing k+1 pairwise coprime integers
Ahlswede, Rudolf, Maximal sets of numbers not containing k+1 pairwise coprime integers. Acta Arithmetica 72 (1). , 1995
PUB | WoS
 
[100]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913278
A splitting property of maximal antichains
Ahlswede, Rudolf, A splitting property of maximal antichains. Combinatorica 15 (4). , 1995
PUB | DOI | WoS
 
[99]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780563
Asymptotically optimal binary codes of polynomial complexity correcting localized errors
Ahlswede, Rudolf, Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf. 31 (2). , 1995
PUB | PDF
 
[98]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1641640
Localized random and arbitrary errors in the light of AV channel theory
Ahlswede, Rudolf, Localized random and arbitrary errors in the light of AV channel theory. IEEE Transactions on Information Theory 41 (1). , 1995
PUB | DOI | WoS
 
[97]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913236
Edge isoperimetric theorems for integer point arrays
Ahlswede, Rudolf, Edge isoperimetric theorems for integer point arrays. Applied Mathematics Letters 8 (2). , 1995
PUB | DOI | WoS
 
[96]
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913248
Towards characterising equality in correlation inequalities
Ahlswede, Rudolf, Towards characterising equality in correlation inequalities. European J. of Combinatorics 16 (). , 1995
PUB | DOI | WoS
 
[95]
1994 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780546
Messy broadcasting in networks
Ahlswede, Rudolf, Messy broadcasting in networks. Communications and cryptography: two sides of one tapestry 276 (). Boston [u.a.], 1994
PUB | PDF
 
[94]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774967
On extremal sets without coprimes
Ahlswede, Rudolf, On extremal sets without coprimes. Acta Arithmetica 66 (1). , 1994
PUB | PDF | DOI | WoS
 
[93]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780530
The maximal length of cloud-antichains
Ahlswede, Rudolf, The maximal length of cloud-antichains. Discrete Mathematics 131 (1-3). , 1994
PUB | PDF | DOI | WoS
 
[92]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781092
A new direction in extremal theory
Ahlswede, Rudolf, A new direction in extremal theory. Journal of combinatorics, information and system sciences 19 (3). , 1994
PUB | PDF
 
[91]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780544
Two-way communication complexity of sum-type functions for one processor to be informed
Ahlswede, Rudolf, Two-way communication complexity of sum-type functions for one processor to be informed. Problems of information transmission 30 (1). , 1994
PUB | PDF
 
[90]
1994 | Preprint | Veröffentlicht | PUB-ID: 1780556
On sets of words with pairwise common letter in different positions
Ahlswede, Rudolf, On sets of words with pairwise common letter in different positions. (). , 1994
PUB | PDF
 
[89]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780560
On partitioning and packing products with rectangles
Ahlswede, Rudolf, On partitioning and packing products with rectangles. Combinatorics, Probability & Computing 3 (04). , 1994
PUB | PDF | DOI
 
[88]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780527
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture
Ahlswede, Rudolf, On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics 128 (1-3). , 1994
PUB | PDF | DOI | WoS
 
[87]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780541
The asymptotic behavior of diameters in the average
Ahlswede, Rudolf, The asymptotic behavior of diameters in the average. Journal of Combinatorial Theory, Series B 61 (2). , 1994
PUB | PDF | DOI | WoS
 
[86]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780553
Binary constant-weight codes correcting localized errors and defects
Ahlswede, Rudolf, Binary constant-weight codes correcting localized errors and defects. Problems of information transmission 30 (2). , 1994
PUB | PDF
 
[85]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780497
On communication complexity of vector-valued functions
Ahlswede, Rudolf, On communication complexity of vector-valued functions. IEEE transactions on information theory 40 (6). , 1994
PUB | PDF | DOI | WoS
 
[84]
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780494
On multiuser write-efficient memories
Ahlswede, Rudolf, On multiuser write-efficient memories. IEEE transactions on information theory 40 (3). , 1994
PUB | PDF | DOI | WoS
 
[83]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774963
Rank formulas for certain products of matrices
Ahlswede, Rudolf, Rank formulas for certain products of matrices. Applicable Algebra in Engineering, Communication and Computing 4 (4). , 1993
PUB | PDF | DOI | WoS
 
[82]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780491
Common randomness in information theory and cryptography. Part I: secret sharing
Ahlswede, Rudolf, Common randomness in information theory and cryptography. Part I: secret sharing. IEEE transactions on information theory 39 (4). , 1993
PUB | PDF | DOI | WoS
 
[81]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780525
On extremal set partitions in Cartesian product spaces
Ahlswede, Rudolf, On extremal set partitions in Cartesian product spaces. Combinatorics, Probability & Computing 2 (2). , 1993
PUB | PDF
 
[80]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780515
Partitioning the n-cube into sets with mutual distance 1
Blokhuis, A., Partitioning the n-cube into sets with mutual distance 1. Applied Mathematics Letters 6 (4). , 1993
PUB | PDF | DOI | WoS
 
[79]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774960
A generalization of the AZ identity
Ahlswede, Rudolf, A generalization of the AZ identity. Combinatorica 13 (3). , 1993
PUB | PDF | DOI | WoS
 
[78]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780485
The maximal error capacity of arbitrarily varying channels for constant list sizes
Ahlswede, Rudolf, The maximal error capacity of arbitrarily varying channels for constant list sizes. IEEE transactions on information theory 39 (4). , 1993
PUB | PDF | DOI | WoS
 
[77]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780512
Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]
Ahlswede, Rudolf, Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]. Comptes rendus de l' Académie bulgare des Sciences 46 (1). , 1993
PUB | PDF
 
[76]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780487
Nonbinary codes correcting localized errors
Ahlswede, Rudolf, Nonbinary codes correcting localized errors. IEEE transactions on information theory 39 (4). , 1993
PUB | PDF | DOI | WoS
 
[75]
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780521
Communication complexity in lattices
Ahlswede, Rudolf, Communication complexity in lattices. Applied Mathematics Letters 6 (6). , 1993
PUB | PDF | DOI | WoS
 
[74]
1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780509
Rich colorings with local constraints
Ahlswede, Rudolf, Rich colorings with local constraints. Journal of combinatorics, information & system sciences 17 (3). , 1992
PUB | PDF
 
[73]
1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774877
Diametric theorems in sequence spaces
Ahlswede, Rudolf, Diametric theorems in sequence spaces. Combinatorica 12 (1). , 1992
PUB | PDF | DOI | WoS
 
[72]
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780477
Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory
Ahlswede, Rudolf, Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory. IEEE transactions on information theory 37 (4). , 1991
PUB | PDF | DOI | WoS
 
[71]
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780480
On identification via multiway channels with feedback
Ahlswede, Rudolf, On identification via multiway channels with feedback. IEEE transactions on information theory 37 (5). , 1991
PUB | PDF | DOI | WoS
 
[70]
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780482
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
Ahlswede, Rudolf, Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. IEEE transactions on information theory 37 (6). , 1991
PUB | PDF | DOI | WoS
 
[69]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775120
On cloud-antichains and related configurations
Ahlswede, Rudolf, On cloud-antichains and related configurations. Discrete Mathematics 85 (3). , 1990
PUB | PDF | DOI | WoS
 
[68]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781090
On minimax estimation in the presence of side information about remote data
Ahlswede, Rudolf, On minimax estimation in the presence of side information about remote data. The annals of statistics 18 (1). , 1990
PUB | PDF | DOI | WoS
 
[67]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775117
Creating order in sequence spaces with simple machines
Ahlswede, Rudolf, Creating order in sequence spaces with simple machines. Information and Computation 89 (1). , 1990
PUB | PDF | DOI | WoS
 
[66]
1990 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780506
A recursive bound for the number of complete K-subgraphs of a graph
Ahlswede, Rudolf, A recursive bound for the number of complete K-subgraphs of a graph. Topics in combinatorics and graph theory: essays in honour of Gerhard Ringel (). Heidelberg, 1990
PUB | PDF
 
[65]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780503
An identity in combinatorial extremal theory
Ahlswede, Rudolf, An identity in combinatorial extremal theory. Advances in Mathematics 80 (2). , 1990
PUB | PDF | DOI | WoS
 
[64]
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780475
Extremal properties of rate distortion functions
Ahlswede, Rudolf, Extremal properties of rate distortion functions. IEEE transactions on information theory 36 (1). , 1990
PUB | PDF | DOI | WoS
 
[63]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775113
Contributions to a theory of ordering for sequence spaces
Ahlswede, Rudolf, Contributions to a theory of ordering for sequence spaces. Problems of Control and Information Theory 18 (4). , 1989
PUB | PDF | WoS
 
[62]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780472
Identification in the presence of feedback: a discovery of new capacity formulas
Ahlswede, Rudolf, Identification in the presence of feedback: a discovery of new capacity formulas. IEEE transactions on information theory 35 (1). , 1989
PUB | PDF | DOI | WoS
 
[61]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780469
Identification via channels
Ahlswede, Rudolf, Identification via channels. IEEE transactions on information theory 35 (1). , 1989
PUB | PDF | DOI | WoS
 
[60]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775115
Coding for write-efficient memory
Ahlswede, Rudolf, Coding for write-efficient memory. Information and Computation 83 (1). , 1989
PUB | PDF | DOI | WoS
 
[59]
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780500
A general 4-words inequality with consequences for 2-way communication complexity
Ahlswede, Rudolf, A general 4-words inequality with consequences for 2-way communication complexity. Advances in Applied Mathematics 10 (1). , 1989
PUB | PDF | DOI | WoS
 
[58]
1988 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775111
Inequalities for code pairs
Ahlswede, Rudolf, Inequalities for code pairs. European Journal of Combinatorics 9 (). , 1988
PUB | PDF | DOI | WoS
 
[57]
1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780468
On code pairs with specified Hamming distances
Ahlswede, Rudolf, On code pairs with specified Hamming distances. Combinatorics 52 (). Amsterdam [u.a.], 1987
PUB | PDF
 
[56]
1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780605
Eight problems in information theory
Ahlswede, Rudolf, Eight problems in information theory. Open problems in communication and computation (). New York [u.a.], 1987
PUB | PDF
 
[55]
1987 | Monographie | Veröffentlicht | PUB-ID: 1913125
Search Problems
Ahlswede, Rudolf, Search Problems. (). , 1987
PUB
 
[54]
1987 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780452
Optimal coding strategies for certain permuting channels
Ahlswede, Rudolf, Optimal coding strategies for certain permuting channels. IEEE transactions on information theory 33 (3). , 1987
PUB | PDF | DOI | WoS
 
[53]
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780427
Hypothesis testing with communication constraints
Ahlswede, Rudolf, Hypothesis testing with communication constraints. IEEE transactions on information theory 32 (4). , 1986
PUB | PDF | DOI | WoS
 
[52]
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780441
Arbitrarily varying channels with states sequence known to the sender
Ahlswede, Rudolf, Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory 32 (5). , 1986
PUB | PDF | DOI | WoS
 
[51]
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780429
On multiple descriptions and team guessing
Ahlswede, Rudolf, On multiple descriptions and team guessing. IEEE transactions on information theory 32 (4). , 1986
PUB | PDF | DOI | WoS
 
[50]
1985 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780426
The rate-distortion region for multiple descriptions without excess rate
Ahlswede, Rudolf, The rate-distortion region for multiple descriptions without excess rate. IEEE transactions on information theory 31 (6). , 1985
PUB | PDF | DOI | WoS
 
[49]
1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775096
A two-family extremal problem in hamming space
Ahlswede, Rudolf, A two-family extremal problem in hamming space. Discrete Mathematics 49 (1). , 1984
PUB | PDF | DOI | WoS
 
[48]
1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780416
Improvements of Winograd's result on computation in the presence of noise
Ahlswede, Rudolf, Improvements of Winograd's result on computation in the presence of noise. IEEE transactions on information theory 30 (6). , 1984
PUB | PDF | DOI | WoS
 
[47]
1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775100
Note on an extremal problem arising for unreliable networks in parallel computing
Ahlswede, Rudolf, Note on an extremal problem arising for unreliable networks in parallel computing. Discrete Mathematics 47 (). , 1983
PUB | PDF | DOI | WoS
 
[46]
1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780414
On source coding with side information via a multiple-access channel and related problems in multi-user information theory
Ahlswede, Rudolf, On source coding with side information via a multiple-access channel and related problems in multi-user information theory. IEEE transactions on information theory 29 (3). , 1983
PUB | PDF | DOI | WoS
 
[45]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913152
An elementary proof of the strong converse theorem for the multiple-access channel
Ahlswede, Rudolf, An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences 7 (3). , 1982
PUB | PDF
 
[44]
1982 | Monographie | Veröffentlicht | PUB-ID: 1913139
Zadaci poiska
Ahlswede, Rudolf, Zadaci poiska. (). Moskau, 1982
PUB
 
[43]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775489
Remarks on Shannon's secrecy systems
Ahlswede, Rudolf, Remarks on Shannon's secrecy systems. Problems of Control and Information Theory 11 (4). , 1982
PUB | PDF
 
[42]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775509
Bad codes are good ciphers
Ahlswede, Rudolf, Bad codes are good ciphers. Problems of Control and Information Theory 11 (5). , 1982
PUB | PDF
 
[41]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780388
Jacob Wolfowitz (1910-1981)
Ahlswede, Rudolf, Jacob Wolfowitz (1910-1981). IEEE transactions on information theory 28 (5). , 1982
PUB | PDF
 
[40]
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1776125
Good codes can be produced by a few permutations
Ahlswede, Rudolf, Good codes can be produced by a few permutations. IEEE transactions on information theory 28 (3). , 1982
PUB | PDF | DOI | WoS
 
[39]
1981 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775487
To get a bit of information may be as hard as to get full information
Ahlswede, Rudolf, To get a bit of information may be as hard as to get full information. IEEE transactions on information theory 27 (4). , 1981
PUB | PDF | DOI | WoS
 
[38]
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780400
Simple hypergraphs with maximal number of adjacent pairs of edges
Ahlswede, Rudolf, Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B 28 (2). , 1980
PUB | PDF | DOI | WoS
 
[37]
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775420
Coloring hypergraphs: A new approach to multi-user source coding, 2
Ahlswede, Rudolf, Coloring hypergraphs: A new approach to multi-user source coding, 2. Journal of combinatorics, information & system sciences 5 (3). , 1980
PUB | PDF
 
[36]
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775486
A method of coding and its application to arbitrarily varying channels
Ahlswede, Rudolf, A method of coding and its application to arbitrarily varying channels. Journal of combinatorics, information and system sciences 5 (1). , 1980
PUB | PDF
 
[35]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774874
Inequalities for a pair of maps S x S -> S with S a finite set
Ahlswede, Rudolf, Inequalities for a pair of maps S x S -> S with S a finite set. Mathematische Zeitschrift 165 (3). , 1979
PUB | PDF | DOI | WoS
 
[34]
1979 | Monographie | Veröffentlicht | PUB-ID: 1913120
Suchprobleme
Ahlswede, Rudolf, Suchprobleme. (). , 1979
PUB
 
[33]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780382
The number of values of combinatorial functions
Ahlswede, Rudolf, The number of values of combinatorial functions. Bulletin of the London Mathematical Society 11 (1). , 1979
PUB | PDF | DOI
 
[32]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775419
Coloring hypergraphs: A new approach to multi-user source coding, 1
Ahlswede, Rudolf, Coloring hypergraphs: A new approach to multi-user source coding, 1. Journal of combinatorics, information & system sciences 4 (1). , 1979
PUB | PDF
 
[31]
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780389
Integral inequalities for increasing functions
Ahlswede, Rudolf, Integral inequalities for increasing functions. Mathematical Proceedings of the Cambridge Philosophical Society 86 (03). , 1979
PUB | PDF | DOI | WoS
 
[30]
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774867
Elimination of correlation in random codes for arbitrarily varying channels
Ahlswede, Rudolf, Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 44 (2). , 1978
PUB | PDF | DOI | WoS
 
[29]
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780385
Graphs with maximal number of adjacent pairs of edges
Ahlswede, Rudolf, Graphs with maximal number of adjacent pairs of edges. Acta mathematica Academiae Scientiarum Hungaricae 32 (1-2). , 1978
PUB | PDF | DOI | WoS
 
[28]
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774869
An inequality for the weights of two families of sets, their unions and intersections
Ahlswede, Rudolf, An inequality for the weights of two families of sets, their unions and intersections. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 43 (3). , 1978
PUB | PDF | DOI | WoS
 
[27]
1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775092
Contributions to the geometry of hamming spaces
Ahlswede, Rudolf, Contributions to the geometry of hamming spaces. Discrete Mathematics 17 (1). , 1977
PUB | PDF | DOI | WoS
 
[26]
1977 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780380
On the connection between the entropies of input and output distributions of discrete memoryless channels
Ahlswede, Rudolf, On the connection between the entropies of input and output distributions of discrete memoryless channels. Proceedings of the fifth Conference on Probability Theory (). Bucuresti, 1977
PUB | PDF
 
[25]
1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774860
Correction to: Bounds on conditional probabilities with applications
Ahlswede, Rudolf, Correction to: Bounds on conditional probabilities with applications. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 39 (4). , 1977
PUB | PDF | DOI | WoS
 
[24]
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781088
Spreading of sets in product spaces and hypercontraction of the Markov operator
Ahlswede, Rudolf, Spreading of sets in product spaces and hypercontraction of the Markov operator. The annals of probability 4 (6). , 1976
PUB | PDF
 
[23]
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774864
Every bad code has a good subcode: a local converse to the coding theorem
Ahlswede, Rudolf, Every bad code has a good subcode: a local converse to the coding theorem. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 34 (2). , 1976
PUB | PDF | DOI | WoS
 
[22]
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774856
Bounds on conditional probabilities with applications in multi-user communication
Ahlswede, Rudolf, Bounds on conditional probabilities with applications in multi-user communication. 34 (2). , 1976
PUB | PDF | DOI | WoS
 
[21]
1975 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775417
Two contributions to information theory
Ahlswede, Rudolf, Two contributions to information theory. Topics in information theory 16 (). Amsterdam, 1975
PUB | PDF
 
[20]
1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775415
Source encoding with side information and a converse for degraded broadcast channels
Ahlswede, Rudolf, Source encoding with side information and a converse for degraded broadcast channels. IEEE transactions on information theory IT-21 (6). , 1975
PUB | PDF
 
[19]
1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775089
Approximation o continuous functions in p-Adic Analysis
Ahlswede, Rudolf, Approximation o continuous functions in p-Adic Analysis. Journal of Approximation Theory 15 (3). , 1975
PUB | PDF | DOI | WoS
 
[18]
1974 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781087
The capacity region of a channel with two senders and two receivers
Ahlswede, Rudolf, The capacity region of a channel with two senders and two receivers. The annals of probability 2 (5). , 1974
PUB | PDF
 
[17]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780371
Multi-way communication channels
Ahlswede, Rudolf, Multi-way communication channels. Second International Symposium on Information Theory: Tsahkadsor, Armenia, USSR, Sept. 2 - 8, 1971 (). Budapest, 1973
PUB | PDF
 
[16]
1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774854
Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
Ahlswede, Rudolf, Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 25 (3). , 1973
PUB | PDF | DOI | WoS
 
[15]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780373
A constructive proof of the coding theorem for discrete memoryless channels with feedback
Ahlswede, Rudolf, A constructive proof of the coding theorem for discrete memoryless channels with feedback. Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971 (). München, 1973
PUB | PDF
 
[14]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780372
On two-way communication channels and a problem by Zarankiewicz
Ahlswede, Rudolf, On two-way communication channels and a problem by Zarankiewicz. Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971 (). München, 1973
PUB | PDF
 
[13]
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780374
The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions
Ahlswede, Rudolf, The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions. Transactions of the Sixth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes: held at Prague, from September 19 to 25, 1971 (). München, 1973
PUB | PDF
 
[12]
1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781086
Channel capacities for list codes
Ahlswede, Rudolf, Channel capacities for list codes. Journal of applied probability 10 (). , 1973
PUB | PDF
 
[11]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775343
Channels without synchronization
Ahlswede, Rudolf, Channels without synchronization. Advances in applied probability 3 (2). , 1971
PUB | PDF
 
[10]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775381
Bounds on algebraic code capacities for noisy channels. II
Ahlswede, Rudolf, Bounds on algebraic code capacities for noisy channels. II. Information and Control 19 (2). , 1971
PUB | PDF | DOI | WoS
 
[9]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774872
Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels
Ahlswede, Rudolf, Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels. The Annals of Mathematical Statistics 42 (1). , 1971
PUB | PDF | DOI | WoS
 
[8]
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775378
Bounds on algebraic code capacities for noisy channels. I
Ahlswede, Rudolf, Bounds on algebraic code capacities for noisy channels. I. Information and Control 18 (2). , 1971
PUB | PDF | DOI | WoS
 
[7]
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781084
A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacity
Ahlswede, Rudolf, A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacity. The annals of mathematical statistics 41 (3). , 1970
PUB | PDF
 
[6]
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774851
The capacity of a channel with arbitrarily varying channel probability functions and binary output
Ahlswede, Rudolf, The capacity of a channel with arbitrarily varying channel probability functions and binary output. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 15 (3). , 1970
PUB | PDF | DOI | WoS
 
[5]
1969 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775340
Correlated decoding for channels with arbitrarily varying channel probability functions
Ahlswede, Rudolf, Correlated decoding for channels with arbitrarily varying channel probability functions. Information and Control 14 (5). , 1969
PUB | PDF | DOI | WoS
 
[4]
1969 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775145
The structure of capacity functions for compound channels
Ahlswede, Rudolf, The structure of capacity functions for compound channels. Probability and information theory vol. 1: Proceedings of the international symposium at McMaster University, Canada, April 1968 (). Berlin, 1969
PUB | PDF
 
[3]
1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774842
The weak capacity of averaged channels
Ahlswede, Rudolf, The weak capacity of averaged channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 11 (1). , 1968
PUB | PDF | DOI | WoS
 
[2]
1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774845
Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle
Ahlswede, Rudolf, Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 10 (1). , 1968
PUB | PDF | DOI | WoS
 
[1]
1967 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780342
Certain results in coding theory for compound channels
Ahlswede, Rudolf, Certain results in coding theory for compound channels. Proceedings of the Colloquium on Information Theory (). Budapest, 1967
PUB | PDF
 

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: default

Export / Einbettung