Rudolf Ahlswede

16, Springer, ISBN: 978-3-030-65070-4, 2021

2013

The Restricted Word Shadow Problem.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Threshold and Majority Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

On Oblivious Transfer Capacity.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

New Construction of Error-Tolerant Pooling Designs.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Classical Results on Primitive and Recent Results on Cross-Primitive Sequences.

[BibT_eX]

[DOI]

Levan H. Khachatrian

Proceedings of the Mathematics of Paul Erdős I, 2013

Cross-Disjoint Pairs of Clouds in the Interval Lattice.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős I, 2013

2012

On Generic Erasure Correcting Sets and Related Problems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Shadows under the word-subword relation.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

Finding one of D defective elements in some group testing models.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

2011

On Security of Statistical Databases.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Majority group testing with density tests.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Bounds for threshold and majority group testing.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels

[BibT_eX]

[DOI]

CoRR, 2010

Every channel with time structure has a capacity sequence.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Entanglement transmission over arbitrarily varying quantum channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Two Batch Search With Lie Cost.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Interactive Communication, Diagnosis and Error Control in Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

09281 Abstracts Collection - Search Methodologies.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Ugo Vaccaro

Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

2008

Error Control Codes for Parallel Asymmetric Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Searching with lies under error cost constraints.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Discret. Appl. Math., 2008

Ratewise-optimal non-sequential search strategies under constraints on the tests.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

General theory of information transfer: Updated.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

A Diametric Theorem in Z nm for Lee and Related Distances.

[BibT_eX]

[DOI]

Faina I. Solov'eva

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

Lectures on advances in combinatorics.

[BibT_eX]

Universitext, Springer, ISBN: 978-3-540-78601-6, 2008

2007

Classical Capacity of Classical-Quantum Arbitrarily Varying Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

The final form of Tao's inequality relating conditional expectation and conditional mutual information.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2007

2006

An Interpretation of Identification Entropy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2006

Intersection theorems under dimension constraints.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2006

Construction of asymmetric connectors of depth two.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2006

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

[BibT_eX]

[DOI]

Ludo M. G. M. Tolhuizen

CoRR, 2006

Another diametric theorem in Hamming spaces: optimal group anticodes.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Capacity of Quantum Arbitrarily Varying Channels.

[BibT_eX]

[DOI]

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".

[BibT_eX]

[DOI]

Søren Riis

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

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II.

[BibT_eX]

[DOI]

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

Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I.

[BibT_eX]

[DOI]

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

Intersection Graphs of Rectangles and Segments.

[BibT_eX]

[DOI]

Iskandar Karapetyan

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

Appendix: On Common Information and Related Characteristics of Correlated Information Sources.

[BibT_eX]

[DOI]

János Körner

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

On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification.

[BibT_eX]

[DOI]

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

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer.

[BibT_eX]

[DOI]

Zhaozhi Zhang

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

Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs.

[BibT_eX]

[DOI]

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

Search with Noisy and Delayed Responses.

[BibT_eX]

[DOI]

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

On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information.

[BibT_eX]

[DOI]

Ella Aloyan

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

Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Appendix: On Set Coverings in Cartesian Product Spaces.

[BibT_eX]

[DOI]

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

An Outside Opinion.

[BibT_eX]

[DOI]

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

On Concepts of Performance Parameters for Channels.

[BibT_eX]

[DOI]

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

Information Theory and Some Friendly Neighbors - Ein Wunschkonzert.

[BibT_eX]

[DOI]

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

Rudolf Ahlswede - From 60 to 66.

[BibT_eX]

[DOI]

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

Introduction.

[BibT_eX]

[DOI]

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

Non--binary error correcting codes with noiseless feedback, localized errors, or both.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Alberto Apostolico

Vladimir I. Levenshtein

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.

[BibT_eX]

[DOI]

Alberto Apostolico

Vladimir I. Levenshtein

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.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On partitions of a rectangle into rectangles with restricted number of cross sections.

[BibT_eX]

[DOI]

Alexander A. Yudin

Electron. Notes Discret. Math., 2005

Report on models of write-efficient memories with localized errors and defects.

[BibT_eX]

[DOI]

Mark S. Pinsker

Electron. Notes Discret. Math., 2005

Large families of pseudorandom sequences of k symbols and their complexity, Part I.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Large families of pseudorandom sequences of k symbols and their complexity, Part II.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On attractive and friendly sets in sequence spaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Testing of Hypothesis and Identification.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers.

[BibT_eX]

[DOI]

Zhaozhi Zhang

Electron. Notes Discret. Math., 2005

On the correlation of binary sequences.

[BibT_eX]

[DOI]

Julien Cassaigne

Electron. Notes Discret. Math., 2005

Searching with lies under error transition cost constraints.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Electron. Notes Discret. Math., 2005

