Rudolf Ahlswede

According to our database1, Rudolf Ahlswede authored at least 179 papers between 1969 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2013
The Restricted Word Shadow Problem.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Threshold and Majority Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

On Oblivious Transfer Capacity.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

New Construction of Error-Tolerant Pooling Designs.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Classical Results on Primitive and Recent Results on Cross-Primitive Sequences.
Proceedings of the Mathematics of Paul Erdős I, 2013

Cross-Disjoint Pairs of Clouds in the Interval Lattice.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
On Generic Erasure Correcting Sets and Related Problems.
IEEE Trans. Inf. Theory, 2012

Shadows under the word-subword relation.
Probl. Inf. Transm., 2012

Finding one of <i>D</i> defective elements in some group testing models.
Probl. Inf. Transm., 2012

2011
On Security of Statistical Databases.
SIAM J. Discret. Math., 2011

Majority group testing with density tests.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Bounds for threshold and majority group testing.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
CoRR, 2010

Every channel with time structure has a capacity sequence.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Entanglement transmission over arbitrarily varying quantum channels.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Two Batch Search With Lie Cost.
IEEE Trans. Inf. Theory, 2009

Interactive Communication, Diagnosis and Error Control in Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

09281 Abstracts Collection - Search Methodologies.
Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

2008
Error Control Codes for Parallel Asymmetric Channels.
IEEE Trans. Inf. Theory, 2008

Searching with lies under error cost constraints.
Discret. Appl. Math., 2008

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

General theory of information transfer: Updated.
Discret. Appl. Math., 2008

Preface.
Discret. Appl. Math., 2008

A Diametric Theorem in Z <sup>n</sup><sub>m</sub> for Lee and Related Distances.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

Lectures on advances in combinatorics.
Universitext, Springer, ISBN: 978-3-540-78601-6, 2008

2007
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels.
IEEE Trans. Inf. Theory, 2007

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

2006
An Interpretation of Identification Entropy.
IEEE Trans. Inf. Theory, 2006

Maximal sets of numbers not containing <i>k</i>+1 pairwise coprimes and having divisors from a specified set of primes.
J. Comb. Theory, Ser. A, 2006

Intersection theorems under dimension constraints.
J. Comb. Theory, Ser. A, 2006

Construction of asymmetric connectors of depth two.
J. Comb. Theory, Ser. A, 2006

On q-ary codes correcting all unidirectional errors of a limited magnitude
CoRR, 2006

Another diametric theorem in Hamming spaces: optimal group anticodes.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Capacity of Quantum Arbitrarily Varying Channels.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding".
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Large Families of Pseudorandom Sequences of <i>k</i> Symbols and Their Complexity - Part II.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Large Families of Pseudorandom Sequences of <i>k</i> Symbols and Their Complexity - Part I.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Intersection Graphs of Rectangles and Segments.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Appendix: On Common Information and Related Characteristics of Correlated Information Sources.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Search with Noisy and Delayed Responses.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Finding <i>C</i><sub><i>NRI</i></sub>(<i>W</i>), the Identification Capacity of the AVC <i>W</i>, if Randomization in the Encoding Is Excluded.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Appendix: On Set Coverings in Cartesian Product Spaces.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

An Outside Opinion.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

On Concepts of Performance Parameters for Channels.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Information Theory and Some Friendly Neighbors - Ein Wunschkonzert.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Rudolf Ahlswede - From 60 to 66.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Introduction.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Non--binary error correcting codes with noiseless feedback, localized errors, or both.
Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

2005
Estimating with randomized encoding the joint empirical distribution in a correlated source.
Electron. Notes Discret. Math., 2005

On partitions of a rectangle into rectangles with restricted number of cross sections.
Electron. Notes Discret. Math., 2005

Report on models of write-efficient memories with localized errors and defects.
Electron. Notes Discret. Math., 2005

Large families of pseudorandom sequences of k symbols and their complexity, Part I.
Electron. Notes Discret. Math., 2005

Large families of pseudorandom sequences of k symbols and their complexity, Part II.
Electron. Notes Discret. Math., 2005

On attractive and friendly sets in sequence spaces.
Electron. Notes Discret. Math., 2005

Testing of Hypothesis and Identification.
Electron. Notes Discret. Math., 2005

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers.
Electron. Notes Discret. Math., 2005

On the correlation of binary sequences.
Electron. Notes Discret. Math., 2005

Searching with lies under error transition cost constraints.
Electron. Notes Discret. Math., 2005

Watermarking Identification Codes with Related Topics on Common Randomness.
Electron. Notes Discret. Math., 2005

Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder.
Electron. Notes Discret. Math., 2005

Search with noisy and delayed response.
Electron. Notes Discret. Math., 2005

