Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions - Rudolf Ahlswede; Jacob Wolfowitz (Inf. Control., 1969)

Bounds on Algebraic Code Capacities for Noisy Channels. I - Rudolf Ahlswede; J. Gemma (Inf. Control., 1971)

Bounds on Algebraic Code Capacities for Noisy Channels. II - Rudolf Ahlswede; J. Gemma (Inf. Control., 1971)

Source coding with side information and a converse for degraded broadcast channels. - Rudolf Ahlswede; János Körner (IEEE Trans. Inf. Theory, 1975)

Contributions to the geometry of hamming spaces. - Rudolf Ahlswede; Gyula O. H. Katona (Discret. Math., 1977)

Simple hypergraphs with maximal number of adjacent pairs of edges. - Rudolf Ahlswede (J. Comb. Theory B, 1980)

To get a bit of information may be as hard as to get full information. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1981)

Good codes can be produced by a few permutations. - Rudolf Ahlswede; Gunter Dueck (IEEE Trans. Inf. Theory, 1982)

Note on an extremal problem arising for unreliable networks in parallel computing. - Rudolf Ahlswede; Klaus-Uwe Koschnick (Discret. Math., 1983)

On source coding with side information via a multiple-access channel and related problems in multi-user information theory. - Rudolf Ahlswede; Te Sun Han (IEEE Trans. Inf. Theory, 1983)

A two-family extremal problem in hamming space. - Rudolf Ahlswede; Abbas El Gamal; King F. Pang (Discret. Math., 1984)

Improvements of Winograd's result on computation in the presence of noise. - Rudolf Ahlswede (IEEE Trans. Inf. Theory, 1984)

The rate-distortion region for multiple descriptions without excess rate. - Rudolf Ahlswede (IEEE Trans. Inf. Theory, 1985)

On multiple descriptions and team guessing. - Rudolf Ahlswede (IEEE Trans. Inf. Theory, 1986)

Arbitrarily varying channels with states sequence known to the sender. - Rudolf Ahlswede (IEEE Trans. Inf. Theory, 1986)

Hypothesis testing with communication constraints. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1986)

Optimal coding strategies for certain permuting channels. - Rudolf Ahlswede; Amiram H. Kaspi (IEEE Trans. Inf. Theory, 1987)

Inequalities for Code Pairs. - Rudolf Ahlswede; Michael Mörs (Eur. J. Comb., 1988)

Identification via channels. - Rudolf Ahlswede; Gunter Dueck (IEEE Trans. Inf. Theory, 1989)

Identification in the presence of feedback-A discovery of new capacity formulas. - Rudolf Ahlswede; Gunter Dueck (IEEE Trans. Inf. Theory, 1989)

Coding for Write-Efficient Memory - Rudolf Ahlswede; Zhen Zhang 010 (Inf. Comput., 1989)

On cloud-antichains and related configurations. - Rudolf Ahlswede; Zen Zhang (Discret. Math., 1990)

Extremal properties of rate distortion functions. - Rudolf Ahlswede (IEEE Trans. Inf. Theory, 1990)

Creating Order in Sequence Spaces with Simple Machines - Rudolf Ahlswede; Jian-ping Ye; Zhen Zhang 010 (Inf. Comput., 1990)

Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1991)

Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory. - Rudolf Ahlswede; Gábor Simonyi (IEEE Trans. Inf. Theory, 1991)

On identification via multiway channels with feedback. - Rudolf Ahlswede; Bart Verboven (IEEE Trans. Inf. Theory, 1991)

Diametric theorems in seuence spaces. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (Comb., 1992)

Rank Formulas for Certain Products of Matrices. - Rudolf Ahlswede; Ning Cai 001 (Appl. Algebra Eng. Commun. Comput., 1993)

A generalization of the AZ identity. - Rudolf Ahlswede; Ning Cai 001 (Comb., 1993)

On Extremal Set Partitions in Cartesian Product Spaces. - Rudolf Ahlswede; Ning Cai 001 (Comb. Probab. Comput., 1993)

The maximal error capacity of arbitrarily varying channels for constant list sizes. - Rudolf Ahlswede (IEEE Trans. Inf. Theory, 1993)

Nonbinary codes correcting localized errors. - Rudolf Ahlswede; Leonid A. Bassalygo; Mark S. Pinsker (IEEE Trans. Inf. Theory, 1993)

Common randomness in information theory and cryptography - I: Secret sharing. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1993)