Watermarking Identification Codes with Related Topics on Common Randomness.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Search with noisy and delayed response.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Codes with the identifiable parent property and the multiple-access channel.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

A Strong Converse Theorem for Quantum Multiple Access Channels.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

A Kraft-type inequality for d-delay binary search codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Identification for Sources.

[BibT_eX]

[DOI]

Bernhard Balkenhol

Christian Kleinewächter

Electron. Notes Discret. Math., 2005

T-shift synchronization codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

A Fast Suffix-Sorting Algorithm.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Multiple Packing in Sum-type Metric Spaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Correlation Inequalities in Function Spaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information.

[BibT_eX]

[DOI]

Ella Aloyan

Electron. Notes Discret. Math., 2005

Information theoretic models in language evolution.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Sparse asymmetric connectors in communication networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On diagnosability of large multiprocessor networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Identification Entropy.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

General theory of information transfer.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Editorial Note.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

2004

On Lossless Quantum Data Compression With a Classical Helper.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Katona's Intersection Theorem: Four Proofs.

[BibT_eX]

[DOI]

Comb., 2004

On Shadows Of Intersecting Families.

[BibT_eX]

[DOI]

Comb., 2004

Language evolution and information theory.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Addendum to "Strong converse for identification via quantum channels".

[BibT_eX]

[DOI]

Andreas J. Winter

IEEE Trans. Inf. Theory, 2003

Large Deviations in Quantum Information Theory.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2003

A complexity measure for families of binary sequences.

[BibT_eX]

[DOI]

Period. Math. Hung., 2003

More about shifting techniques.

[BibT_eX]

[DOI]

Eur. J. Comb., 2003

Maximal antichains under dimension constraints.

[BibT_eX]

[DOI]

Discret. Math., 2003

Cone Dependence - A Basic Combinatorial Concept.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

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

[BibT_eX]

[DOI]

Comb., 2003

2002

Strong converse for identification via quantum channels.

[BibT_eX]

[DOI]

Andreas J. Winter

IEEE Trans. Inf. Theory, 2002

Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Parallel error correcting codes.

[BibT_eX]

[DOI]

Bernhard Balkenhol

IEEE Trans. Inf. Theory, 2002

The t-intersection Problem in the Truncated Boolean Lattice.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

2001

Quantum data processing.

[BibT_eX]

[DOI]

Peter Löber

IEEE Trans. Inf. Theory, 2001

An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2001

On primitive sets of squarefree integers.

[BibT_eX]

[DOI]

Period. Math. Hung., 2001

Extremal problems under dimension constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On Perfect Codes and Related Concepts.

[BibT_eX]

Des. Codes Cryptogr., 2001

2000

Network information flow.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1999

Identification without randomization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel.

[BibT_eX]

[DOI]

Vladimir B. Balakirsky

IEEE Trans. Inf. Theory, 1999

On Maximal Shadows of Members in Left-compressed Sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

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

[BibT_eX]

[DOI]

Comb., 1999

1998

Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Information and Control: Matching Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Common Randomness in Information Theory and Cryptography - Part II: CR Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

The Intersection Theorem for Direct Products.

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

Code pairs with specified parity of the Hamming distances.

[BibT_eX]

[DOI]

Zen Zhang

Discret. Math., 1998

1997

Identification via compressed data.

[BibT_eX]

[DOI]

En-Hui Yang

IEEE Trans. Inf. Theory, 1997

Universal coding of integers and unbounded search trees.

[BibT_eX]

[DOI]

Te Sun Han

Kingo Kobayashi

IEEE Trans. Inf. Theory, 1997

On interactive communication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Correlated sources help transmission over an arbitrarily varying channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Models of Multi-User Write-Efficient Memories and General Diametric Theorems.

[BibT_eX]

[DOI]

Inf. Comput., 1997

The Complete Intersection Theorem for Systems of Finite Sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1997

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

[BibT_eX]

[DOI]

Eur. J. Comb., 1997

General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods.

[BibT_eX]

[DOI]

Eur. J. Comb., 1997

Intersecting Systems.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

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

[BibT_eX]

[DOI]

Comb., 1997

Shadows and Isoperimetry Under the Sequence-Subsequence Relation.

[BibT_eX]

[DOI]

Comb., 1997

1996

Erasure, list, and detection zero-error capacities for low noise and a relation to identification.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1996

Optimal pairs of incomparable clouds in multisets.

[BibT_eX]

[DOI]

Graphs Comb., 1996

Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

A counterexample to Aharoni's strongly maximal matching conjecture.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

New directions in the theory of identification via channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Localized random and arbitrary errors in the light of arbitrarily varying channel theory.

[BibT_eX]

[DOI]

Leonid A. Bassalygo