Codes with the identifiable parent property and the multiple-access channel.
Electron. Notes Discret. Math., 2005

A Strong Converse Theorem for Quantum Multiple Access Channels.
Electron. Notes Discret. Math., 2005

A Kraft-type inequality for d-delay binary search codes.
Electron. Notes Discret. Math., 2005

Identification for Sources.
Electron. Notes Discret. Math., 2005

T-shift synchronization codes.
Electron. Notes Discret. Math., 2005

A Fast Suffix-Sorting Algorithm.
Electron. Notes Discret. Math., 2005

Multiple Packing in Sum-type Metric Spaces.
Electron. Notes Discret. Math., 2005

Correlation Inequalities in Function Spaces.
Electron. Notes Discret. Math., 2005

On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information.
Electron. Notes Discret. Math., 2005

Information theoretic models in language evolution.
Electron. Notes Discret. Math., 2005

Sparse asymmetric connectors in communication networks.
Electron. Notes Discret. Math., 2005

On diagnosability of large multiprocessor networks.
Electron. Notes Discret. Math., 2005

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

Identification Entropy.
Electron. Notes Discret. Math., 2005

General theory of information transfer.
Electron. Notes Discret. Math., 2005

Editorial Note.
Electron. Notes Discret. Math., 2005

Forbidden (0, 1)-vectors in Hyperplanes of R<sup>n</sup>: The unrestricted case.
Des. Codes Cryptogr., 2005

2004
On Lossless Quantum Data Compression With a Classical Helper.
IEEE Trans. Inf. Theory, 2004

Katona's Intersection Theorem: Four Proofs.
Comb., 2004

On Shadows Of Intersecting Families.
Comb., 2004

Language evolution and information theory.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Addendum to "Strong converse for identification via quantum channels".
IEEE Trans. Inf. Theory, 2003

Large Deviations in Quantum Information Theory.
Probl. Inf. Transm., 2003

A complexity measure for families of binary sequences.
Period. Math. Hung., 2003

More about shifting techniques.
Eur. J. Comb., 2003

Maximal antichains under dimension constraints.
Discret. Math., 2003

Cone Dependence - A Basic Combinatorial Concept.
Des. Codes Cryptogr., 2003

Forbidden (0, 1)-Vectors in Hyperplanes of R<sup>n</sup>: The Restricted Case.
Des. Codes Cryptogr., 2003

Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace.
Comb., 2003

2002
Strong converse for identification via quantum channels.
IEEE Trans. Inf. Theory, 2002

Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback.
IEEE Trans. Inf. Theory, 2002

Parallel error correcting codes.
IEEE Trans. Inf. Theory, 2002

The t-intersection Problem in the Truncated Boolean Lattice.
Eur. J. Comb., 2002

2001
Quantum data processing.
IEEE Trans. Inf. Theory, 2001

An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection.
Probl. Inf. Transm., 2001

On primitive sets of squarefree integers.
Period. Math. Hung., 2001

Extremal problems under dimension constraints.
Electron. Notes Discret. Math., 2001

On Perfect Codes and Related Concepts.
Des. Codes Cryptogr., 2001

2000
Network information flow.
IEEE Trans. Inf. Theory, 2000

1999
Identification without randomization.
IEEE Trans. Inf. Theory, 1999

Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission.
IEEE Trans. Inf. Theory, 1999

Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True.
IEEE Trans. Inf. Theory, 1999

Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel.
IEEE Trans. Inf. Theory, 1999

On Maximal Shadows of Members in Left-compressed Sets.
Discret. Appl. Math., 1999

A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem.
Comb. Probab. Comput., 1999

A Pushing-Pulling Method: New Proofs of Intersection Theorems.
Comb., 1999

1998
Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel.
IEEE Trans. Inf. Theory, 1998

Information and Control: Matching Channels.
IEEE Trans. Inf. Theory, 1998

Common Randomness in Information Theory and Cryptography - Part II: CR Capacity.
IEEE Trans. Inf. Theory, 1998

The Intersection Theorem for Direct Products.
Eur. J. Comb., 1998

Code pairs with specified parity of the Hamming distances.
Discret. Math., 1998

1997
Identification via compressed data.
IEEE Trans. Inf. Theory, 1997

Universal coding of integers and unbounded search trees.
IEEE Trans. Inf. Theory, 1997

On interactive communication.
IEEE Trans. Inf. Theory, 1997

Correlated sources help transmission over an arbitrarily varying channel.
IEEE Trans. Inf. Theory, 1997

Models of Multi-User Write-Efficient Memories and General Diametric Theorems.
Inf. Comput., 1997

The Complete Intersection Theorem for Systems of Finite Sets.
Eur. J. Comb., 1997