On Partitioning and Packing Products with Rectangles. - Rudolf Ahlswede; Ning Cai 001 (Comb. Probab. Comput., 1994)

The maximal length of cloud-antichains. - Rudolf Ahlswede; Levon H. Khachatrian (Discret. Math., 1994)

On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. - Rudolf Ahlswede; Gábor Simonyi (Discret. Math., 1994)

The Asymptotic Behavior of Diameters in the Average. - Rudolf Ahlswede; Ingo Althöfer (J. Comb. Theory B, 1994)

On communication complexity of vector-valued functions. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1994)

On multiuser write-efficient memories. - Rudolf Ahlswede; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1994)

A Splitting Property of Maximal Antichains. - Rudolf Ahlswede; Péter L. Erdös; Niall Graham (Comb., 1995)

Towards characterizing equality in correlation inequalities. - Rudolf Ahlswede; Levon H. Khachatrian (Eur. J. Comb., 1995)

Localized random and arbitrary errors in the light of arbitrarily varying channel theory. - Rudolf Ahlswede; Leonid A. Bassalygo; Mark S. Pinsker (IEEE Trans. Inf. Theory, 1995)

New directions in the theory of identification via channels. - Rudolf Ahlswede; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1995)

A counterexample to Aharoni's strongly maximal matching conjecture. - Rudolf Ahlswede; Levon H. Khachatrian (Discret. Math., 1996)

Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets. - Rudolf Ahlswede; Ning Cai 001 (Eur. J. Comb., 1996)

Optimal pairs of incomparable clouds in multisets. - Rudolf Ahlswede; Levon H. Khachatrian (Graphs Comb., 1996)

The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets. - Rudolf Ahlswede; Levon H. Khachatrian (J. Comb. Theory A, 1996)

Erasure, list, and detection zero-error capacities for low noise and a relation to identification. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1996)

Shadows and Isoperimetry Under the Sequence-Subsequence Relation. - Rudolf Ahlswede; Ning Cai 001 (Comb., 1997)

Counterexample to the Frankl-Pach Conjecture for Uniform, Dense Families. - Rudolf Ahlswede; Levon H. Khachatrian (Comb., 1997)

Intersecting Systems. - Rudolf Ahlswede; Noga Alon; Péter L. Erdös; Miklós Ruszinkó; László A. Székely (Comb. Probab. Comput., 1997)

General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods. - Rudolf Ahlswede; Ning Cai 001 (Eur. J. Comb., 1997)

General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions. - Rudolf Ahlswede; Ning Cai 001 (Eur. J. Comb., 1997)

The Complete Intersection Theorem for Systems of Finite Sets. - Rudolf Ahlswede; Levon H. Khachatrian (Eur. J. Comb., 1997)

Models of Multi-User Write-Efficient Memories and General Diametric Theorems. - Rudolf Ahlswede; Ning Cai 001 (Inf. Comput., 1997)

Correlated sources help transmission over an arbitrarily varying channel. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1997)

On interactive communication. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1997)

Universal coding of integers and unbounded search trees. - Rudolf Ahlswede; Te Sun Han; Kingo Kobayashi (IEEE Trans. Inf. Theory, 1997)

Identification via compressed data. - Rudolf Ahlswede; En-Hui Yang; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1997)

Code pairs with specified parity of the Hamming distances. - Rudolf Ahlswede; Zen Zhang (Discret. Math., 1998)

The Intersection Theorem for Direct Products. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Eur. J. Comb., 1998)

Common Randomness in Information Theory and Cryptography - Part II: CR Capacity. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1998)

Information and Control: Matching Channels. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1998)

Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1998)

A Pushing-Pulling Method: New Proofs of Intersection Theorems. - Rudolf Ahlswede; Levon H. Khachatrian (Comb., 1999)

A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem. - Rudolf Ahlswede; Ning Cai 001 (Comb. Probab. Comput., 1999)

On Maximal Shadows of Members in Left-compressed Sets. - Rudolf Ahlswede; Zhen Zhang 010 (Discret. Appl. Math., 1999)

Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel. - Rudolf Ahlswede; Vladimir B. Balakirsky (IEEE Trans. Inf. Theory, 1999)

Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1999)

Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1999)

Identification without randomization. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1999)

Network information flow. - Rudolf Ahlswede; Ning Cai 001; Shuo-Yen Robert Li; Raymond W. Yeung (IEEE Trans. Inf. Theory, 2000)

On Perfect Codes and Related Concepts. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Des. Codes Cryptogr., 2001)

