206 Publikationen
-
2013 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2560225Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum ChannelsPUB | DOI | WoS
Ahlswede, Rudolf, Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels. Communications In Mathematical Physics 317 (1). , 2013 -
2013 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656530Threshold and Majority Group TestingPUB | DOI
Ahlswede, Rudolf, Threshold and Majority Group Testing. Information Theory, Combinatorics, and Search Theory 7777 (). Berlin, Heidelberg, 2013 -
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2489365On Generic Erasure Correcting Sets and Related ProblemsPUB | DOI | WoS
Ahlswede, Rudolf, On Generic Erasure Correcting Sets and Related Problems. IEEE Transactions on Information Theory 58 (2). , 2012 -
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2518066Finding one of D defective elements in some group testing modelsPUB | DOI | WoS
Ahlswede, Rudolf, Finding one of D defective elements in some group testing models. Problems of Information Transmission 48 (2). , 2012 -
2009 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1634814Two Batch Search With Lie CostPUB | DOI | WoS
Ahlswede, Rudolf, Two Batch Search With Lie Cost. IEEE TRANSACTIONS ON INFORMATION THEORY 55 (4). , 2009 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636468On diagnosability of large multiprocessor networksPUB | DOI | WoS
Ahlswede, Rudolf, On diagnosability of large multiprocessor networks. Discrete Applied Mathematics 156 (18). , 2008 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592906Error control codes for parallel asymmetric channelsPUB | DOI | WoS
Ahlswede, Rudolf, Error control codes for parallel asymmetric channels. IEEE Transactions on Information Theory 54 (2). , 2008 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587905Multiple packing in sum-type metric spacesPUB | DOI | WoS
Ahlswede, Rudolf, Multiple packing in sum-type metric spaces. DISCRETE APPLIED MATHEMATICS 156 (9). , 2008 -
2008 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1587909On the correlation of binary sequencesPUB | DOI | WoS
Ahlswede, Rudolf, On the correlation of binary sequences. Discrete Applied Mathematics 156 (9). , 2008 -
2008 | Sonderausgabe Zeitschrift | Veröffentlicht | PUB-ID: 2450290General theory of information transfer and combinatoricsPUB
Ahlswede, Rudolf, General theory of information transfer and combinatorics. Discrete applied mathematics 156 (9, Special Issue). , 2008 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1860133T-Shift synchronization codesPUB | DOI | WoS
Ahlswede, Rudolf, T-Shift synchronization codes. Discrete Applied Mathematics 156 (9). , 2008 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587890Ratewise-optimal non-sequential search strategies under constraints on the testsPUB | DOI | WoS
Ahlswede, Rudolf, Ratewise-optimal non-sequential search strategies under constraints on the tests. Discrete Applied Mathematics 156 (9: Special Issue). , 2008 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587881Special issue: General theory of information transfer and combinatorics - PrefacePUB | DOI | WoS
Ahlswede, Rudolf, Special issue: General theory of information transfer and combinatorics - Preface. Discrete Applied Mathematics 156 (9: Special Issue). , 2008 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587893Searching with lies under error cost constraintsPUB | DOI | WoS
Ahlswede, Rudolf, Searching with lies under error cost constraints. Discrete Applied Mathematics 156 (9). , 2008 -
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587887General theory of information transfer: UpdatedPUB | DOI | WoS
Ahlswede, Rudolf, General theory of information transfer: Updated. Discrete Applied Mathematics 156 (9: Special Issue). , 2008 -
2007 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592060The final form of Tao's inequality relating conditional expectation and conditional mutual informationPUB | DOI | WoS
Ahlswede, Rudolf, The final form of Tao's inequality relating conditional expectation and conditional mutual information. ADVANCES IN MATHEMATICS OF COMMUNICATIONS 1 (2). , 2007 -
2007 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1595873Classical capacity of classical-quantum arbitrarily varying channelsPUB | DOI | WoS
Ahlswede, Rudolf, Classical capacity of classical-quantum arbitrarily varying channels. IEEE Transactions on Information Theory 53 (2). , 2007 -
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1599920Intersection theorems under dimension constraintsPUB | DOI | WoS
Ahlswede, Rudolf, Intersection theorems under dimension constraints. Journal of Combinatorial Theory, Series A 113 (3). , 2006 -
2006 | Herausgeber*in Sammelwerk | Veröffentlicht | PUB-ID: 2449061General theory of information transfer and combinatoricsPUB
Ahlswede, Rudolf, General theory of information transfer and combinatorics. 4123 (). Berlin, 2006 -
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597070Construction of asymmetric connectors of depth twoPUB | DOI | WoS
Ahlswede, Rudolf, Construction of asymmetric connectors of depth two. Journal of Combinatorial Theory. Series A 113 (8). , 2006 -
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1598126An interpretation of identification entropyPUB | DOI | WoS
Ahlswede, Rudolf, An interpretation of identification entropy. IEEE TRANSACTIONS ON INFORMATION THEORY 52 (9). , 2006 -
2006 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1597073Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primesPUB | DOI | WoS
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 -
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656516Information Theoretic Models in Language EvolutionPUB | DOI
Ahlswede, Rudolf, Information Theoretic Models in Language Evolution. General Theory of Information Transfer and Combinatorics 4123 (). Berlin, Heidelberg, 2006 -
2006 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 2656503A Fast Suffix-Sorting AlgorithmPUB | DOI
Ahlswede, Rudolf, A Fast Suffix-Sorting Algorithm. General Theory of Information Transfer and Combinatorics 4123 (). Berlin, Heidelberg, 2006 -
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1602477Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted casePUB | DOI | WoS
Ahlswede, Rudolf, Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography 37 (1). , 2005 -
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605326Katona's intersection theorem: Four proofsPUB | WoS
Ahlswede, Rudolf, Katona's intersection theorem: Four proofs. COMBINATORICA 25 (1). , 2005 -
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2308668Searching with lies under error transition cost constraintsPUB | DOI
Ahlswede, Rudolf, Searching with lies under error transition cost constraints. Electronic Notes in Discrete Mathematics 21 (). , 2005 -
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1596231On the number of step functions with restrictionsPUB | DOI | WoS
Ahlswede, Rudolf, On the number of step functions with restrictions. THEORY OF PROBABILITY AND ITS APPLICATIONS 50 (4). , 2005 -
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913091Non-binary error correcting codes with noiseless feedback, localized errors, or bothPUB
Ahlswede, Rudolf, Non-binary error correcting codes with noiseless feedback, localized errors, or both. Annals of the European Academy of Sciences 1 (). , 2005 -
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1606261On shadows of intersecting familiesPUB | DOI | WoS
Ahlswede, Rudolf, On shadows of intersecting families. Combinatorica 24 (4). , 2004 -
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1608584Bohman's conjecture related to a sum packing problem of ErdosPUB | DOI | WoS
Ahlswede, Rudolf, Bohman's conjecture related to a sum packing problem of Erdos. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY 132 (05). , 2004 -
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1607764On lossless quantum data compression with a classical helperPUB | DOI | WoS
Ahlswede, Rudolf, On lossless quantum data compression with a classical helper. IEEE TRANSACTIONS ON INFORMATION THEORY 50 (6). , 2004 -
2004 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1605457On the density of primitive setsPUB | DOI | WoS
Ahlswede, Rudolf, On the density of primitive sets. JOURNAL OF NUMBER THEORY 109 (2). , 2004 -
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611107More about shifting techniquesPUB | DOI | WoS
Ahlswede, Rudolf, More about shifting techniques. European Journal of Combinatorics 24 (5). , 2003 -
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1610768Maximum number of constant weight vertices of the unit n-cube contained in a k-dimensional subspacePUB | DOI | WoS
Ahlswede, Rudolf, Maximum number of constant weight vertices of the unit n-cube contained in a k-dimensional subspace. Combinatorica 23 (1). , 2003 -
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609595Maximal antichains under dimension constraintsPUB | DOI | WoS
Ahlswede, Rudolf, Maximal antichains under dimension constraints. Discrete Mathematics 273 (1-3). , 2003 -
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1609590Extremal problems under dimension constraintsPUB | DOI | WoS
Ahlswede, Rudolf, Extremal problems under dimension constraints. Discrete Mathematics 273 (1-3). , 2003 -
2003 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1611224Cone dependence - A basic combinatorial conceptPUB | DOI | WoS
Ahlswede, Rudolf, Cone dependence - A basic combinatorial concept. Designs, Codes and Cryptography 29 (1-3). , 2003 -
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1611220Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted casePUB | DOI | WoS
Ahlswede, Rudolf, Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography 29 (1-3). , 2003 -
2003 | Zeitschriftenaufsatz | PUB-ID: 1882110Addendum to: "Strong converse for identification via quantum channels"PUB
Winter, Andreas, Addendum to: "Strong converse for identification via quantum channels". IEEE Trans. Inform. Theory 49 (1). , 2003 -
2003 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1878790On lossless quantum data compression and quantum variable-length codesPUB
Ahlswede, Rudolf, On lossless quantum data compression and quantum variable-length codes. Quantum Information Processing (). Weinheim, 2003 -
2003 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913390A complexity measure for families of binary sequencesPUB
Ahlswede, Rudolf, A complexity measure for families of binary sequences. Periodica Mathematica Hungarica 46 (2). , 2003 -
2003 | Zeitschriftenaufsatz | PUB-ID: 1913395Large deviations in quantum information theoryPUB
Ahlswede, Rudolf, Large deviations in quantum information theory. Problems of Information Transmission 39 (4). , 2003 -
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614890Parallel error correcting codesPUB | DOI | WoS
Ahlswede, Rudolf, Parallel error correcting codes. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (4). , 2002 -
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1614063Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedbackPUB | DOI | WoS
Ahlswede, Rudolf, Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (8). , 2002 -
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1613448The t-intersection problem in the truncated boolean latticePUB | DOI | WoS
Ahlswede, Rudolf, The t-intersection problem in the truncated boolean lattice. EUROPEAN JOURNAL OF COMBINATORICS 23 (5). , 2002 -
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1878792Unidirectional error control codes and related combinatorial problemsPUB
Ahlswede, Rudolf, Unidirectional error control codes and related combinatorial problems. Proceedings of Eight International Workshop on Algebraic and Combinatorial Coding Theory 2002 (). , 2002 -
2002 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1615280Strong converse for identification via quantum channelsPUB | DOI | WoS
Ahlswede, Rudolf, Strong converse for identification via quantum channels. IEEE TRANSACTIONS ON INFORMATION THEORY 48 (3). , 2002 -
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883908On perfect codes and related conceptsPUB | DOI | WoS
Ahlswede, Rudolf, On perfect codes and related concepts. Designs, Codes and Cryptography 22 (3). , 2001 -
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883911On primitive sets of squarefree integersPUB | DOI
Ahlswede, Rudolf, On primitive sets of squarefree integers. Periodica Mathematica Hungarica 42 (1). , 2001 -
2001 | Sammelwerksbeitrag | PUB-ID: 1883914Advances on extremal problems in number theory and combinatoricsPUB
Ahlswede, Rudolf, Advances on extremal problems in number theory and combinatorics. European Congress of Mathematics : Barcelona, July 10 - 14, 2000 201 (). Basel, 2001 -
2001 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1617846Quantum data processingPUB | DOI | WoS
Ahlswede, Rudolf, Quantum data processing. IEEE Transactions on Information Theory 47 (1). , 2001 -
2001 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883973An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protectionPUB | DOI
Ahlswede, Rudolf, An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection. Problems of Information Transmission 37 (4). , 2001 -
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883897On prefix-free and suffix-free sequences of integersPUB
Ahlswede, Rudolf, On prefix-free and suffix-free sequences of integers. Numbers, Information and Complexity (). Boston, 2000 -
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883900The AVC with noiseless feedbackPUB
Ahlswede, Rudolf, The AVC with noiseless feedback. Numbers, Information and Complexity (). Boston, 2000 -
2000 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1618855A diametric theorem for edgesPUB | WoS
Ahlswede, Rudolf, A diametric theorem for edges. JOURNAL OF COMBINATORIAL THEORY SERIES A 92 (1). , 2000 -
2000 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1883895Splitting properties in partially ordered sets and set systemsPUB
Ahlswede, Rudolf, Splitting properties in partially ordered sets and set systems. Numbers, Information and Complexity (). Boston, 2000 -
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1619489Network information flowPUB | DOI | WoS
Ahlswede, Rudolf, Network information flow. IEEE Transactions on Information Theory 46 (4). , 2000 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1620439On the quotient sequence of sequences of integersPUB | WoS
Ahlswede, Rudolf, On the quotient sequence of sequences of integers. Acta Arithmetica 91 (2). , 1999 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621019On the counting function of primitive sets of integersPUB | DOI | WoS
Ahlswede, Rudolf, On the counting function of primitive sets of integers. Journal of Number Theory 79 (2). , 1999 -
1999 | Zeitschriftenaufsatz | PUB-ID: 1883870Construction of uniquely decodable codes for the two-user binary adder channelPUB | DOI | WoS
Ahlswede, Rudolf, Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory 45 (1). , 1999 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623402Arbitrarily varying multiple-access channels - Part I - Ericson's symmetrizability is adequate, Gubner's conjecture is truePUB | DOI | WoS
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 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621975A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problemPUB | DOI | WoS
Ahlswede, Rudolf, A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problem. Combinatorics, Probability and Computing 8 (4). , 1999 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883892On the Hamming bound for nonbinary localized-error-correcting codesPUB
Bassalygo, Leonid, On the Hamming bound for nonbinary localized-error-correcting codes. Probl. of Inf. Transmission 35 (2). , 1999 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1621563Identification without randomizationPUB | DOI | WoS
Ahlswede, Rudolf, Identification without randomization. IEEE Transactions on Information Theory 45 (7). , 1999 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1623405Arbitrarily varying multiple-access channels - Part II: Correlated senders' side information, correlated messages, and ambiguous transmissionPUB | DOI | WoS
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 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1622320On maximal shadows of members in left-compressed setsPUB | DOI | WoS
Ahlswede, Rudolf, On maximal shadows of members in left-compressed sets. Discrete Applied Mathematics 95 (1-3). , 1999 -
1999 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1883876A pushing-pulling method: new proofs of intersection theoremsPUB | DOI | WoS
Ahlswede, Rudolf, A pushing-pulling method: new proofs of intersection theorems. Combinatorica 19 (1). , 1999 -
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913368Asymptotical isoperimetric problemPUB
Ahlswede, Rudolf, Asymptotical isoperimetric problem. (). , 1999 -
1999 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913370Nonstandard coding method for nonbinary codes correcting localized errorsPUB
Ahlswede, Rudolf, Nonstandard coding method for nonbinary codes correcting localized errors. (). , 1999 -
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625316Code pairs with specified parity of the Hamming distancesPUB | DOI | WoS
Ahlswede, Rudolf, Code pairs with specified parity of the Hamming distances. DISCRETE MATHEMATICS 188 (1-3). , 1998 -
1998 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1626601Common randomness in information theory and cryptography - Part II: CR capacityPUB | DOI | WoS
Ahlswede, Rudolf, Common randomness in information theory and cryptography - Part II: CR capacity. IEEE Transactions on Information Theory 44 (1). , 1998 -
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1626351Information and control: Matching channelsPUB | DOI | WoS
Ahlswede, Rudolf, Information and control: Matching channels. IEEE TRANSACTIONS ON INFORMATION THEORY 44 (2). , 1998 -
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624985Isoperimetric theorems in the binary sequences of finite lengthsPUB | DOI | WoS
Ahlswede, Rudolf, Isoperimetric theorems in the binary sequences of finite lengths. APPLIED MATHEMATICS LETTERS 11 (5). , 1998 -
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625787The diametric theorem in Hamming spaces - Optimal anticodesPUB | DOI | WoS
Ahlswede, Rudolf, The diametric theorem in Hamming spaces - Optimal anticodes. ADVANCES IN APPLIED MATHEMATICS 20 (4). , 1998 -
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1625772Zero-error capacity for models with memory and the enlightened dictator channelPUB | DOI | WoS
Ahlswede, Rudolf, Zero-error capacity for models with memory and the enlightened dictator channel. IEEE TRANSACTIONS ON INFORMATION THEORY 44 (3). , 1998 -
1998 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1624907The intersection theorem for direct productsPUB | DOI | WoS
Ahlswede, Rudolf, The intersection theorem for direct products. European Journal of Combinatorics 19 (6). , 1998 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627492Shadows and isoperimetry under the sequence-subsequence relationPUB | DOI | WoS
Ahlswede, Rudolf, Shadows and isoperimetry under the sequence-subsequence relation. Combinatorica 17 (1). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636801Correlated sources help transmission over an arbitrarily varying channelPUB | DOI | WoS
Ahlswede, Rudolf, Correlated sources help transmission over an arbitrarily varying channel. IEEE TRANSACTIONS ON INFORMATION THEORY 43 (4). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1627477Counterexample to the Frankl-Pach conjecture for uniform, dense familiesPUB | DOI | WoS
Ahlswede, Rudolf, Counterexample to the Frankl-Pach conjecture for uniform, dense families. COMBINATORICA 17 (2). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637377Edge-isoperimetric inequalities .1. Information-theoretical methodsPUB | DOI | WoS
Ahlswede, Rudolf, Edge-isoperimetric inequalities .1. Information-theoretical methods. EUROPEAN JOURNAL OF COMBINATORICS 18 (4). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636745General edge-isoperimetric inequalities .2. A local-global principle for lexicographical solutionsPUB | DOI | WoS
Ahlswede, Rudolf, General edge-isoperimetric inequalities .2. A local-global principle for lexicographical solutions. EUROPEAN JOURNAL OF COMBINATORICS 18 (5). , 1997 -
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628236Identification via compressed dataPUB | DOI | WoS
Ahlswede, Rudolf, Identification via compressed data. IEEE Transactions on Information Theory 43 (1). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1636775Models of multi-user write-efficient memories and general diametric theoremsPUB | DOI | WoS
Ahlswede, Rudolf, Models of multi-user write-efficient memories and general diametric theorems. INFORMATION AND COMPUTATION 135 (1). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637712Number theoretic correlation inequalities for Dirichlet densitiesPUB | DOI | WoS
Ahlswede, Rudolf, Number theoretic correlation inequalities for Dirichlet densities. JOURNAL OF NUMBER THEORY 63 (1). , 1997 -
1997 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1628232On interactive communicationPUB | DOI | WoS
Ahlswede, Rudolf, On interactive communication. IEEE Transactions on Information Theory 43 (1). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637812The complete intersection theorem for systems of finite setsPUB | DOI | WoS
Ahlswede, Rudolf, The complete intersection theorem for systems of finite sets. EUROPEAN JOURNAL OF COMBINATORICS 18 (2). , 1997 -
1997 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1637805Universal coding of integers and unbounded search treesPUB | DOI | WoS
Ahlswede, Rudolf, Universal coding of integers and unbounded search trees. IEEE TRANSACTIONS ON INFORMATION THEORY 43 (2). , 1997 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628669A counterexample to Aharoni's strongly maximal matching conjecturePUB | DOI | WoS
Ahlswede, Rudolf, A counterexample to Aharoni's strongly maximal matching conjecture. DISCRETE MATHEMATICS 149 (1-3). , 1996 -
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913322Cross-disjoint pairs of clouds in the interval latticePUB
Ahlswede, Rudolf, Cross-disjoint pairs of clouds in the interval lattice. The Mathematics of Paul Erdos, Vol. I (). Berlin/Heidelberg/New York, 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1628906Erasure, list, and detection zero-error capacities for low noise and a relation to identificationPUB | DOI | WoS
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 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638929Fault-tolerant minimum broadcast networksPUB | DOI | WoS
Ahlswede, Rudolf, Fault-tolerant minimum broadcast networks. NETWORKS 27 (4). , 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638192Incomparability and intersection properties of Boolean interval lattices and chain posetsPUB | DOI | WoS
Ahlswede, Rudolf, Incomparability and intersection properties of Boolean interval lattices and chain posets. EUROPEAN JOURNAL OF COMBINATORICS 17 (8). , 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639105Optimal pairs of incomparable clouds in multisetsPUB | DOI | WoS
Ahlswede, Rudolf, Optimal pairs of incomparable clouds in multisets. GRAPHS AND COMBINATORICS 12 (1). , 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639674Sets of integers and quasi-integers with pairwise common divisorPUB | WoS
Ahlswede, Rudolf, Sets of integers and quasi-integers with pairwise common divisor. ACTA ARITHMETICA 74 (2). , 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1639022Sets of integers with pairwise common divisor and a factor from a specified set of primesPUB | WoS
Ahlswede, Rudolf, Sets of integers with pairwise common divisor and a factor from a specified set of primes. ACTA ARITHMETICA 75 (3). , 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1638542The complete nontrivial-intersection theorem for systems of finite setsPUB | DOI | WoS
Ahlswede, Rudolf, The complete nontrivial-intersection theorem for systems of finite sets. JOURNAL OF COMBINATORIAL THEORY SERIES A 76 (1). , 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913328Identification under random processesPUB
Ahlswede, Rudolf, Identification under random processes. Problems of Information Transmission 32 (1). , 1996 -
1996 | Preprint | Veröffentlicht | PUB-ID: 1913331Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matchingPUB
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 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913343Intersecting SystemsPUB
Ahlswede, Rudolf, Intersecting Systems. Combinatorics, Probability and Computing 6 (). , 1996 -
1996 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913355Higher level extremal problemsPUB
Ahlswede, Rudolf, Higher level extremal problems. Comb. Inf. & Syst. Sc. 21 (3-4). , 1996 -
1996 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1913333Classical results on primitive and recent results on cross-primitive sequencesPUB
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 -
1996 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1913352Some properties of fix-free codesPUB
Ahlswede, Rudolf, Some properties of fix-free codes. (). Thahkadzor, Armenia, 1996 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1629125Density inequalities for sets of multiplesPUB | DOI | WoS
Ahlswede, Rudolf, Density inequalities for sets of multiples. JOURNAL OF NUMBER THEORY 55 (2). , 1995 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913242New directions in the theory of identification via channelsPUB | DOI | WoS
Ahlswede, Rudolf, New directions in the theory of identification via channels. IEEE Trans. Inf. Theory 41 (4). , 1995 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913254Maximal sets of numbers not containing k+1 pairwise coprime integersPUB | WoS
Ahlswede, Rudolf, Maximal sets of numbers not containing k+1 pairwise coprime integers. Acta Arithmetica 72 (1). , 1995 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913278A splitting property of maximal antichainsPUB | DOI | WoS
Ahlswede, Rudolf, A splitting property of maximal antichains. Combinatorica 15 (4). , 1995 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780563Asymptotically optimal binary codes of polynomial complexity correcting localized errorsPUB | PDF
Ahlswede, Rudolf, Asymptotically optimal binary codes of polynomial complexity correcting localized errors. Probl. Peredachi Inf. 31 (2). , 1995 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1641640Localized random and arbitrary errors in the light of AV channel theoryPUB | DOI | WoS
Ahlswede, Rudolf, Localized random and arbitrary errors in the light of AV channel theory. IEEE Transactions on Information Theory 41 (1). , 1995 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913236Edge isoperimetric theorems for integer point arraysPUB | DOI | WoS
Ahlswede, Rudolf, Edge isoperimetric theorems for integer point arrays. Applied Mathematics Letters 8 (2). , 1995 -
1995 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913248Towards characterising equality in correlation inequalitiesPUB | DOI | WoS
Ahlswede, Rudolf, Towards characterising equality in correlation inequalities. European J. of Combinatorics 16 (4). , 1995 -
1994 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780546Messy broadcasting in networksPUB | PDF
Ahlswede, Rudolf, Messy broadcasting in networks. Communications and cryptography: two sides of one tapestry 276 (). Boston [u.a.], 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774967On extremal sets without coprimesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, On extremal sets without coprimes. Acta Arithmetica 66 (1). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780530The maximal length of cloud-antichainsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, The maximal length of cloud-antichains. Discrete Mathematics 131 (1-3). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780544Two-way communication complexity of sum-type functions for one processor to be informedPUB | PDF
Ahlswede, Rudolf, Two-way communication complexity of sum-type functions for one processor to be informed. Problems of information transmission 30 (1). , 1994 -
1994 | Preprint | Veröffentlicht | PUB-ID: 1780556On sets of words with pairwise common letter in different positionsPUB | PDF
Ahlswede, Rudolf, On sets of words with pairwise common letter in different positions. (). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781092A new direction in extremal theoryPUB | PDF
Ahlswede, Rudolf, A new direction in extremal theory. Journal of combinatorics, information and system sciences 19 (3). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780527On the optimal structure of recovering set pairs in lattices: the sandglass conjecturePUB | PDF | DOI | WoS
Ahlswede, Rudolf, On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. Discrete Mathematics 128 (1-3). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780541The asymptotic behavior of diameters in the averagePUB | PDF | DOI | WoS
Ahlswede, Rudolf, The asymptotic behavior of diameters in the average. Journal of Combinatorial Theory, Series B 61 (2). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780553Binary constant-weight codes correcting localized errors and defectsPUB | PDF
Ahlswede, Rudolf, Binary constant-weight codes correcting localized errors and defects. Problems of information transmission 30 (2). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780560On partitioning and packing products with rectanglesPUB | PDF | DOI
Ahlswede, Rudolf, On partitioning and packing products with rectangles. Combinatorics, Probability & Computing 3 (04). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780497On communication complexity of vector-valued functionsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, On communication complexity of vector-valued functions. IEEE transactions on information theory 40 (6). , 1994 -
1994 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780494On multiuser write-efficient memoriesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, On multiuser write-efficient memories. IEEE transactions on information theory 40 (3). , 1994 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774963Rank formulas for certain products of matricesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Rank formulas for certain products of matrices. Applicable Algebra in Engineering, Communication and Computing 4 (4). , 1993 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780491Common randomness in information theory and cryptography. Part I: secret sharingPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Common randomness in information theory and cryptography. Part I: secret sharing. IEEE transactions on information theory 39 (4). , 1993 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780525On extremal set partitions in Cartesian product spacesPUB | PDF
Ahlswede, Rudolf, On extremal set partitions in Cartesian product spaces. Combinatorics, Probability & Computing 2 (2). , 1993 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780515Partitioning the n-cube into sets with mutual distance 1PUB | PDF | DOI | WoS
Blokhuis, A., Partitioning the n-cube into sets with mutual distance 1. Applied Mathematics Letters 6 (4). , 1993 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774960A generalization of the AZ identityPUB | PDF | DOI | WoS
Ahlswede, Rudolf, A generalization of the AZ identity. Combinatorica 13 (3). , 1993 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780485The maximal error capacity of arbitrarily varying channels for constant list sizesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, The maximal error capacity of arbitrarily varying channels for constant list sizes. IEEE transactions on information theory 39 (4). , 1993 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780512Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]PUB | PDF
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 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780487Nonbinary codes correcting localized errorsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Nonbinary codes correcting localized errors. IEEE transactions on information theory 39 (4). , 1993 -
1993 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780521Communication complexity in latticesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Communication complexity in lattices. Applied Mathematics Letters 6 (6). , 1993 -
1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780509Rich colorings with local constraintsPUB | PDF
Ahlswede, Rudolf, Rich colorings with local constraints. Journal of combinatorics, information & system sciences 17 (3). , 1992 -
1992 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774877Diametric theorems in sequence spacesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Diametric theorems in sequence spaces. Combinatorica 12 (1). , 1992 -
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780477Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theoryPUB | PDF | DOI | WoS
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 -
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780480On identification via multiway channels with feedbackPUB | PDF | DOI | WoS
Ahlswede, Rudolf, On identification via multiway channels with feedback. IEEE transactions on information theory 37 (5). , 1991 -
1991 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780482Two proofs of Pinsker's conjecture concerning arbitrarily varying channelsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. IEEE transactions on information theory 37 (6). , 1991 -
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775120On cloud-antichains and related configurationsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, On cloud-antichains and related configurations. Discrete Mathematics 85 (3). , 1990 -
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781090On minimax estimation in the presence of side information about remote dataPUB | PDF | DOI | WoS
Ahlswede, Rudolf, On minimax estimation in the presence of side information about remote data. The annals of statistics 18 (1). , 1990 -
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775117Creating order in sequence spaces with simple machinesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Creating order in sequence spaces with simple machines. Information and Computation 89 (1). , 1990 -
1990 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780506A recursive bound for the number of complete K-subgraphs of a graphPUB | PDF
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 -
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780503An identity in combinatorial extremal theoryPUB | PDF | DOI | WoS
Ahlswede, Rudolf, An identity in combinatorial extremal theory. Advances in Mathematics 80 (2). , 1990 -
1990 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780475Extremal properties of rate distortion functionsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Extremal properties of rate distortion functions. IEEE transactions on information theory 36 (1). , 1990 -
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775113Contributions to a theory of ordering for sequence spacesPUB | PDF | WoS
Ahlswede, Rudolf, Contributions to a theory of ordering for sequence spaces. Problems of Control and Information Theory 18 (4). , 1989 -
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780472Identification in the presence of feedback: a discovery of new capacity formulasPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Identification in the presence of feedback: a discovery of new capacity formulas. IEEE transactions on information theory 35 (1). , 1989 -
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780469Identification via channelsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Identification via channels. IEEE transactions on information theory 35 (1). , 1989 -
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775115Coding for write-efficient memoryPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Coding for write-efficient memory. Information and Computation 83 (1). , 1989 -
1989 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780500A general 4-words inequality with consequences for 2-way communication complexityPUB | PDF | DOI | WoS
Ahlswede, Rudolf, A general 4-words inequality with consequences for 2-way communication complexity. Advances in Applied Mathematics 10 (1). , 1989 -
1988 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775111Inequalities for code pairsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Inequalities for code pairs. European Journal of Combinatorics 9 (2). , 1988 -
1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780468On code pairs with specified Hamming distancesPUB | PDF
Ahlswede, Rudolf, On code pairs with specified Hamming distances. Combinatorics 52 (). Amsterdam [u.a.], 1987 -
1987 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780605Eight problems in information theoryPUB | PDF
Ahlswede, Rudolf, Eight problems in information theory. Open problems in communication and computation (). New York [u.a.], 1987 -
1987 | Monographie | Veröffentlicht | PUB-ID: 1913125Search ProblemsPUB
Ahlswede, Rudolf, Search Problems. (). Chichester , 1987 -
1987 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780452Optimal coding strategies for certain permuting channelsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Optimal coding strategies for certain permuting channels. IEEE transactions on information theory 33 (3). , 1987 -
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780427Hypothesis testing with communication constraintsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Hypothesis testing with communication constraints. IEEE transactions on information theory 32 (4). , 1986 -
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780441Arbitrarily varying channels with states sequence known to the senderPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Arbitrarily varying channels with states sequence known to the sender. IEEE transactions on information theory 32 (5). , 1986 -
1986 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780429On multiple descriptions and team guessingPUB | PDF | DOI | WoS
Ahlswede, Rudolf, On multiple descriptions and team guessing. IEEE transactions on information theory 32 (4). , 1986 -
1985 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780426The rate-distortion region for multiple descriptions without excess ratePUB | PDF | DOI | WoS
Ahlswede, Rudolf, The rate-distortion region for multiple descriptions without excess rate. IEEE transactions on information theory 31 (6). , 1985 -
1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775096A two-family extremal problem in hamming spacePUB | PDF | DOI | WoS
Ahlswede, Rudolf, A two-family extremal problem in hamming space. Discrete Mathematics 49 (1). , 1984 -
1984 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780416Improvements of Winograd's result on computation in the presence of noisePUB | PDF | DOI | WoS
Ahlswede, Rudolf, Improvements of Winograd's result on computation in the presence of noise. IEEE transactions on information theory 30 (6). , 1984 -
1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775100Note on an extremal problem arising for unreliable networks in parallel computingPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Note on an extremal problem arising for unreliable networks in parallel computing. Discrete Mathematics 47 (). , 1983 -
1983 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780414On source coding with side information via a multiple-access channel and related problems in multi-user information theoryPUB | PDF | DOI | WoS
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 -
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1913152An elementary proof of the strong converse theorem for the multiple-access channelPUB | PDF
Ahlswede, Rudolf, An elementary proof of the strong converse theorem for the multiple-access channel. J. Combinatorics, Information and System Sciences 7 (3). , 1982 -
1982 | Monographie | Veröffentlicht | PUB-ID: 1913139Zadaci poiskaPUB
Ahlswede, Rudolf, Zadaci poiska. (). Moskau, 1982 -
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775489Remarks on Shannon's secrecy systemsPUB | PDF
Ahlswede, Rudolf, Remarks on Shannon's secrecy systems. Problems of Control and Information Theory 11 (4). , 1982 -
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775509Bad codes are good ciphersPUB | PDF
Ahlswede, Rudolf, Bad codes are good ciphers. Problems of Control and Information Theory 11 (5). , 1982 -
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780388Jacob Wolfowitz (1910-1981)PUB | PDF
Ahlswede, Rudolf, Jacob Wolfowitz (1910-1981). IEEE transactions on information theory 28 (5). , 1982 -
1982 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1776125Good codes can be produced by a few permutationsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Good codes can be produced by a few permutations. IEEE transactions on information theory 28 (3). , 1982 -
1981 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775487To get a bit of information may be as hard as to get full informationPUB | PDF | DOI | WoS
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 -
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780400Simple hypergraphs with maximal number of adjacent pairs of edgesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Simple hypergraphs with maximal number of adjacent pairs of edges. Journal of Combinatorial Theory, Series B 28 (2). , 1980 -
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775420Coloring hypergraphs: A new approach to multi-user source coding, 2PUB | PDF
Ahlswede, Rudolf, Coloring hypergraphs: A new approach to multi-user source coding, 2. Journal of combinatorics, information & system sciences 5 (3). , 1980 -
1980 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775486A method of coding and its application to arbitrarily varying channelsPUB | PDF
Ahlswede, Rudolf, A method of coding and its application to arbitrarily varying channels. Journal of combinatorics, information and system sciences 5 (1). , 1980 -
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774874Inequalities for a pair of maps S x S -> S with S a finite setPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Inequalities for a pair of maps S x S -> S with S a finite set. Mathematische Zeitschrift 165 (3). , 1979 -
1979 | Monographie | Veröffentlicht | PUB-ID: 1913120SuchproblemePUB
Ahlswede, Rudolf, Suchprobleme. (). Wiesbaden, 1979 -
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780382The number of values of combinatorial functionsPUB | PDF | DOI
Ahlswede, Rudolf, The number of values of combinatorial functions. Bulletin of the London Mathematical Society 11 (1). , 1979 -
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775419Coloring hypergraphs: A new approach to multi-user source coding, 1PUB | PDF
Ahlswede, Rudolf, Coloring hypergraphs: A new approach to multi-user source coding, 1. Journal of combinatorics, information & system sciences 4 (1). , 1979 -
1979 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780389Integral inequalities for increasing functionsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Integral inequalities for increasing functions. Mathematical Proceedings of the Cambridge Philosophical Society 86 (03). , 1979 -
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774867Elimination of correlation in random codes for arbitrarily varying channelsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 44 (2). , 1978 -
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1780385Graphs with maximal number of adjacent pairs of edgesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Graphs with maximal number of adjacent pairs of edges. Acta mathematica Academiae Scientiarum Hungaricae 32 (1-2). , 1978 -
1978 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774869An inequality for the weights of two families of sets, their unions and intersectionsPUB | PDF | DOI | WoS
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 -
1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775092Contributions to the geometry of hamming spacesPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Contributions to the geometry of hamming spaces. Discrete Mathematics 17 (1). , 1977 -
1977 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780380On the connection between the entropies of input and output distributions of discrete memoryless channelsPUB | PDF
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 -
1977 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774860Correction to: Bounds on conditional probabilities with applicationsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Correction to: Bounds on conditional probabilities with applications. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 39 (4). , 1977 -
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781088Spreading of sets in product spaces and hypercontraction of the Markov operatorPUB | PDF
Ahlswede, Rudolf, Spreading of sets in product spaces and hypercontraction of the Markov operator. The annals of probability 4 (6). , 1976 -
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774864Every bad code has a good subcode: a local converse to the coding theoremPUB | PDF | DOI | WoS
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 -
1976 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774856Bounds on conditional probabilities with applications in multi-user communicationPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Bounds on conditional probabilities with applications in multi-user communication. Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete 34 (2). , 1976 -
1975 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775417Two contributions to information theoryPUB | PDF
Ahlswede, Rudolf, Two contributions to information theory. Topics in information theory 16 (). Amsterdam, 1975 -
1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775415Source encoding with side information and a converse for degraded broadcast channelsPUB | PDF
Ahlswede, Rudolf, Source encoding with side information and a converse for degraded broadcast channels. IEEE transactions on information theory IT-21 (6). , 1975 -
1975 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775089Approximation o continuous functions in p-Adic AnalysisPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Approximation o continuous functions in p-Adic Analysis. Journal of Approximation Theory 15 (3). , 1975 -
1974 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781087The capacity region of a channel with two senders and two receiversPUB | PDF
Ahlswede, Rudolf, The capacity region of a channel with two senders and two receivers. The annals of probability 2 (5). , 1974 -
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780371Multi-way communication channelsPUB | PDF
Ahlswede, Rudolf, Multi-way communication channels. Second International Symposium on Information Theory: Tsahkadsor, Armenia, USSR, Sept. 2 - 8, 1971 (). Budapest, 1973 -
1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774854Channels with arbitrarily varying channel probability functions in the presence of noiseless feedbackPUB | PDF | DOI | WoS
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 -
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780373A constructive proof of the coding theorem for discrete memoryless channels with feedbackPUB | PDF
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 -
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780372On two-way communication channels and a problem by ZarankiewiczPUB | PDF
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 -
1973 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780374The capacity of a channel with arbitrarily varying additive Gaussian channel probability functionsPUB | PDF
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 -
1973 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781086Channel capacities for list codesPUB | PDF
Ahlswede, Rudolf, Channel capacities for list codes. Journal of applied probability 10 (). , 1973 -
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775343Channels without synchronizationPUB | PDF
Ahlswede, Rudolf, Channels without synchronization. Advances in applied probability 3 (2). , 1971 -
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775381Bounds on algebraic code capacities for noisy channels. IIPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Bounds on algebraic code capacities for noisy channels. II. Information and Control 19 (2). , 1971 -
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774872Group Codes do not Achieve Shannon's Channel Capacity for General Discrete ChannelsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels. The Annals of Mathematical Statistics 42 (1). , 1971 -
1971 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775378Bounds on algebraic code capacities for noisy channels. IPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Bounds on algebraic code capacities for noisy channels. I. Information and Control 18 (2). , 1971 -
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1781084A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacityPUB | PDF
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 -
1970 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774851The capacity of a channel with arbitrarily varying channel probability functions and binary outputPUB | PDF | DOI | WoS
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 -
1969 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1775340Correlated decoding for channels with arbitrarily varying channel probability functionsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, Correlated decoding for channels with arbitrarily varying channel probability functions. Information and Control 14 (5). , 1969 -
1969 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1775145The structure of capacity functions for compound channelsPUB | PDF
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 -
1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774842The weak capacity of averaged channelsPUB | PDF | DOI | WoS
Ahlswede, Rudolf, The weak capacity of averaged channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 11 (1). , 1968 -
1968 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1774845Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer KanälePUB | PDF | DOI | WoS
Ahlswede, Rudolf, Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 10 (1). , 1968 -
1967 | Sammelwerksbeitrag | Veröffentlicht | PUB-ID: 1780342Certain results in coding theory for compound channelsPUB | PDF
Ahlswede, Rudolf, Certain results in coding theory for compound channels. Proceedings of the Colloquium on Information Theory (). Budapest, 1967