Rudolf Ahlswede

Publication Activity (10 Years)

Years Active: 1969-2013
Publications (10 Years): 0

Top Venues

Information Theory, Combinatorics, and Search Theory

Probl. Inf. Transm.

IEEE Trans. Inf. Theory

Publications

Rudolf Ahlswede, Imre Csiszár
On Oblivious Transfer Capacity. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
Threshold and Majority Group Testing. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Vladimir S. Lebedev
The Restricted Word Shadow Problem. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Harout K. Aydinian
New Construction of Error-Tolerant Pooling Designs. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Harout K. Aydinian
On Generic Erasure Correcting Sets and Related Problems. IEEE Trans. Inf. Theory 58 (2) (2012)
Rudolf Ahlswede, Vladimir S. Lebedev
Shadows under the word-subword relation. Probl. Inf. Transm. 48 (1) (2012)
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
defective elements in some group testing models. Probl. Inf. Transm. 48 (2) (2012)
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
Majority group testing with density tests. ISIT (2011)
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
Bounds for threshold and majority group testing. ISIT (2011)
Rudolf Ahlswede, Harout K. Aydinian
On Security of Statistical Databases. SIAM J. Discret. Math. 25 (4) (2011)
Rudolf Ahlswede, Harout K. Aydinian
On generic erasure correcting sets and related problems CoRR (2011)
Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel
Entanglement transmission over arbitrarily varying quantum channels. ISIT (2010)
Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel
Entanglement Transmission over Arbitrarily Varying Quantum Channels. CoRR (2010)
Rudolf Ahlswede
Every channel with time structure has a capacity sequence. ITW (2010)
Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel
Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels CoRR (2010)
Rudolf Ahlswede, Imre Csiszár
On oblivious transfer capacity. ITW (2009)
Rudolf Ahlswede, Ferdinando Cicalese, Ugo Vaccaro
09281 Abstracts Collection - Search Methodologies. Search Methodologies (2009)
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro
Two Batch Search With Lie Cost. IEEE Trans. Inf. Theory 55 (4) (2009)
Rudolf Ahlswede, Harout K. Aydinian
Interactive Communication, Diagnosis and Error Control in Networks. Algorithmics of Large and Complex Networks (2009)
Rudolf Ahlswede, Vladimir M. Blinovsky
Multiple packing in sum-type metric spaces. Discret. Appl. Math. 156 (9) (2008)
Rudolf Ahlswede
Preface. Discret. Appl. Math. 156 (9) (2008)
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe
Searching with lies under error cost constraints. Discret. Appl. Math. 156 (9) (2008)
Rudolf Ahlswede, Faina I. Solov'eva
for Lee and Related Distances. ICMCTA (2008)
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
On the correlation of binary sequences. Discret. Appl. Math. 156 (9) (2008)
Rudolf Ahlswede, Harout K. Aydinian
Error Control Codes for Parallel Asymmetric Channels. IEEE Trans. Inf. Theory 54 (2) (2008)
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner
T-shift synchronization codes. Discret. Appl. Math. 156 (9) (2008)
Rudolf Ahlswede
General theory of information transfer: Updated. Discret. Appl. Math. 156 (9) (2008)
Rudolf Ahlswede, Harout K. Aydinian
On diagnosability of large multiprocessor networks. Discret. Appl. Math. 156 (18) (2008)
Rudolf Ahlswede
Ratewise-optimal non-sequential search strategies under constraints on the tests. Discret. Appl. Math. 156 (9) (2008)
Rudolf Ahlswede
The final form of Tao's inequality relating conditional expectation and conditional mutual information. Adv. Math. Commun. 1 (2) (2007)
Rudolf Ahlswede, Vladimir M. Blinovsky
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. IEEE Trans. Inf. Theory 53 (2) (2007)
Rudolf Ahlswede, Imre Csiszár
On Oblivious Transfer Capacity. ISIT (2007)
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)
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
Non-binary error correcting codes with noiseless feedback, localized errors, or both. ISIT (2006)
Rudolf Ahlswede, Vladimir M. Blinovsky
Correlation Inequalities in Function Spaces. GTIT-C (2006)
Rudolf Ahlswede, Zhen Zhang
Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source. GTIT-C (2006)
Rudolf Ahlswede, Vladimir M. Blinovsky
Capacity of Quantum Arbitrarily Varying Channels. ISIT (2006)
Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter
Identification for Sources. GTIT-C (2006)
Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
Information Theoretic Models in Language Evolution. GTIT-C (2006)
Rudolf Ahlswede, Ning Cai
Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. GTIT-C (2006)
Rudolf Ahlswede
Introduction. GTIT-C (2006)
Rudolf Ahlswede
, if Randomization in the Encoding Is Excluded. GTIT-C (2006)
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)
Rudolf Ahlswede
Appendix: On Set Coverings in Cartesian Product Spaces. GTIT-C (2006)
Rudolf Ahlswede, Harout K. Aydinian
Construction of asymmetric connectors of depth two. J. Comb. Theory, Ser. A 113 (8) (2006)
Rudolf Ahlswede, Ning Cai
Search with Noisy and Delayed Responses. GTIT-C (2006)
Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. GTIT-C (2006)
Rudolf Ahlswede
An Outside Opinion. GTIT-C (2006)
Rudolf Ahlswede, Levon H. Khachatrian
On Attractive and Friendly Sets in Sequence Spaces. GTIT-C (2006)
Rudolf Ahlswede, Mark S. Pinsker
Report on Models of Write-Efficient Memories with Localized Errors and Defects. GTIT-C (2006)
Rudolf Ahlswede, Ning Cai
Watermarking Identification Codes with Related Topics on Common Randomness. GTIT-C (2006)
Rudolf Ahlswede, Christian Mauduit, András Sárközy
Symbols and Their Complexity - Part II. GTIT-C (2006)
Rudolf Ahlswede
Another diametric theorem in Hamming spaces: optimal group anticodes. ITW (2006)
Rudolf Ahlswede, Ning Cai
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. GTIT-C (2006)
Rudolf Ahlswede, Ning Cai
A Strong Converse Theorem for Quantum Multiple Access Channels. GTIT-C (2006)
Rudolf Ahlswede, János Körner
Appendix: On Common Information and Related Characteristics of Correlated Information Sources. GTIT-C (2006)
Rudolf Ahlswede, Ning Cai
An Interpretation of Identification Entropy. IEEE Trans. Inf. Theory 52 (9) (2006)
Rudolf Ahlswede, Iskandar Karapetyan
Intersection Graphs of Rectangles and Segments. GTIT-C (2006)
Rudolf Ahlswede, Ning Cai
A Kraft-Type Inequality for d-Delay Binary Search Codes. GTIT-C (2006)
Rudolf Ahlswede, Harout K. Aydinian
Sparse Asymmetric Connectors in Communication Networks. GTIT-C (2006)
Rudolf Ahlswede, Vladimir M. Blinovsky
+1 pairwise coprimes and having divisors from a specified set of primes. J. Comb. Theory, Ser. A 113 (8) (2006)
Rudolf Ahlswede
Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. GTIT-C (2006)
Rudolf Ahlswede, Ning Cai
Codes with the Identifiable Parent Property and the Multiple-Access Channel. GTIT-C (2006)
Rudolf Ahlswede, Harout K. Aydinian
Error control codes for parallel asymmetric channels. ISIT (2006)
Rudolf Ahlswede, Harout K. Aydinian
On security of statistical databases. ISIT (2006)
Rudolf Ahlswede, Christian Mauduit, András Sárközy
Symbols and Their Complexity - Part I. GTIT-C (2006)
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
Intersection theorems under dimension constraints. J. Comb. Theory, Ser. A 113 (3) (2006)
Rudolf Ahlswede
Rudolf Ahlswede - From 60 to 66. GTIT-C (2006)
Rudolf Ahlswede
The final form of Tao's inequality relating conditional expectation and conditional mutual information. ISIT (2006)
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 (2006)
Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information. GTIT-C (2006)
Rudolf Ahlswede
Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. GTIT-C (2006)
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)
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich
A Fast Suffix-Sorting Algorithm. GTIT-C (2006)
Rudolf Ahlswede
On Concepts of Performance Parameters for Channels. GTIT-C (2006)
Rudolf Ahlswede, Alexander A. Yudin
On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections. GTIT-C (2006)
Rudolf Ahlswede
Identification Entropy. GTIT-C (2006)
Rudolf Ahlswede, Evgueni A. Haroutunian
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. GTIT-C (2006)
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
Non--binary error correcting codes with noiseless feedback, localized errors, or both. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Rudolf Ahlswede, Harout K. Aydinian
Sparse asymmetric connectors in communication networks. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter
Identification for Sources. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Ning Cai
Codes with the identifiable parent property and the multiple-access channel. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
Information theoretic models in language evolution. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Mark S. Pinsker
Report on models of write-efficient memories with localized errors and defects. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Zhen Zhang
Estimating with randomized encoding the joint empirical distribution in a correlated source. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede
General theory of information transfer. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Christian Mauduit, András Sárközy
Large families of pseudorandom sequences of k symbols and their complexity, Part I. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
: The unrestricted case. Des. Codes Cryptogr. 37 (1) (2005)
Rudolf Ahlswede
Editorial Note. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Alexander A. Yudin
On partitions of a rectangle into rectangles with restricted number of cross sections. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe
Searching with lies under error transition cost constraints. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Levon H. Khachatrian
On attractive and friendly sets in sequence spaces. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Vladimir M. Blinovsky
Multiple Packing in Sum-type Metric Spaces. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Ning Cai
Watermarking Identification Codes with Related Topics on Common Randomness. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Vladimir M. Blinovsky
Correlation Inequalities in Function Spaces. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Julien Cassaigne, András Sárközy
On the correlation of binary sequences. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich
A Fast Suffix-Sorting Algorithm. Electron. Notes Discret. Math. 21 (2005)
Rudolf Ahlswede, Evgueni A. Haroutunian
Testing of Hypothesis and Identification. Electron. Notes Discret. Math. 21 (2005)

Rudolf Ahlswede.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rudolf Ahlswede