Mark S. Pinsker

IEEE Trans. Inf. Theory, 1995

Towards characterizing equality in correlation inequalities.

[BibT_eX]

[DOI]

Eur. J. Comb., 1995

A Splitting Property of Maximal Antichains.

[BibT_eX]

[DOI]

Péter L. Erdös

Niall Graham

Comb., 1995

1994

On multiuser write-efficient memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

On communication complexity of vector-valued functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

The Asymptotic Behavior of Diameters in the Average.

[BibT_eX]

[DOI]

Ingo Althöfer

J. Comb. Theory, Ser. B, 1994

On the optimal structure of recovering set pairs in lattices: the sandglass conjecture.

[BibT_eX]

[DOI]

Gábor Simonyi

Discret. Math., 1994

The maximal length of cloud-antichains.

[BibT_eX]

[DOI]

Discret. Math., 1994

On Partitioning and Packing Products with Rectangles.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

1993

Common randomness in information theory and cryptography - I: Secret sharing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Nonbinary codes correcting localized errors.

[BibT_eX]

[DOI]

Leonid A. Bassalygo

Mark S. Pinsker

IEEE Trans. Inf. Theory, 1993

The maximal error capacity of arbitrarily varying channels for constant list sizes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

On Extremal Set Partitions in Cartesian Product Spaces.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1993

A generalization of the AZ identity.

[BibT_eX]

[DOI]

Comb., 1993

Rank Formulas for Certain Products of Matrices.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1993

1992

Diametric theorems in seuence spaces.

[BibT_eX]

[DOI]

Comb., 1992

1991

On identification via multiway channels with feedback.

[BibT_eX]

[DOI]

Bart Verboven

IEEE Trans. Inf. Theory, 1991

Reusable memories in the light of the old arbitrarily varying-and a new outputwise varying channel theory.

[BibT_eX]

[DOI]

Gábor Simonyi

IEEE Trans. Inf. Theory, 1991

Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1990

Creating Order in Sequence Spaces with Simple Machines

[BibT_eX]

[DOI]

Jian-ping Ye

Inf. Comput., November, 1990

Extremal properties of rate distortion functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

On cloud-antichains and related configurations.

[BibT_eX]

[DOI]

Zen Zhang

Discret. Math., 1990

1989

Coding for Write-Efficient Memory

[BibT_eX]

[DOI]

Inf. Comput., October, 1989

Identification in the presence of feedback-A discovery of new capacity formulas.

[BibT_eX]

[DOI]

Gunter Dueck

IEEE Trans. Inf. Theory, 1989

Identification via channels.

[BibT_eX]

[DOI]

Gunter Dueck

IEEE Trans. Inf. Theory, 1989

1988

Inequalities for Code Pairs.

[BibT_eX]

[DOI]

Michael Mörs

Eur. J. Comb., 1988

1987

Optimal coding strategies for certain permuting channels.

[BibT_eX]

[DOI]

Amiram H. Kaspi

IEEE Trans. Inf. Theory, 1987

1986

Hypothesis testing with communication constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

Arbitrarily varying channels with states sequence known to the sender.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

On multiple descriptions and team guessing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

1985

The rate-distortion region for multiple descriptions without excess rate.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

1984

Improvements of Winograd's result on computation in the presence of noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

A two-family extremal problem in hamming space.

[BibT_eX]

[DOI]

Abbas El Gamal

King F. Pang

Discret. Math., 1984

1983

On source coding with side information via a multiple-access channel and related problems in multi-user information theory.

[BibT_eX]

[DOI]

Te Sun Han

IEEE Trans. Inf. Theory, 1983

Note on an extremal problem arising for unreliable networks in parallel computing.

[BibT_eX]

[DOI]

Klaus-Uwe Koschnick

Discret. Math., 1983

1982

Good codes can be produced by a few permutations.

[BibT_eX]

[DOI]

Gunter Dueck

IEEE Trans. Inf. Theory, 1982

1981

To get a bit of information may be as hard as to get full information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1981

1980

Simple hypergraphs with maximal number of adjacent pairs of edges.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1980

1977

Contributions to the geometry of hamming spaces.

[BibT_eX]

[DOI]

Gyula O. H. Katona

Discret. Math., 1977

1975

Source coding with side information and a converse for degraded broadcast channels.

[BibT_eX]

[DOI]

János Körner

IEEE Trans. Inf. Theory, 1975

1971

Bounds on Algebraic Code Capacities for Noisy Channels. II

[BibT_eX]

[DOI]

J. Gemma

Inf. Control., September, 1971

Bounds on Algebraic Code Capacities for Noisy Channels. I

[BibT_eX]

[DOI]

J. Gemma

Inf. Control., September, 1971

1969

Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions

[BibT_eX]

[DOI]