Extremal problems under dimension constraints. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Electron. Notes Discret. Math., 2001)

On primitive sets of squarefree integers. - Rudolf Ahlswede; Levon H. Khachatrian; András Sárközy (Period. Math. Hung., 2001)

An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection. - Rudolf Ahlswede; Ning Cai 001; Christian Deppe (Probl. Inf. Transm., 2001)

Quantum data processing. - Rudolf Ahlswede; Peter Löber (IEEE Trans. Inf. Theory, 2001)

The t-intersection Problem in the Truncated Boolean Lattice. - Rudolf Ahlswede; Christian Bey; Konrad Engel; Levon H. Khachatrian (Eur. J. Comb., 2002)

Parallel error correcting codes. - Rudolf Ahlswede; Bernhard Balkenhol; Ning Cai 001 (IEEE Trans. Inf. Theory, 2002)

Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 2002)

Strong converse for identification via quantum channels. - Rudolf Ahlswede; Andreas J. Winter 002 (IEEE Trans. Inf. Theory, 2002)

Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Comb., 2003)

Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Des. Codes Cryptogr., 2003)

Cone Dependence - A Basic Combinatorial Concept. - Rudolf Ahlswede; Levon H. Khachatrian (Des. Codes Cryptogr., 2003)

Maximal antichains under dimension constraints. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Discret. Math., 2003)

More about shifting techniques. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Eur. J. Comb., 2003)

A complexity measure for families of binary sequences. - Rudolf Ahlswede; Levon H. Khachatrian; Christian Mauduit; András Sárközy (Period. Math. Hung., 2003)

Large Deviations in Quantum Information Theory. - Rudolf Ahlswede; Vladimir M. Blinovsky (Probl. Inf. Transm., 2003)

Addendum to "Strong converse for identification via quantum channels". - Rudolf Ahlswede; Andreas J. Winter 002 (IEEE Trans. Inf. Theory, 2003)

Language evolution and information theory. - Rudolf Ahlswede; Erdal Arikan; Lars Bäumer; Christian Deppe (ISIT, 2004)

On Shadows Of Intersecting Families. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Comb., 2004)

Katona's Intersection Theorem: Four Proofs. - Rudolf Ahlswede; Levon H. Khachatrian (Comb., 2004)

On Lossless Quantum Data Compression With a Classical Helper. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 2004)

Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (Des. Codes Cryptogr., 2005)

Editorial Note. - Rudolf Ahlswede (Electron. Notes Discret. Math., 2005)

General theory of information transfer. - Rudolf Ahlswede (Electron. Notes Discret. Math., 2005)

Identification Entropy. - Rudolf Ahlswede (Electron. Notes Discret. Math., 2005)

Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests. - Rudolf Ahlswede (Electron. Notes Discret. Math., 2005)

Sparse asymmetric connectors in communication networks. - Rudolf Ahlswede; Harout K. Aydinian (Electron. Notes Discret. Math., 2005)

Information theoretic models in language evolution. - Rudolf Ahlswede; Erdal Arikan; Lars Bäumer; Christian Deppe (Electron. Notes Discret. Math., 2005)

On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information. - Rudolf Ahlswede; Ella Aloyan; Evgueni A. Haroutunian (Electron. Notes Discret. Math., 2005)

Correlation Inequalities in Function Spaces. - Rudolf Ahlswede; Vladimir M. Blinovsky (Electron. Notes Discret. Math., 2005)

A Fast Suffix-Sorting Algorithm. - Rudolf Ahlswede; Bernhard Balkenhol; Christian Deppe; Martin Fröhlich (Electron. Notes Discret. Math., 2005)

Identification for Sources. - Rudolf Ahlswede; Bernhard Balkenhol; Christian Kleinewächter (Electron. Notes Discret. Math., 2005)

A Kraft-type inequality for d-delay binary search codes. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

A Strong Converse Theorem for Quantum Multiple Access Channels. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Codes with the identifiable parent property and the multiple-access channel. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Search with noisy and delayed response. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Watermarking Identification Codes with Related Topics on Common Randomness. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Searching with lies under error transition cost constraints. - Rudolf Ahlswede; Ferdinando Cicalese; Christian Deppe (Electron. Notes Discret. Math., 2005)

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers. - Rudolf Ahlswede; Ning Cai 001; Zhaozhi Zhang (Electron. Notes Discret. Math., 2005)

Testing of Hypothesis and Identification. - Rudolf Ahlswede; Evgueni A. Haroutunian (Electron. Notes Discret. Math., 2005)

