Rudolf Ahlswede

211 papers B 13Journal 148Unranked 43
YearRankTypeTitle / Venue / Authors
2021 — book
Identification and Other Probabilistic Models - Rudolf Ahlswede's Lectures on Information Theory 6
Rudolf Ahlswede
2013 — ch.
Classical Results on Primitive and Recent Results on Cross-Primitive Sequences.
The Mathematics of Paul Erdős I
Rudolf Ahlswede, Levan H. Khachatrian
2013 — ch.
Cross-Disjoint Pairs of Clouds in the Interval Lattice.
The Mathematics of Paul Erdős I
Rudolf Ahlswede, Ning Cai
2013 — conf
New Construction of Error-Tolerant Pooling Designs.
Information Theory, Combinatorics, and Search Theory
Rudolf Ahlswede, Harout K. Aydinian
2013 — conf
On Oblivious Transfer Capacity.
Information Theory, Combinatorics, and Search Theory
Rudolf Ahlswede, Imre Csiszár
2013 — conf
The Restricted Word Shadow Problem.
Information Theory, Combinatorics, and Search Theory
Rudolf Ahlswede, Vladimir S. Lebedev
2013 — conf
Threshold and Majority Group Testing.
Information Theory, Combinatorics, and Search Theory
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
2012 J jnl
Finding one of
Probl. Inf. Transm.
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
2012 J jnl
On Generic Erasure Correcting Sets and Related Problems.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Harout K. Aydinian
2012 J jnl
Shadows under the word-subword relation.
Probl. Inf. Transm.
Rudolf Ahlswede, Vladimir S. Lebedev
2011 B conf
Bounds for threshold and majority group testing.
ISIT
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
2011 B conf
Majority group testing with density tests.
ISIT
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
2011 J jnl
On Security of Statistical Databases.
SIAM J. Discret. Math.
Rudolf Ahlswede, Harout K. Aydinian
2011 J jnl
On generic erasure correcting sets and related problems
CoRR
Rudolf Ahlswede, Harout K. Aydinian
2010 J jnl
Entanglement Transmission over Arbitrarily Varying Quantum Channels.
CoRR
Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel
2010 B conf
Entanglement transmission over arbitrarily varying quantum channels.
ISIT
Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel
2010 B conf
Every channel with time structure has a capacity sequence.
ITW
Rudolf Ahlswede
2010 J jnl
Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
CoRR
Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel
2009 — conf
09281 Abstracts Collection - Search Methodologies.
Search Methodologies
Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro
2009 — conf
Interactive Communication, Diagnosis and Error Control in Networks.
Algorithmics of Large and Complex Networks
Rudolf Ahlswede, Harout K. Aydinian
2009 B conf
On oblivious transfer capacity.
ITW
Rudolf Ahlswede, Imre Csiszár
2009 — ed.
Search Methodologies, 05.07. - 10.07.2009
Search Methodologies
Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro
2009 J jnl
Two Batch Search With Lie Cost.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro
2008 — conf
A Diametric Theorem in Z
ICMCTA
Rudolf Ahlswede, Faina I. Solov'eva
2008 J jnl
Error Control Codes for Parallel Asymmetric Channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Harout K. Aydinian
2008 J jnl
General theory of information transfer: Updated.
Discret. Appl. Math.
Rudolf Ahlswede
2008 — book
Lectures on advances in combinatorics.
Rudolf Ahlswede, Vladimir M. Blinovsky
2008 J jnl
Multiple packing in sum-type metric spaces.
Discret. Appl. Math.
Rudolf Ahlswede, Vladimir M. Blinovsky
2008 J jnl
On diagnosability of large multiprocessor networks.
Discret. Appl. Math.
Rudolf Ahlswede, Harout K. Aydinian
2008 J jnl
On the correlation of binary sequences.
Discret. Appl. Math.
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
2008 J jnl
Preface.
Discret. Appl. Math.
Rudolf Ahlswede
2008 J jnl
Ratewise-optimal non-sequential search strategies under constraints on the tests.
Discret. Appl. Math.
Rudolf Ahlswede
2008 J jnl
Searching with lies under error cost constraints.
Discret. Appl. Math.
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe
2008 J jnl
T-shift synchronization codes.
Discret. Appl. Math.
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner
2007 J jnl
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Vladimir M. Blinovsky
2007 B conf
On Oblivious Transfer Capacity.
ISIT
Rudolf Ahlswede, Imre Csiszár
2007 J jnl
The final form of Tao's inequality relating conditional expectation and conditional mutual information.
Adv. Math. Commun.
Rudolf Ahlswede
2006 — conf
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein
2006 — conf
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein
2006 — conf
A Fast Suffix-Sorting Algorithm.
GTIT-C
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich
2006 — conf
A Kraft-Type Inequality for d-Delay Binary Search Codes.
GTIT-C
Rudolf Ahlswede, Ning Cai
2006 — conf
A Strong Converse Theorem for Quantum Multiple Access Channels.
GTIT-C
Rudolf Ahlswede, Ning Cai
2006 J jnl
An Interpretation of Identification Entropy.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
2006 — conf
An Outside Opinion.
GTIT-C
Rudolf Ahlswede
2006 B conf
Another diametric theorem in Hamming spaces: optimal group anticodes.
ITW
Rudolf Ahlswede
2006 — conf
Appendix: On Common Information and Related Characteristics of Correlated Information Sources.
GTIT-C
Rudolf Ahlswede, János Körner
2006 — conf
Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs.
GTIT-C
Rudolf Ahlswede, Ning Cai
2006 — conf
Appendix: On Set Coverings in Cartesian Product Spaces.
GTIT-C
Rudolf Ahlswede
2006 — conf
Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem.
GTIT-C
Rudolf Ahlswede
2006 B conf
Capacity of Quantum Arbitrarily Varying Channels.
ISIT
Rudolf Ahlswede, Vladimir M. Blinovsky
2006 — conf
Codes with the Identifiable Parent Property and the Multiple-Access Channel.
GTIT-C
Rudolf Ahlswede, Ning Cai
2006 — ed.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein
2006 J jnl
Construction of asymmetric connectors of depth two.
J. Comb. Theory A
Rudolf Ahlswede, Harout K. Aydinian
2006 — conf
Correlation Inequalities in Function Spaces.
GTIT-C
Rudolf Ahlswede, Vladimir M. Blinovsky
2006 B conf
Error control codes for parallel asymmetric channels.
ISIT
Rudolf Ahlswede, Harout K. Aydinian
2006 — conf
Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source.
GTIT-C
Rudolf Ahlswede, Zhen Zhang
2006 — conf
Finding
GTIT-C
Rudolf Ahlswede
2006 — ed.
General Theory of Information Transfer and Combinatorics
GTIT-C
Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir M. Blinovsky, Christian Deppe, Haik Mashurian
2006 — conf
Identification Entropy.
GTIT-C
Rudolf Ahlswede
2006 — conf
Identification for Sources.
GTIT-C
Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter
2006 — conf
Information Theoretic Models in Language Evolution.
GTIT-C
Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
2006 — conf
Information Theory and Some Friendly Neighbors - Ein Wunschkonzert.
GTIT-C
Rudolf Ahlswede
2006 — conf
Intersection Graphs of Rectangles and Segments.
GTIT-C
Rudolf Ahlswede, Iskandar Karapetyan
2006 J jnl
Intersection theorems under dimension constraints.
J. Comb. Theory A
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2006 — conf
Introduction.
GTIT-C
Rudolf Ahlswede
2006 — conf
Large Families of Pseudorandom Sequences of
GTIT-C
Rudolf Ahlswede, Christian Mauduit, András Sárközy
2006 — conf
Large Families of Pseudorandom Sequences of
GTIT-C
Rudolf Ahlswede, Christian Mauduit, András Sárközy
2006 J jnl
Maximal sets of numbers not containing
J. Comb. Theory A
Rudolf Ahlswede, Vladimir M. Blinovsky
2006 — conf
Non--binary error correcting codes with noiseless feedback, localized errors, or both.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
2006 B conf
Non-binary error correcting codes with noiseless feedback, localized errors, or both.
ISIT
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
2006 — conf
On Attractive and Friendly Sets in Sequence Spaces.
GTIT-C
Rudolf Ahlswede, Levon H. Khachatrian
2006 — conf
On Concepts of Performance Parameters for Channels.
GTIT-C
Rudolf Ahlswede
2006 — conf
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information.
GTIT-C
Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian
2006 — conf
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification.
GTIT-C
Rudolf Ahlswede, Evgueni A. Haroutunian
2006 — conf
On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections.
GTIT-C
Rudolf Ahlswede, Alexander A. Yudin
2006 J jnl
On q-ary codes correcting all unidirectional errors of a limited magnitude
CoRR
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen
2006 B conf
On security of statistical databases.
ISIT
Rudolf Ahlswede, Harout K. Aydinian
2006 — conf
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding".
GTIT-C
Søren Riis, Rudolf Ahlswede
2006 — conf
Report on Models of Write-Efficient Memories with Localized Errors and Defects.
GTIT-C
Rudolf Ahlswede, Mark S. Pinsker
2006 — conf
Rudolf Ahlswede - From 60 to 66.
GTIT-C
Rudolf Ahlswede
2006 — conf
Search with Noisy and Delayed Responses.
GTIT-C
Rudolf Ahlswede, Ning Cai
2006 — conf
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer.
GTIT-C
Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang
2006 — conf
Sparse Asymmetric Connectors in Communication Networks.
GTIT-C
Rudolf Ahlswede, Harout K. Aydinian
2006 B conf
The final form of Tao's inequality relating conditional expectation and conditional mutual information.
ISIT
Rudolf Ahlswede
2006 — conf
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder.
GTIT-C
Rudolf Ahlswede, Ning Cai
2006 — conf
Watermarking Identification Codes with Related Topics on Common Randomness.
GTIT-C
Rudolf Ahlswede, Ning Cai
2005 J jnl
A Fast Suffix-Sorting Algorithm.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich
2005 J jnl
A Kraft-type inequality for d-delay binary search codes.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ning Cai
2005 J jnl
A Strong Converse Theorem for Quantum Multiple Access Channels.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ning Cai
2005 J jnl
Codes with the identifiable parent property and the multiple-access channel.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ning Cai
2005 J jnl
Correlation Inequalities in Function Spaces.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Vladimir M. Blinovsky
2005 J jnl
Editorial Note.
Electron. Notes Discret. Math.
Rudolf Ahlswede
2005 J jnl
Estimating with randomized encoding the joint empirical distribution in a correlated source.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Zhen Zhang
2005 J jnl
Forbidden (0, 1)-vectors in Hyperplanes of R
Des. Codes Cryptogr.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2005 J jnl
General theory of information transfer.
Electron. Notes Discret. Math.
Rudolf Ahlswede
2005 J jnl
Identification Entropy.
Electron. Notes Discret. Math.
Rudolf Ahlswede
2005 J jnl
Identification for Sources.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter
2005 J jnl
Information theoretic models in language evolution.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
2005 J jnl
Large families of pseudorandom sequences of k symbols and their complexity, Part I.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Christian Mauduit, András Sárközy
2005 J jnl
Large families of pseudorandom sequences of k symbols and their complexity, Part II.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Christian Mauduit, András Sárközy
2005 J jnl
Multiple Packing in Sum-type Metric Spaces.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Vladimir M. Blinovsky
2005 J jnl
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian
2005 J jnl
On attractive and friendly sets in sequence spaces.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Levon H. Khachatrian
2005 J jnl
On diagnosability of large multiprocessor networks.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Harout K. Aydinian
2005 J jnl
On partitions of a rectangle into rectangles with restricted number of cross sections.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Alexander A. Yudin
2005 J jnl
On the correlation of binary sequences.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
2005 J jnl
Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests.
Electron. Notes Discret. Math.
Rudolf Ahlswede
2005 J jnl
Report on models of write-efficient memories with localized errors and defects.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Mark S. Pinsker
2005 J jnl
Search with noisy and delayed response.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ning Cai
2005 J jnl
Searching with lies under error transition cost constraints.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe
2005 J jnl
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang
2005 J jnl
Sparse asymmetric connectors in communication networks.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Harout K. Aydinian
2005 J jnl
T-shift synchronization codes.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner
2005 J jnl
Testing of Hypothesis and Identification.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Evgueni A. Haroutunian
2005 J jnl
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ning Cai
2005 J jnl
Watermarking Identification Codes with Related Topics on Common Randomness.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Ning Cai
2004 J jnl
Katona's Intersection Theorem: Four Proofs.
Comb.
Rudolf Ahlswede, Levon H. Khachatrian
2004 B conf
Language evolution and information theory.
ISIT
Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
2004 J jnl
On Lossless Quantum Data Compression With a Classical Helper.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
2004 J jnl
On Shadows Of Intersecting Families.
Comb.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2003 J jnl
A complexity measure for families of binary sequences.
Period. Math. Hung.
Rudolf Ahlswede, Levon H. Khachatrian, Christian Mauduit, András Sárközy
2003 J jnl
Addendum to "Strong converse for identification via quantum channels".
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Andreas J. Winter
2003 J jnl
Cone Dependence - A Basic Combinatorial Concept.
Des. Codes Cryptogr.
Rudolf Ahlswede, Levon H. Khachatrian
2003 J jnl
Extremal problems under dimension constraints.
Discret. Math.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2003 J jnl
Forbidden (0, 1)-Vectors in Hyperplanes of R
Des. Codes Cryptogr.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2003 J jnl
Large Deviations in Quantum Information Theory.
Probl. Inf. Transm.
Rudolf Ahlswede, Vladimir M. Blinovsky
2003 J jnl
Maximal antichains under dimension constraints.
Discret. Math.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2003 J jnl
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace.
Comb.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2003 J jnl
More about shifting techniques.
Eur. J. Comb.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2002 J jnl
Parallel error correcting codes.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Bernhard Balkenhol, Ning Cai
2002 J jnl
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
2002 J jnl
Strong converse for identification via quantum channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Andreas J. Winter
2002 J jnl
The t-intersection Problem in the Truncated Boolean Lattice.
Eur. J. Comb.
Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian
2001 J jnl
An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection.
Probl. Inf. Transm.
Rudolf Ahlswede, Ning Cai, Christian Deppe
2001 J jnl
Extremal problems under dimension constraints.
Electron. Notes Discret. Math.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2001 J jnl
On Perfect Codes and Related Concepts.
Des. Codes Cryptogr.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
2001 J jnl
On primitive sets of squarefree integers.
Period. Math. Hung.
Rudolf Ahlswede, Levon H. Khachatrian, András Sárközy
2001 J jnl
Quantum data processing.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Peter Löber
2000 J jnl
Network information flow.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung
1999 J jnl
A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem.
Comb. Probab. Comput.
Rudolf Ahlswede, Ning Cai
1999 J jnl
A Pushing-Pulling Method: New Proofs of Intersection Theorems.
Comb.
Rudolf Ahlswede, Levon H. Khachatrian
1999 J jnl
Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
1999 J jnl
Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
1999 J jnl
Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Vladimir B. Balakirsky
1999 J jnl
Identification without randomization.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
1999 J jnl
On Maximal Shadows of Members in Left-compressed Sets.
Discret. Appl. Math.
Rudolf Ahlswede, Zhen Zhang
1998 J jnl
Code pairs with specified parity of the Hamming distances.
Discret. Math.
Rudolf Ahlswede, Zen Zhang
1998 J jnl
Common Randomness in Information Theory and Cryptography - Part II: CR Capacity.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Imre Csiszár
1998 J jnl
Information and Control: Matching Channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
1998 J jnl
The Intersection Theorem for Direct Products.
Eur. J. Comb.
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
1998 J jnl
Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai, Zhen Zhang
1997 J jnl
Correlated sources help transmission over an arbitrarily varying channel.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
1997 J jnl
Counterexample to the Frankl-Pach Conjecture for Uniform, Dense Families.
Comb.
Rudolf Ahlswede, Levon H. Khachatrian
1997 J jnl
General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods.
Eur. J. Comb.
Rudolf Ahlswede, Ning Cai
1997 J jnl
General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions.
Eur. J. Comb.
Rudolf Ahlswede, Ning Cai
1997 J jnl
Identification via compressed data.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, En-Hui Yang, Zhen Zhang
1997 J jnl
Intersecting Systems.
Comb. Probab. Comput.
Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
1997 J jnl
Models of Multi-User Write-Efficient Memories and General Diametric Theorems.
Inf. Comput.
Rudolf Ahlswede, Ning Cai
1997 J jnl
On interactive communication.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai, Zhen Zhang
1997 J jnl
Shadows and Isoperimetry Under the Sequence-Subsequence Relation.
Comb.
Rudolf Ahlswede, Ning Cai
1997 J jnl
The Complete Intersection Theorem for Systems of Finite Sets.
Eur. J. Comb.
Rudolf Ahlswede, Levon H. Khachatrian
1997 J jnl
Universal coding of integers and unbounded search trees.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Te Sun Han, Kingo Kobayashi
1996 J jnl
A counterexample to Aharoni's strongly maximal matching conjecture.
Discret. Math.
Rudolf Ahlswede, Levon H. Khachatrian
1996 J jnl
Erasure, list, and detection zero-error capacities for low noise and a relation to identification.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai, Zhen Zhang
1996 J jnl
Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets.
Eur. J. Comb.
Rudolf Ahlswede, Ning Cai
1996 J jnl
Optimal pairs of incomparable clouds in multisets.
Graphs Comb.
Rudolf Ahlswede, Levon H. Khachatrian
1996 J jnl
The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets.
J. Comb. Theory A
Rudolf Ahlswede, Levon H. Khachatrian
1995 J jnl
A Splitting Property of Maximal Antichains.
Comb.
Rudolf Ahlswede, Péter L. Erdös, Niall Graham
1995 J jnl
Localized random and arbitrary errors in the light of arbitrarily varying channel theory.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker
1995 J jnl
New directions in the theory of identification via channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Zhen Zhang
1995 J jnl
Towards characterizing equality in correlation inequalities.
Eur. J. Comb.
Rudolf Ahlswede, Levon H. Khachatrian
1994 J jnl
On Partitioning and Packing Products with Rectangles.
Comb. Probab. Comput.
Rudolf Ahlswede, Ning Cai
1994 J jnl
On communication complexity of vector-valued functions.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
1994 J jnl
On multiuser write-efficient memories.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Zhen Zhang
1994 J jnl
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.
Discret. Math.
Rudolf Ahlswede, Gábor Simonyi
1994 J jnl
The Asymptotic Behavior of Diameters in the Average.
J. Comb. Theory B
Rudolf Ahlswede, Ingo Althöfer
1994 J jnl
The maximal length of cloud-antichains.
Discret. Math.
Rudolf Ahlswede, Levon H. Khachatrian
1993 J jnl
A generalization of the AZ identity.
Comb.
Rudolf Ahlswede, Ning Cai
1993 J jnl
Common randomness in information theory and cryptography - I: Secret sharing.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Imre Csiszár
1993 J jnl
Nonbinary codes correcting localized errors.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker
1993 J jnl
On Extremal Set Partitions in Cartesian Product Spaces.
Comb. Probab. Comput.
Rudolf Ahlswede, Ning Cai
1993 J jnl
Rank Formulas for Certain Products of Matrices.
Appl. Algebra Eng. Commun. Comput.
Rudolf Ahlswede, Ning Cai
1993 J jnl
The maximal error capacity of arbitrarily varying channels for constant list sizes.
IEEE Trans. Inf. Theory
Rudolf Ahlswede
1992 J jnl
Diametric theorems in seuence spaces.
Comb.
Rudolf Ahlswede, Ning Cai, Zhen Zhang
1991 J jnl
On identification via multiway channels with feedback.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Bart Verboven
1991 J jnl
Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Gábor Simonyi
1991 J jnl
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Ning Cai
1990 J jnl
Creating Order in Sequence Spaces with Simple Machines
Inf. Comput.
Rudolf Ahlswede, Jian-ping Ye, Zhen Zhang
1990 J jnl
Extremal properties of rate distortion functions.
IEEE Trans. Inf. Theory
Rudolf Ahlswede
1990 J jnl
On cloud-antichains and related configurations.
Discret. Math.
Rudolf Ahlswede, Zen Zhang
1989 J jnl
Coding for Write-Efficient Memory
Inf. Comput.
Rudolf Ahlswede, Zhen Zhang
1989 J jnl
Identification in the presence of feedback-A discovery of new capacity formulas.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Gunter Dueck
1989 J jnl
Identification via channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Gunter Dueck
1988 J jnl
Inequalities for Code Pairs.
Eur. J. Comb.
Rudolf Ahlswede, Michael Mörs
1987 J jnl
Optimal coding strategies for certain permuting channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Amiram H. Kaspi
1986 J jnl
Arbitrarily varying channels with states sequence known to the sender.
IEEE Trans. Inf. Theory
Rudolf Ahlswede
1986 J jnl
Hypothesis testing with communication constraints.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Imre Csiszár
1986 J jnl
On multiple descriptions and team guessing.
IEEE Trans. Inf. Theory
Rudolf Ahlswede
1985 J jnl
The rate-distortion region for multiple descriptions without excess rate.
IEEE Trans. Inf. Theory
Rudolf Ahlswede
1984 J jnl
A two-family extremal problem in hamming space.
Discret. Math.
Rudolf Ahlswede, Abbas El Gamal, King F. Pang
1984 J jnl
Improvements of Winograd's result on computation in the presence of noise.
IEEE Trans. Inf. Theory
Rudolf Ahlswede
1983 J jnl
Note on an extremal problem arising for unreliable networks in parallel computing.
Discret. Math.
Rudolf Ahlswede, Klaus-Uwe Koschnick
1983 J jnl
On source coding with side information via a multiple-access channel and related problems in multi-user information theory.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Te Sun Han
1982 J jnl
Good codes can be produced by a few permutations.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Gunter Dueck
1981 J jnl
To get a bit of information may be as hard as to get full information.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, Imre Csiszár
1980 J jnl
Simple hypergraphs with maximal number of adjacent pairs of edges.
J. Comb. Theory B
Rudolf Ahlswede
1977 J jnl
Contributions to the geometry of hamming spaces.
Discret. Math.
Rudolf Ahlswede, Gyula O. H. Katona
1975 J jnl
Source coding with side information and a converse for degraded broadcast channels.
IEEE Trans. Inf. Theory
Rudolf Ahlswede, János Körner
1971 J jnl
Bounds on Algebraic Code Capacities for Noisy Channels. I
Inf. Control.
Rudolf Ahlswede, J. Gemma
1971 J jnl
Bounds on Algebraic Code Capacities for Noisy Channels. II
Inf. Control.
Rudolf Ahlswede, J. Gemma
1969 J jnl
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions
Inf. Control.
Rudolf Ahlswede, Jacob Wolfowitz