 | 2009 |
|---|
| 171 |       | Rudolf Ahlswede,
Harout K. Aydinian:
Interactive Communication, Diagnosis and Error Control in Networks.
Algorithmics of Large and Complex Networks 2009: 197-226 |
| 170 | | Rudolf Ahlswede,
Ferdinando Cicalese,
Christian Deppe,
Ugo Vaccaro:
Two Batch Search With Lie Cost.
IEEE Transactions on Information Theory 55(4): 1433-1439 (2009) |
| 2008 |
|---|
| 169 | | Rudolf Ahlswede,
Faina I. Solov'eva:
A Diametric Theorem in Z nm for Lee and Related Distances.
ICMCTA 2008: 1-10 |
| 168 | | Rudolf Ahlswede,
Harout K. Aydinian:
On diagnosability of large multiprocessor networks.
Discrete Applied Mathematics 156(18): 3464-3474 (2008) |
| 167 | | Rudolf Ahlswede:
Preface.
Discrete Applied Mathematics 156(9): 1343-1344 (2008) |
| 166 | | Rudolf Ahlswede:
General theory of information transfer: Updated.
Discrete Applied Mathematics 156(9): 1348-1388 (2008) |
| 165 | | Rudolf Ahlswede:
Ratewise-optimal non-sequential search strategies under constraints on the tests.
Discrete Applied Mathematics 156(9): 1431-1443 (2008) |
| 164 | | Rudolf Ahlswede,
Ferdinando Cicalese,
Christian Deppe:
Searching with lies under error cost constraints.
Discrete Applied Mathematics 156(9): 1444-1460 (2008) |
| 163 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Haik Mashurian,
T. Partner:
T-shift synchronization codes.
Discrete Applied Mathematics 156(9): 1461-1468 (2008) |
| 162 | | Rudolf Ahlswede,
Vladimir Blinovsky:
Multiple packing in sum-type metric spaces.
Discrete Applied Mathematics 156(9): 1469-1477 (2008) |
| 161 | | Rudolf Ahlswede,
Julien Cassaigne,
András Sárközy:
On the correlation of binary sequences.
Discrete Applied Mathematics 156(9): 1478-1487 (2008) |
| 160 | | Rudolf Ahlswede,
Harout K. Aydinian:
Error Control Codes for Parallel Asymmetric Channels.
IEEE Transactions on Information Theory 54(2): 831-836 (2008) |
| 2007 |
|---|
| 159 | | Rudolf Ahlswede,
Vladimir Blinovsky:
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels.
IEEE Transactions on Information Theory 53(2): 526-533 (2007) |
| 2006 |
|---|
| 158 |  | Rudolf Ahlswede,
Alberto Apostolico,
Vladimir I. Levenshtein:
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 157 | | Rudolf Ahlswede,
Lars Bäumer,
Ning Cai,
Harout K. Aydinian,
Vladimir Blinovsky,
Christian Deppe,
Haik Mashurian:
General Theory of Information Transfer and Combinatorics
Springer 2006 |
| 156 | | Rudolf Ahlswede,
Alberto Apostolico,
Vladimir I. Levenshtein:
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 |
| 155 | | Rudolf Ahlswede,
Alberto Apostolico,
Vladimir I. Levenshtein:
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 |
| 154 | | Rudolf Ahlswede,
Christian Deppe,
Vladimir Lebedev:
Non--binary error correcting codes with noiseless feedback, localized errors, or both.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 |
| 153 | | Rudolf Ahlswede:
Introduction.
GTIT-C 2006: 1-44 |
| 152 | | Rudolf Ahlswede:
Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem.
GTIT-C 2006: 1006-1009 |
| 151 | | Rudolf Ahlswede,
Harout K. Aydinian:
Sparse Asymmetric Connectors in Communication Networks.
GTIT-C 2006: 1056-1062 |
| 150 | | Rudolf Ahlswede:
Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded.
GTIT-C 2006: 1063 |
| 149 | | Rudolf Ahlswede,
Iskandar Karapetyan:
Intersection Graphs of Rectangles and Segments.
GTIT-C 2006: 1064-1065 |
| 148 | | Rudolf Ahlswede,
Ning Cai:
Watermarking Identification Codes with Related Topics on Common Randomness.
GTIT-C 2006: 107-153 |
| 147 | | Rudolf Ahlswede,
Ning Cai:
Codes with the Identifiable Parent Property and the Multiple-Access Channel.
GTIT-C 2006: 249-257 |
| 146 | | Rudolf Ahlswede,
Ning Cai:
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder.
GTIT-C 2006: 258-275 |
| 145 | | Rudolf Ahlswede,
Ning Cai,
Zhaozhi Zhang:
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer.
GTIT-C 2006: 285-292 |
| 144 | | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I.
GTIT-C 2006: 293-307 |
| 143 | | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II.
GTIT-C 2006: 308-325 |
| 142 | | Rudolf Ahlswede:
Rudolf Ahlswede - From 60 to 66.
GTIT-C 2006: 45-48 |
| 141 | | Rudolf Ahlswede,
Ning Cai:
A Strong Converse Theorem for Quantum Multiple Access Channels.
GTIT-C 2006: 460-485 |
| 140 | | Rudolf Ahlswede:
Information Theory and Some Friendly Neighbors - Ein Wunschkonzert.
GTIT-C 2006: 49-50 |
| 139 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Kleinewächter:
Identification for Sources.
GTIT-C 2006: 51-61 |
| 138 | | Rudolf Ahlswede,
Zheng Zhang:
Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source.
GTIT-C 2006: 535-546 |
| 137 | | Rudolf Ahlswede,
Ella Aloyan,
Evgueni A. Haroutunian:
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information.
GTIT-C 2006: 547-552 |
| 136 | | Rudolf Ahlswede,
Evgueni A. Haroutunian:
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification.
GTIT-C 2006: 553-571 |
| 135 | | Rudolf Ahlswede,
Vladimir Blinovsky:
Correlation Inequalities in Function Spaces.
GTIT-C 2006: 572-577 |
| 134 | | Rudolf Ahlswede:
Identification Entropy.
GTIT-C 2006: 595-613 |
| 133 | | Rudolf Ahlswede,
Mark S. Pinsker:
Report on Models of Write-Efficient Memories with Localized Errors and Defects.
GTIT-C 2006: 628-632 |
| 132 | | Rudolf Ahlswede:
On Concepts of Performance Parameters for Channels.
GTIT-C 2006: 639-663 |
| 131 | | Rudolf Ahlswede,
János Körner:
Appendix: On Common Information and Related Characteristics of Correlated Information Sources.
GTIT-C 2006: 664-677 |
| 130 | | Rudolf Ahlswede,
Ning Cai:
Search with Noisy and Delayed Responses.
GTIT-C 2006: 695-703 |
| 129 | | Rudolf Ahlswede,
Ning Cai:
A Kraft-Type Inequality for d-Delay Binary Search Codes.
GTIT-C 2006: 704-706 |
| 128 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Martin Fröhlich:
A Fast Suffix-Sorting Algorithm.
GTIT-C 2006: 719-734 |
| 127 | | Rudolf Ahlswede,
Erdal Arikan,
Lars Bäumer,
Christian Deppe:
Information Theoretic Models in Language Evolution.
GTIT-C 2006: 769-787 |
| 126 | | Rudolf Ahlswede:
An Outside Opinion.
GTIT-C 2006: 858-860 |
| 125 | | Søren Riis,
Rudolf Ahlswede:
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding".
GTIT-C 2006: 861-897 |
| 124 | | Rudolf Ahlswede:
Appendix: On Set Coverings in Cartesian Product Spaces.
GTIT-C 2006: 926-937 |
| 123 | | Rudolf Ahlswede,
Alexander Yudin:
On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections.
GTIT-C 2006: 941-954 |
| 122 | | Rudolf Ahlswede,
Levon H. Khachatrian:
On Attractive and Friendly Sets in Sequence Spaces.
GTIT-C 2006: 955-970 |
| 121 | | Rudolf Ahlswede,
Ning Cai:
Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs.
GTIT-C 2006: 979-1005 |
| 120 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian,
Ludo M. G. M. Tolhuizen:
On q-ary codes correcting all unidirectional errors of a limited magnitude
CoRR abs/cs/0607132: (2006) |
| 119 | | Rudolf Ahlswede,
A. Cai:
An Interpretation of Identification Entropy.
IEEE Transactions on Information Theory 52(9): 4198-4207 (2006) |
| 118 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
Intersection theorems under dimension constraints.
J. Comb. Theory, Ser. A 113(3): 483-519 (2006) |
| 117 | | Rudolf Ahlswede,
Harout K. Aydinian:
Construction of asymmetric connectors of depth two.
J. Comb. Theory, Ser. A 113(8): 1614-1620 (2006) |
| 116 | | Rudolf Ahlswede,
Vladimir Blinovsky:
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes.
J. Comb. Theory, Ser. A 113(8): 1621-1628 (2006) |
| 2005 |
|---|
| 115 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case.
Des. Codes Cryptography 37(1): 151-167 (2005) |
| 114 | | Rudolf Ahlswede:
Editorial Note.
Electronic Notes in Discrete Mathematics 21: 1-89 (2005) |
| 113 | | Rudolf Ahlswede,
Harout K. Aydinian:
On diagnosability of large multiprocessor networks.
Electronic Notes in Discrete Mathematics 21: 101-104 (2005) |
| 112 | | Rudolf Ahlswede,
Harout K. Aydinian:
Sparse asymmetric connectors in communication networks.
Electronic Notes in Discrete Mathematics 21: 105-109 (2005) |
| 111 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Martin Fröhlich:
A Fast Suffix-Sorting Algorithm.
Electronic Notes in Discrete Mathematics 21: 111-114 (2005) |
| 110 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Kleinewächter:
Identification for Sources.
Electronic Notes in Discrete Mathematics 21: 115-118 (2005) |
| 109 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Christian Deppe,
Haik Mashurian,
T. Partner:
T-shift synchronization codes.
Electronic Notes in Discrete Mathematics 21: 119-123 (2005) |
| 108 | | Rudolf Ahlswede,
Vladimir Blinovsky:
Correlation Inequalities in Function Spaces.
Electronic Notes in Discrete Mathematics 21: 125-127 (2005) |
| 107 | | Rudolf Ahlswede,
Vladimir Blinovsky:
Multiple Packing in Sum-type Metric Spaces.
Electronic Notes in Discrete Mathematics 21: 129-131 (2005) |
| 106 | | Rudolf Ahlswede,
Ning Cai:
A Kraft-type inequality for d-delay binary search codes.
Electronic Notes in Discrete Mathematics 21: 133-136 (2005) |
| 105 | | Rudolf Ahlswede,
Ning Cai:
A Strong Converse Theorem for Quantum Multiple Access Channels.
Electronic Notes in Discrete Mathematics 21: 137-141 (2005) |
| 104 | | Rudolf Ahlswede,
Ning Cai:
Codes with the identifiable parent property and the multiple-access channel.
Electronic Notes in Discrete Mathematics 21: 143-147 (2005) |
| 103 | | Rudolf Ahlswede,
Ning Cai:
Search with noisy and delayed response.
Electronic Notes in Discrete Mathematics 21: 149-154 (2005) |
| 102 | | Rudolf Ahlswede,
Ning Cai:
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder.
Electronic Notes in Discrete Mathematics 21: 155-159 (2005) |
| 101 | | Rudolf Ahlswede,
Ning Cai:
Watermarking Identification Codes with Related Topics on Common Randomness.
Electronic Notes in Discrete Mathematics 21: 161-165 (2005) |
| 100 | | Rudolf Ahlswede,
Ning Cai,
Zhaozhi Zhang:
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers.
Electronic Notes in Discrete Mathematics 21: 167-168 (2005) |
| 99 | | Rudolf Ahlswede,
Julien Cassaigne,
András Sárközy:
On the correlation of binary sequences.
Electronic Notes in Discrete Mathematics 21: 169-171 (2005) |
| 98 | | Rudolf Ahlswede,
Ferdinando Cicalese,
Christian Deppe:
Searching with lies under error transition cost constraints.
Electronic Notes in Discrete Mathematics 21: 173-179 (2005) |
| 97 | | Rudolf Ahlswede:
General theory of information transfer.
Electronic Notes in Discrete Mathematics 21: 181-184 (2005) |
| 96 | | Rudolf Ahlswede,
Evgueni A. Haroutunian:
Testing of Hypothesis and Identification.
Electronic Notes in Discrete Mathematics 21: 185-189 (2005) |
| 95 | | Rudolf Ahlswede:
Identification Entropy.
Electronic Notes in Discrete Mathematics 21: 191-192 (2005) |
| 94 | | Rudolf Ahlswede,
Levon H. Khachatrian:
On attractive and friendly sets in sequence spaces.
Electronic Notes in Discrete Mathematics 21: 193-198 (2005) |
| 93 | | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large families of pseudorandom sequences of k symbols and their complexity, Part II.
Electronic Notes in Discrete Mathematics 21: 199-201 (2005) |
| 92 | | Rudolf Ahlswede,
Christian Mauduit,
András Sárközy:
Large families of pseudorandom sequences of k symbols and their complexity, Part I.
Electronic Notes in Discrete Mathematics 21: 203-204 (2005) |
| 91 | | Rudolf Ahlswede,
Mark S. Pinsker:
Report on models of write-efficient memories with localized errors and defects.
Electronic Notes in Discrete Mathematics 21: 205-207 (2005) |
| 90 | | Rudolf Ahlswede:
Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests.
Electronic Notes in Discrete Mathematics 21: 209-210 (2005) |
| 89 | | Rudolf Ahlswede,
Alexander Yudin:
On partitions of a rectangle into rectangles with restricted number of cross sections.
Electronic Notes in Discrete Mathematics 21: 211-212 (2005) |
| 88 | | Rudolf Ahlswede,
Zhen Zhang:
Estimating with randomized encoding the joint empirical distribution in a correlated source.
Electronic Notes in Discrete Mathematics 21: 213-218 (2005) |
| 87 | | Rudolf Ahlswede,
Ella Aloyan,
Evgueni A. Haroutunian:
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information.
Electronic Notes in Discrete Mathematics 21: 91-95 (2005) |
| 86 | | Rudolf Ahlswede,
Erdal Arikan,
Lars Bäumer,
Christian Deppe:
Information theoretic models in language evolution.
Electronic Notes in Discrete Mathematics 21: 97-100 (2005) |
| 2004 |
|---|
| 85 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
On Shadows Of Intersecting Families.
Combinatorica 24(4): 555-566 (2004) |
| 84 | | Rudolf Ahlswede,
Levon H. Khachatrian:
Katona's Intersection Theorem: Four Proofs.
Combinatorica 25(1): 105-110 (2004) |
| 83 | | Rudolf Ahlswede,
Ning Cai:
On Lossless Quantum Data Compression With a Classical Helper.
IEEE Transactions on Information Theory 50(6): 1208-1219 (2004) |
| 2003 |
|---|
| 82 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace.
Combinatorica 23(1): 5-22 (2003) |
| 81 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case.
Des. Codes Cryptography 29(1-3): 17-28 (2003) |
| 80 | | Rudolf Ahlswede,
Levon H. Khachatrian:
Cone Dependence - A Basic Combinatorial Concept.
Des. Codes Cryptography 29(1-3): 29-40 (2003) |
| 79 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
Maximal antichains under dimension constraints.
Discrete Mathematics 273(1-3): 23-29 (2003) |
| 78 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
Extremal problems under dimension constraints.
Discrete Mathematics 273(1-3): 9-21 (2003) |
| 77 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
More about shifting techniques.
Eur. J. Comb. 24(5): 551-556 (2003) |
| 76 | | Rudolf Ahlswede,
Andreas Winter:
Addendum to "Strong converse for identification via quantum channels".
IEEE Transactions on Information Theory 49(1): 346 (2003) |
| 2002 |
|---|
| 75 | | Rudolf Ahlswede,
Christian Bey,
Konrad Engel,
Levon H. Khachatrian:
The t-intersection Problem in the Truncated Boolean Lattice.
Eur. J. Comb. 23(5): 471-487 (2002) |
| 74 | | Rudolf Ahlswede,
Andreas Winter:
Strong converse for identification via quantum channels.
IEEE Transactions on Information Theory 48(3): 569-579 (2002) |
| 73 | | Rudolf Ahlswede,
Bernhard Balkenhol,
Ning Cai:
Parallel error correcting codes.
IEEE Transactions on Information Theory 48(4): 959-962 (2002) |
| 72 | | Rudolf Ahlswede,
Ning Cai:
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback.
IEEE Transactions on Information Theory 48(8): 2153-2162 (2002) |
| 2001 |
|---|
| 71 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
On Perfect Codes and Related Concepts.
Des. Codes Cryptography 22(3): 221-237 (2001) |
| 70 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
Extremal problems under dimension constraints.
Electronic Notes in Discrete Mathematics 10: 154-156 (2001) |
| 69 | | Rudolf Ahlswede,
Peter Löber:
Quantum data processing.
IEEE Transactions on Information Theory 47(1): 474-478 (2001) |
| 2000 |
|---|
| 68 | | Rudolf Ahlswede,
Ning Cai,
Shuo-Yen Robert Li,
Raymond W. Yeung:
Network information flow.
IEEE Transactions on Information Theory 46(4): 1204-1216 (2000) |
| 1999 |
|---|
| 67 | | Rudolf Ahlswede,
Levon H. Khachatrian:
A Pushing-Pulling Method: New Proofs of Intersection Theorems.
Combinatorica 19(1): 1-15 (1999) |
| 66 | | Rudolf Ahlswede,
Ning Cai:
A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem.
Combinatorics, Probability & Computing 8(4): (1999) |
| 65 | | Rudolf Ahlswede,
Zhen Zhang:
On Maximal Shadows of Members in Left-compressed Sets.
Discrete Applied Mathematics 95(1-3): 3-9 (1999) |
| 64 | | Rudolf Ahlswede,
Vladimir B. Balakirsky:
Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel.
IEEE Transactions on Information Theory 45(1): 326-330 (1999) |
| 63 | | Rudolf Ahlswede,
Ning Cai:
Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True.
IEEE Transactions on Information Theory 45(2): 742-749 (1999) |
| 62 | | Rudolf Ahlswede,
Ning Cai:
Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission.
IEEE Transactions on Information Theory 45(2): 749-756 (1999) |
| 61 | | Rudolf Ahlswede,
Ning Cai:
Identification without randomization.
IEEE Transactions on Information Theory 45(7): 2636-2642 (1999) |
| 1998 |
|---|
| 60 | | Rudolf Ahlswede,
Z. Zhang:
Code pairs with specified parity of the Hamming distances.
Discrete Mathematics 188(1-3): 1-11 (1998) |
| 59 | | Rudolf Ahlswede,
Harout K. Aydinian,
Levon H. Khachatrian:
The Intersection Theorem for Direct Products.
Eur. J. Comb. 19(6): 649-661 (1998) |
| 58 | | Rudolf Ahlswede,
Imre Csiszár:
Common Randomness in Information Theory and Cryptography - Part II: CR Capacity.
IEEE Transactions on Information Theory 44(1): 225-240 (1998) |
| 57 | | Rudolf Ahlswede,
Ning Cai:
Information and Control: Matching Channels.
IEEE Transactions on Information Theory 44(2): 542-563 (1998) |
| 56 | | Rudolf Ahlswede,
Ning Cai,
Zhen Zhang:
Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel.
IEEE Transactions on Information Theory 44(3): 1250-1252 (1998) |
| 1997 |
|---|
| 55 | | Rudolf Ahlswede,
Ning Cai:
Shadows and Isoperimetry Under the Sequence-Subsequence Relation.
Combinatorica 17(1): 11-29 (1997) |
| 54 | | Rudolf Ahlswede,
Levon H. Khachatrian:
Counterexample to the Frankl-Pach Conjecture for Uniform, Dense Families.
Combinatorica 17(2): 299-301 (1997) |
| 53 | | Rudolf Ahlswede,
Noga Alon,
Péter L. Erdös,
Miklós Ruszinkó,
László A. Székely:
Intersecting Systems.
Combinatorics, Probability & Computing 6(2): 127-137 (1997) |
| 52 | | Rudolf Ahlswede,
Levon H. Khachatrian:
The Complete Intersection Theorem for Systems of Finite Sets.
Eur. J. Comb. 18(2): 125-136 (1997) |
| 51 | | Rudolf Ahlswede,
Ning Cai:
General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods.
Eur. J. Comb. 18(4): 355-372 (1997) |
| 50 | | Rudolf Ahlswede,
Ning Cai:
General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions.
Eur. J. Comb. 18(5): 479-489 (1997) |
| 49 | | Rudolf Ahlswede,
Ning Cai,
Zhen Zhang:
On interactive communication.
IEEE Transactions on Information Theory 43(1): 22-37 (1997) |
| 48 | | Rudolf Ahlswede,
En-Hui Yang,
Zhen Zhang:
Identification via compressed data.
IEEE Transactions on Information Theory 43(1): 48-70 (1997) |
| 47 | | Rudolf Ahlswede,
Te Sun Han,
Kingo Kobayashi:
Universal coding of integers and unbounded search trees.
IEEE Transactions on Information Theory 43(2): 669-682 (1997) |
| 46 | | Rudolf Ahlswede,
Ning Cai:
Correlated sources help transmission over an arbitrarily varying channel.
IEEE Transactions on Information Theory 43(4): 1254-1255 (1997) |
| 45 | | Rudolf Ahlswede,
Ning Cai:
Models of Multi-User Write-Efficient Memories and General Diametric Theorems.
Inf. Comput. 135(1): 37-67 (1997) |
| 1996 |
|---|
| 44 | | Rudolf Ahlswede,
Levon H. Khachatrian:
A counterexample to Aharoni's strongly maximal matching conjecture.
Discrete Mathematics 149(1-3): 289 (1996) |
| 43 | | Rudolf Ahlswede,
Ning Cai:
Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets.
Eur. J. Comb. 17(8): 677-687 (1996) |
| 42 | | Rudolf Ahlswede,
Ning Cai,
Zhen Zhang:
Erasure, list, and detection zero-error capacities for low noise and a relation to identification.
IEEE Transactions on Information Theory 42(1): 55-62 (1996) |
| 41 | | Rudolf Ahlswede,
Levon H. Khachatrian:
The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets.
J. Comb. Theory, Ser. A 76(1): 121-138 (1996) |
| 1995 |
|---|
| 40 | | Rudolf Ahlswede,
Péter L. Erdös,
Niall Graham:
A Splitting Property of Maximal Antichains.
Combinatorica 15(4): 475-480 (1995) |
| 39 | | Rudolf Ahlswede,
Leonid A. Bassalygo,
Mark S. Pinsker:
Localized random and arbitrary errors in the light of arbitrarily varying channel theory.
IEEE Transactions on Information Theory 41(1): 14-25 (1995) |
| 38 | | Rudolf Ahlswede,
Zhen Zhang:
New directions in the theory of identification via channels.
IEEE Transactions on Information Theory 41(4): 1040-1050 (1995) |
| 1994 |
|---|
| 37 | | Rudolf Ahlswede,
Ning Cai:
On Partitioning and Packing Products with Rectangles.
Combinatorics, Probability & Computing 3: 429-434 (1994) |
| 36 | | Rudolf Ahlswede,
Gábor Simonyi:
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.
Discrete Mathematics 128(1-3): 389-394 (1994) |
| 35 | | Rudolf Ahlswede,
Levon H. Khachatrian:
The maximal length of cloud-antichains.
Discrete Mathematics 131(1-3): 9-15 (1994) |
| 34 | | Rudolf Ahlswede,
Zhen Zhang:
On multiuser write-efficient memories.
IEEE Transactions on Information Theory 40(3): 674-686 (1994) |
| 33 | | Rudolf Ahlswede,
Ning Cai:
On communication complexity of vector-valued functions.
IEEE Transactions on Information Theory 40(6): 2062- (1994) |
| 32 | | Rudolf Ahlswede,
Ingo Althöfer:
The Asymptotic Behavior of Diameters in the Average.
J. Comb. Theory, Ser. B 61(2): 167-177 (1994) |
| 1993 |
|---|
| 31 | | Rudolf Ahlswede,
Ning Cai:
Rank Formulas for Certain Products of Matrices.
Appl. Algebra Eng. Commun. Comput. 4: 253-261 (1993) |
| 30 | | Rudolf Ahlswede,
Ning Cai:
A generalization of the AZ identity.
Combinatorica 13(3): 241-248 (1993) |
| 29 | | Rudolf Ahlswede,
Ning Cai:
On Extremal Set Partitions in Cartesian Product Spaces.
Combinatorics, Probability & Computing 2: 211-220 (1993) |
| 28 | | Rudolf Ahlswede,
Imre Csiszár:
Common randomness in information theory and cryptography - I: Secret sharing.
IEEE Transactions on Information Theory 39(4): 1121-1132 (1993) |
| 27 | | Rudolf Ahlswede,
Leonid A. Bassalygo,
Mark S. Pinsker:
Nonbinary codes correcting localized errors.
IEEE Transactions on Information Theory 39(4): 1413- (1993) |
| 26 | | Rudolf Ahlswede:
The maximal error capacity of arbitrarily varying channels for constant list sizes.
IEEE Transactions on Information Theory 39(4): 1416- (1993) |
| 1992 |
|---|
| 25 | | Rudolf Ahlswede,
Ning Cai,
Zhen Zhang:
Diametric theorems in seuence spaces.
Combinatorica 12(1): 1-17 (1992) |
| 1991 |
|---|
| 24 | | Rudolf Ahlswede,
Gábor Simonyi:
Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory.
IEEE Transactions on Information Theory 37(4): 1143-1150 (1991) |
| 23 | | Rudolf Ahlswede,
Bart Verboven:
On identification via multiway channels with feedback.
IEEE Transactions on Information Theory 37(6): 1519-1526 (1991) |
| 22 | | Rudolf Ahlswede,
Ning Cai:
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.
IEEE Transactions on Information Theory 37(6): 1647- (1991) |
| 1990 |
|---|
| 21 | | Rudolf Ahlswede,
Z. Zhang:
On cloud-antichains and related configurations.
Discrete Mathematics 85(3): 225-245 (1990) |
| 20 | | Rudolf Ahlswede:
Extremal properties of rate distortion functions.
IEEE Transactions on Information Theory 36(1): 166- (1990) |
| 19 | | Rudolf Ahlswede,
Jian-ping Ye,
Zhen Zhang:
Creating Order in Sequence Spaces with Simple Machines
Inf. Comput. 89(1): 47-94 (1990) |
| 1989 |
|---|
| 18 | | Rudolf Ahlswede,
Gunter Dueck:
Identification via channels.
IEEE Transactions on Information Theory 35(1): 15-29 (1989) |
| 17 | | Rudolf Ahlswede,
Gunter Dueck:
Identification in the presence of feedback-A discovery of new capacity formulas.
IEEE Transactions on Information Theory 35(1): 30-36 (1989) |
| 16 | | Rudolf Ahlswede,
Zhen Zhang:
Coding for Write-Efficient Memory
Inf. Comput. 83(1): 80-97 (1989) |
| 1987 |
|---|
| 15 | | Rudolf Ahlswede,
Amiram H. Kaspi:
Optimal coding strategies for certain permuting channels.
IEEE Transactions on Information Theory 33(3): 310-314 (1987) |
| 1986 |
|---|
| 14 | | Rudolf Ahlswede,
Imre Csiszár:
Hypothesis testing with communication constraints.
IEEE Transactions on Information Theory 32(4): 533-542 (1986) |
| 13 | | Rudolf Ahlswede:
On multiple descriptions and team guessing.
IEEE Transactions on Information Theory 32(4): 543-549 (1986) |
| 12 | | Rudolf Ahlswede:
Arbitrarily varying channels with states sequence known to the sender.
IEEE Transactions on Information Theory 32(5): 621-629 (1986) |
| 1985 |
|---|
| 11 | | Rudolf Ahlswede:
The rate-distortion region for multiple descriptions without excess rate.
IEEE Transactions on Information Theory 31(6): 721-726 (1985) |
| 1984 |
|---|
| 10 | | Rudolf Ahlswede,
Abbas El Gamal,
King F. Pang:
A two-family extremal problem in hamming space.
Discrete Mathematics 49(1): 1-5 (1984) |
| 9 | | Rudolf Ahlswede:
Improvements of Winograd's result on computation in the presence of noise.
IEEE Transactions on Information Theory 30(6): 872- (1984) |
| 1983 |
|---|
| 8 | | Rudolf Ahlswede,
Klaus-Uwe Koschnick:
Note on an extremal problem arising for unreliable networks in parallel computing.
Discrete Mathematics 47: 137-152 (1983) |
| 7 | | Rudolf Ahlswede,
Te Sun Han:
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): 396-411 (1983) |
| 1982 |
|---|
| 6 | | Rudolf Ahlswede,
Gunter Dueck:
Good codes can be produced by a few permutations.
IEEE Transactions on Information Theory 28(3): 430-442 (1982) |
| 1981 |
|---|
| 5 | | Rudolf Ahlswede,
Imre Csiszár:
To get a bit of information may be as hard as to get full information.
IEEE Transactions on Information Theory 27(4): 398-408 (1981) |
| 1980 |
|---|
| 4 | | Rudolf Ahlswede:
Simple hypergraphs with maximal number of adjacent pairs of edges.
J. Comb. Theory, Ser. B 28(2): 164-167 (1980) |
| 1971 |
|---|
| 3 | | Rudolf Ahlswede,
J. Gemma:
Bounds on Algebraic Code Capacities for Noisy Channels. I
Information and Control 19(2): 124-145 (1971) |
| 2 | | Rudolf Ahlswede,
J. Gemma:
Bounds on Algebraic Code Capacities for Noisy Channels. II
Information and Control 19(2): 146-158 (1971) |
| 1969 |
|---|
| 1 | | Rudolf Ahlswede,
Jacob Wolfowitz:
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions
Information and Control 14(5): 457-473 (1969) |