On attractive and friendly sets in sequence spaces. - Rudolf Ahlswede; Levon H. Khachatrian (Electron. Notes Discret. Math., 2005)

Large families of pseudorandom sequences of k symbols and their complexity, Part II. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (Electron. Notes Discret. Math., 2005)

Large families of pseudorandom sequences of k symbols and their complexity, Part I. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (Electron. Notes Discret. Math., 2005)

Report on models of write-efficient memories with localized errors and defects. - Rudolf Ahlswede; Mark S. Pinsker (Electron. Notes Discret. Math., 2005)

On partitions of a rectangle into rectangles with restricted number of cross sections. - Rudolf Ahlswede; Alexander A. Yudin (Electron. Notes Discret. Math., 2005)

Estimating with randomized encoding the joint empirical distribution in a correlated source. - Rudolf Ahlswede; Zhen Zhang 010 (Electron. Notes Discret. Math., 2005)

06201 Executive Summary – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. - Rudolf Ahlswede; Alberto Apostolico; Vladimir I. Levenshtein (Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 2006)

06201 Abstracts Collection – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. - Rudolf Ahlswede; Alberto Apostolico; Vladimir I. Levenshtein (Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 2006)

Introduction. - Rudolf Ahlswede (GTIT-C, 2006)

Rudolf Ahlswede - From 60 to 66. - Rudolf Ahlswede (GTIT-C, 2006)

Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. - Rudolf Ahlswede (GTIT-C, 2006)

On Concepts of Performance Parameters for Channels. - Rudolf Ahlswede (GTIT-C, 2006)

An Outside Opinion. - Rudolf Ahlswede (GTIT-C, 2006)

Appendix: On Set Coverings in Cartesian Product Spaces. - Rudolf Ahlswede (GTIT-C, 2006)

Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. - Rudolf Ahlswede (GTIT-C, 2006)

Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded. - Rudolf Ahlswede (GTIT-C, 2006)

On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information. - Rudolf Ahlswede; Ella Aloyan; Evgueni A. Haroutunian (GTIT-C, 2006)

Search with Noisy and Delayed Responses. - Rudolf Ahlswede; Ning Cai 001 (GTIT-C, 2006)

Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. - Rudolf Ahlswede; Ning Cai 001 (GTIT-C, 2006)

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. - Rudolf Ahlswede; Ning Cai 001; Zhaozhi Zhang (GTIT-C, 2006)

On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. - Rudolf Ahlswede; Evgueni A. Haroutunian (GTIT-C, 2006)

Appendix: On Common Information and Related Characteristics of Correlated Information Sources. - Rudolf Ahlswede; János Körner (GTIT-C, 2006)

Intersection Graphs of Rectangles and Segments. - Rudolf Ahlswede; Iskandar Karapetyan (GTIT-C, 2006)

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (GTIT-C, 2006)

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II. - Rudolf Ahlswede; Christian Mauduit; András Sárközy (GTIT-C, 2006)

Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". - Søren Riis; Rudolf Ahlswede (GTIT-C, 2006)

Capacity of Quantum Arbitrarily Varying Channels. - Rudolf Ahlswede; Vladimir M. Blinovsky (ISIT, 2006)

Non-binary error correcting codes with noiseless feedback, localized errors, or both. - Rudolf Ahlswede; Christian Deppe; Vladimir S. Lebedev (ISIT, 2006)

Another diametric theorem in Hamming spaces: optimal group anticodes. - Rudolf Ahlswede (ITW, 2006)

On q-ary codes correcting all unidirectional errors of a limited magnitude - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian; Ludo M. G. M. Tolhuizen (CoRR, 2006)

Construction of asymmetric connectors of depth two. - Rudolf Ahlswede; Harout K. Aydinian (J. Comb. Theory A, 2006)

Intersection theorems under dimension constraints. - Rudolf Ahlswede; Harout K. Aydinian; Levon H. Khachatrian (J. Comb. Theory A, 2006)

Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. - Rudolf Ahlswede; Vladimir M. Blinovsky (J. Comb. Theory A, 2006)

An Interpretation of Identification Entropy. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 2006)

The final form of Tao's inequality relating conditional expectation and conditional mutual information. - Rudolf Ahlswede (Adv. Math. Commun., 2007)

Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. - Rudolf Ahlswede; Vladimir M. Blinovsky (IEEE Trans. Inf. Theory, 2007)

Lectures on advances in combinatorics. - Rudolf Ahlswede; Vladimir M. Blinovsky (Springer, 2008)