General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions.
Eur. J. Comb., 1997

General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods.
Eur. J. Comb., 1997

Intersecting Systems.
Comb. Probab. Comput., 1997

Counterexample to the Frankl-Pach Conjecture for Uniform, Dense Families.
Comb., 1997

Shadows and Isoperimetry Under the Sequence-Subsequence Relation.
Comb., 1997

1996
Erasure, list, and detection zero-error capacities for low noise and a relation to identification.
IEEE Trans. Inf. Theory, 1996

The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets.
J. Comb. Theory, Ser. A, 1996

Optimal pairs of incomparable clouds in multisets.
Graphs Comb., 1996

Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets.
Eur. J. Comb., 1996

A counterexample to Aharoni's strongly maximal matching conjecture.
Discret. Math., 1996

1995
New directions in the theory of identification via channels.
IEEE Trans. Inf. Theory, 1995

Localized random and arbitrary errors in the light of arbitrarily varying channel theory.
IEEE Trans. Inf. Theory, 1995

Towards characterizing equality in correlation inequalities.
Eur. J. Comb., 1995

A Splitting Property of Maximal Antichains.
Comb., 1995

1994
On multiuser write-efficient memories.
IEEE Trans. Inf. Theory, 1994

On communication complexity of vector-valued functions.
IEEE Trans. Inf. Theory, 1994

The Asymptotic Behavior of Diameters in the Average.
J. Comb. Theory, Ser. B, 1994

On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.
Discret. Math., 1994

The maximal length of cloud-antichains.
Discret. Math., 1994

On Partitioning and Packing Products with Rectangles.
Comb. Probab. Comput., 1994

1993
Common randomness in information theory and cryptography - I: Secret sharing.
IEEE Trans. Inf. Theory, 1993

Nonbinary codes correcting localized errors.
IEEE Trans. Inf. Theory, 1993

The maximal error capacity of arbitrarily varying channels for constant list sizes.
IEEE Trans. Inf. Theory, 1993

On Extremal Set Partitions in Cartesian Product Spaces.
Comb. Probab. Comput., 1993

A generalization of the AZ identity.
Comb., 1993

Rank Formulas for Certain Products of Matrices.
Appl. Algebra Eng. Commun. Comput., 1993

1992
Diametric theorems in seuence spaces.
Comb., 1992

1991
On identification via multiway channels with feedback.
IEEE Trans. Inf. Theory, 1991

Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory.
IEEE Trans. Inf. Theory, 1991

Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.
IEEE Trans. Inf. Theory, 1991

1990
Creating Order in Sequence Spaces with Simple Machines
Inf. Comput., November, 1990

Extremal properties of rate distortion functions.
IEEE Trans. Inf. Theory, 1990

On cloud-antichains and related configurations.
Discret. Math., 1990

1989
Coding for Write-Efficient Memory
Inf. Comput., October, 1989

Identification in the presence of feedback-A discovery of new capacity formulas.
IEEE Trans. Inf. Theory, 1989

Identification via channels.
IEEE Trans. Inf. Theory, 1989

1988
Inequalities for Code Pairs.
Eur. J. Comb., 1988

1987
Optimal coding strategies for certain permuting channels.
IEEE Trans. Inf. Theory, 1987

1986
Hypothesis testing with communication constraints.
IEEE Trans. Inf. Theory, 1986

Arbitrarily varying channels with states sequence known to the sender.
IEEE Trans. Inf. Theory, 1986

On multiple descriptions and team guessing.
IEEE Trans. Inf. Theory, 1986

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

1984
Improvements of Winograd's result on computation in the presence of noise.
IEEE Trans. Inf. Theory, 1984

A two-family extremal problem in hamming space.
Discret. Math., 1984

1983
On source coding with side information via a multiple-access channel and related problems in multi-user information theory.
IEEE Trans. Inf. Theory, 1983

Note on an extremal problem arising for unreliable networks in parallel computing.
Discret. Math., 1983

1982
Good codes can be produced by a few permutations.
IEEE Trans. Inf. Theory, 1982

1981
To get a bit of information may be as hard as to get full information.
IEEE Trans. Inf. Theory, 1981

1980
Simple hypergraphs with maximal number of adjacent pairs of edges.
J. Comb. Theory, Ser. B, 1980

1977
Contributions to the geometry of hamming spaces.
Discret. Math., 1977

1975
Source coding with side information and a converse for degraded broadcast channels.
IEEE Trans. Inf. Theory, 1975

1971
Bounds on Algebraic Code Capacities for Noisy Channels. II
Inf. Control., September, 1971

Bounds on Algebraic Code Capacities for Noisy Channels. I
Inf. Control., September, 1971

1969
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions
Inf. Control., May, 1969


  Loading...