A Diametric Theorem in Z nm for Lee and Related Distances. - Rudolf Ahlswede; Faina I. Solov'eva (ICMCTA, 2008)

Preface. - Rudolf Ahlswede (Discret. Appl. Math., 2008)

General theory of information transfer: Updated. - Rudolf Ahlswede (Discret. Appl. Math., 2008)

Ratewise-optimal non-sequential search strategies under constraints on the tests. - Rudolf Ahlswede (Discret. Appl. Math., 2008)

On diagnosability of large multiprocessor networks. - Rudolf Ahlswede; Harout K. Aydinian (Discret. Appl. Math., 2008)

Multiple packing in sum-type metric spaces. - Rudolf Ahlswede; Vladimir M. Blinovsky (Discret. Appl. Math., 2008)

T-shift synchronization codes. - Rudolf Ahlswede; Bernhard Balkenhol; Christian Deppe; Haik Mashurian; T. Partner (Discret. Appl. Math., 2008)

Searching with lies under error cost constraints. - Rudolf Ahlswede; Ferdinando Cicalese; Christian Deppe (Discret. Appl. Math., 2008)

On the correlation of binary sequences. - Rudolf Ahlswede; Julien Cassaigne; András Sárközy (Discret. Appl. Math., 2008)

Error Control Codes for Parallel Asymmetric Channels. - Rudolf Ahlswede; Harout K. Aydinian (IEEE Trans. Inf. Theory, 2008)

09281 Abstracts Collection - Search Methodologies. - Rudolf Ahlswede; Ferdinando Cicalese; Ugo Vaccaro (Search Methodologies, 2009)

Interactive Communication, Diagnosis and Error Control in Networks. - Rudolf Ahlswede; Harout K. Aydinian (Algorithmics of Large and Complex Networks, 2009)

On oblivious transfer capacity. - Rudolf Ahlswede; Imre Csiszár (ITW, 2009)

Two Batch Search With Lie Cost. - Rudolf Ahlswede; Ferdinando Cicalese; Christian Deppe; Ugo Vaccaro (IEEE Trans. Inf. Theory, 2009)

Entanglement transmission over arbitrarily varying quantum channels. - Rudolf Ahlswede; Igor Bjelakovic; Holger Boche; Janis Noetzel (ISIT, 2010)

Every channel with time structure has a capacity sequence. - Rudolf Ahlswede (ITW, 2010)

Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels - Rudolf Ahlswede; Igor Bjelakovic; Holger Boche; Janis Noetzel (CoRR, 2010)

Bounds for threshold and majority group testing. - Rudolf Ahlswede; Christian Deppe; Vladimir S. Lebedev (ISIT, 2011)

Majority group testing with density tests. - Rudolf Ahlswede; Christian Deppe; Vladimir S. Lebedev (ISIT, 2011)

On Security of Statistical Databases. - Rudolf Ahlswede; Harout K. Aydinian (SIAM J. Discret. Math., 2011)

Finding one of D defective elements in some group testing models. - Rudolf Ahlswede; Christian Deppe; Vladimir S. Lebedev (Probl. Inf. Transm., 2012)

Shadows under the word-subword relation. - Rudolf Ahlswede; Vladimir S. Lebedev (Probl. Inf. Transm., 2012)

On Generic Erasure Correcting Sets and Related Problems. - Rudolf Ahlswede; Harout K. Aydinian (IEEE Trans. Inf. Theory, 2012)

Cross-Disjoint Pairs of Clouds in the Interval Lattice. - Rudolf Ahlswede; Ning Cai 001 (The Mathematics of Paul Erdős I, 2013)

Classical Results on Primitive and Recent Results on Cross-Primitive Sequences. - Rudolf Ahlswede; Levan H. Khachatrian (The Mathematics of Paul Erdős I, 2013)

New Construction of Error-Tolerant Pooling Designs. - Rudolf Ahlswede; Harout K. Aydinian (Information Theory, Combinatorics, and Search Theory, 2013)

Threshold and Majority Group Testing. - Rudolf Ahlswede; Christian Deppe; Vladimir S. Lebedev (Information Theory, Combinatorics, and Search Theory, 2013)

The Restricted Word Shadow Problem. - Rudolf Ahlswede; Vladimir S. Lebedev (Information Theory, Combinatorics, and Search Theory, 2013)

Identification and Other Probabilistic Models - Rudolf Ahlswede's Lectures on Information Theory 6 - Rudolf Ahlswede (Springer, 2021)