| Publication | Date of Publication | Type |
|---|
| Identification and Other Probabilistic Models | 2021-05-18 | Paper |
| Probabilistic methods and distributed information. Rudolf Ahlswede's lectures on information theory 5. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm. With contributions by Vladimir Blinovsky, Holger Boche, Ulrich Krengel and Ahmed Mansour | 2019-02-15 | Paper |
| Two Batch Search With Lie Cost | 2017-08-08 | Paper |
| On Generic Erasure Correcting Sets and Related Problems | 2017-07-12 | Paper |
| Combinatorial methods and models. Rudolf Ahlswede's lectures on information theory 4. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm | 2017-05-15 | Paper |
| Hiding data -- selected topics. Rudolf Ahlswede's lectures on information theory 3. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm | 2016-04-08 | Paper |
| Transmitting and gaining data. Rudolf Ahlswede's lectures on information theory. Vol. 2. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm | 2014-12-01 | Paper |
| Storing and transmitting data. Rudolf Ahlswede's lectures on information theory 1. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm | 2014-03-31 | Paper |
| Shadows under the word-subword relation | 2013-11-04 | Paper |
| Finding one of \(D\) defective elements in some group testing models | 2013-11-01 | Paper |
| The Restricted Word Shadow Problem | 2013-04-09 | Paper |
| Threshold and Majority Group Testing | 2013-04-09 | Paper |
| On Oblivious Transfer Capacity | 2013-04-09 | Paper |
| New Construction of Error-Tolerant Pooling Designs | 2013-04-09 | Paper |
| Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels | 2013-02-06 | Paper |
| On Security of Statistical Databases | 2012-03-15 | Paper |
| The final form of Tao's inequality relating conditional expectation and conditional mutual information | 2011-03-10 | Paper |
| Interactive Communication, Diagnosis and Error Control in Networks | 2009-07-09 | Paper |
| On diagnosability of large multiprocessor networks | 2009-03-04 | Paper |
| Error Control Codes for Parallel Asymmetric Channels | 2009-02-24 | Paper |
| Report on Models of Write–Efficient Memories with Localized Errors and Defects | 2009-01-22 | Paper |
| Introduction | 2009-01-22 | Paper |
| A Strong Converse Theorem for Quantum Multiple Access Channels | 2009-01-22 | Paper |
| Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source | 2009-01-22 | Paper |
| Information Theory and Some Friendly Neighbors – Ein Wunschkonzert | 2009-01-22 | Paper |
| Watermarking Identification Codes with Related Topics on Common Randomness | 2009-01-22 | Paper |
| Search with Noisy and Delayed Responses | 2009-01-22 | Paper |
| A Kraft–Type Inequality for d–Delay Binary Search Codes | 2009-01-22 | Paper |
| Information Theoretic Models in Language Evolution | 2009-01-22 | Paper |
| An Outside Opinion | 2009-01-22 | Paper |
| Appendix: On Set Coverings in Cartesian Product Spaces | 2009-01-22 | Paper |
| On Attractive and Friendly Sets in Sequence Spaces | 2009-01-22 | Paper |
| Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem | 2009-01-22 | Paper |
| Finding $C_{\text{NRI}}({\mathcal W})$ , the Identification Capacity of the AVC ${\mathcal W}$ , if Randomization in the Encoding Is Excluded | 2009-01-22 | Paper |
| Identification Entropy | 2009-01-22 | Paper |
| Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I | 2009-01-22 | Paper |
| Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II | 2009-01-22 | Paper |
| Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs | 2009-01-22 | Paper |
| Appendix: On Common Information and Related Characteristics of Correlated Information Sources | 2009-01-22 | Paper |
| Codes with the Identifiable Parent Property and the Multiple-Access Channel | 2009-01-22 | Paper |
| On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections | 2009-01-22 | Paper |
| Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis “Utilising Public Information in Network Coding” | 2009-01-22 | Paper |
| Identification for Sources | 2009-01-22 | Paper |
| On Concepts of Performance Parameters for Channels | 2009-01-22 | Paper |
| Correlation Inequalities in Function Spaces | 2009-01-22 | Paper |
| A Fast Suffix-Sorting Algorithm | 2009-01-22 | Paper |
| On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification | 2009-01-22 | Paper |
| Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder | 2009-01-22 | Paper |
| On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information | 2009-01-22 | Paper |
| Sparse Asymmetric Connectors in Communication Networks | 2009-01-22 | Paper |
| An Interpretation of Identification Entropy | 2008-12-21 | Paper |
| Classical Capacity of Classical-Quantum Arbitrarily Varying Channels | 2008-12-21 | Paper |
| On Lossless Quantum Data Compression With a Classical Helper | 2008-12-21 | Paper |
| A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances | 2008-11-25 | Paper |
| T-shift synchronization codes | 2008-09-29 | Paper |
| On the correlation of binary sequences | 2008-09-29 | Paper |
| General theory of information transfer: Updated | 2008-09-29 | Paper |
| Searching with lies under error cost constraints | 2008-09-29 | Paper |
| Ratewise-optimal non-sequential search strategies under constraints on the tests | 2008-09-29 | Paper |
| Multiple packing in sum-type metric spaces | 2008-09-29 | Paper |
| Lectures on advances in combinatorics | 2008-06-17 | Paper |
| On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information | 2007-05-29 | Paper |
| Information theoretic models in language evolution | 2007-05-29 | Paper |
| Sparse asymmetric connectors in communication networks | 2007-05-29 | Paper |
| A Fast Suffix-Sorting Algorithm | 2007-05-29 | Paper |
| Identification for Sources | 2007-05-29 | Paper |
| Correlation Inequalities in Function Spaces | 2007-05-29 | Paper |
| Multiple Packing in Sum-type Metric Spaces | 2007-05-29 | Paper |
| A Kraft–type inequality for d–delay binary search codes | 2007-05-29 | Paper |
| Search with noisy and delayed response | 2007-05-29 | Paper |
| Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder | 2007-05-29 | Paper |
| Watermarking Identification Codes with Related Topics on Common Randomness | 2007-05-29 | Paper |
| Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers | 2007-05-29 | Paper |
| Searching with lies under error transition cost constraints | 2007-05-29 | Paper |
| Testing of Hypothesis and Identification | 2007-05-29 | Paper |
| Identification Entropy | 2007-05-29 | Paper |
| On attractive and friendly sets in sequence spaces | 2007-05-29 | Paper |
| Large families of pseudorandom sequences of k symbols and their complexity, Part I | 2007-05-29 | Paper |
| Report on models of write–efficient memories with localized errors and defects | 2007-05-29 | Paper |
| Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests | 2007-05-29 | Paper |
| Estimating with randomized encoding the joint empirical distribution in a correlated source | 2007-05-29 | Paper |
| On the correlation of binary sequences | 2007-05-29 | Paper |
| A Strong Converse Theorem for Quantum Multiple Access Channels | 2007-05-29 | Paper |
| Codes with the identifiable parent property and the multiple–access channel | 2007-05-29 | Paper |
| On partitions of a rectangle into rectangles with restricted number of cross sections | 2007-05-29 | Paper |
| General theory of information transfer | 2007-05-29 | Paper |
| T-shift synchronization codes | 2007-05-29 | Paper |
| Extremal problems under dimension constraints | 2007-05-29 | Paper |
| On diagnosability of large multiprocessor networks | 2007-05-29 | Paper |
| Large families of pseudorandom sequences of k symbols and their complexity, Part II | 2007-05-29 | Paper |
| On the Number of Step Functions with Restrictions | 2007-04-02 | Paper |
| Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes | 2006-12-07 | Paper |
| Construction of asymmetric connectors of depth two | 2006-12-07 | Paper |
| Intersection theorems under dimension constraints | 2006-04-28 | Paper |
| Forbidden \((0,1)\)-vectors in hyperplanes of \(\mathbb R^n\): the unrestricted case | 2005-11-07 | Paper |
| On shadows of intersecting families | 2005-10-04 | Paper |
| Large deviations in quantum information theory | 2005-09-14 | Paper |
| Katona's intersection theorem: four proofs | 2005-07-05 | Paper |
| Addendum to "Strong converse for identification via quantum channels" | 2005-05-31 | Paper |
| Seminoisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback | 2005-05-11 | Paper |
| Parallel error correcting codes | 2005-05-11 | Paper |
| On the density of primitive sets | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3160306 | 2005-02-08 | Paper |
| A complexity measure for families of binary sequences | 2004-09-07 | Paper |
| Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace | 2004-09-07 | Paper |
| On Bohman’s conjecture related to a sum packing problem of Erdos | 2004-02-12 | Paper |
| Extremal problems under dimension constraints. | 2004-01-05 | Paper |
| Maximal antichains under dimension constraints | 2004-01-05 | Paper |
| Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case | 2003-08-21 | Paper |
| Cone dependence -- a basic combinatorial concept | 2003-08-21 | Paper |
| More about shifting techniques | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4408032 | 2003-07-03 | Paper |
| An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection | 2003-06-19 | Paper |
| The \(t\)-intersection problem in the truncated Boolean lattice | 2003-03-18 | Paper |
| Quantum data processing | 2002-08-04 | Paper |
| Strong converse for identification via quantum channels | 2002-08-04 | Paper |
| A counterexample in rate-distortion theory for correlated sources | 2002-07-02 | Paper |
| A diametric theorem for edges | 2002-02-17 | Paper |
| On primitive sets of squarefree integers | 2001-11-05 | Paper |
| On perfect codes and related concepts | 2001-11-02 | Paper |
| A pushing-pulling method: New proofs of intersection theorems | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945047 | 2000-10-04 | Paper |
| Identification without randomization | 2000-09-07 | Paper |
| Network information flow | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945050 | 2000-09-04 | Paper |
| Isoperimetric theorems in the binary sequences of finite lengths | 2000-07-05 | Paper |
| On the Hamming bound for nonbinary localized-error-correcting codes | 2000-06-26 | Paper |
| On the counting function of primitive sets of integers. | 2000-06-07 | Paper |
| On maximal shadows of members in left-compressed sets | 2000-03-07 | Paper |
| A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem | 2000-02-01 | Paper |
| On the quotient sequence of sequences of integers | 2000-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945061 | 2000-01-01 | Paper |
| Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true | 1999-11-21 | Paper |
| Arbitrarily varying multiple-access channels. II. Correlated senders' side information, correlated messages, and ambiguous transmission | 1999-11-21 | Paper |
| Construction of uniquely decodable codes for the two-user binary adder channel | 1999-11-21 | Paper |
| Zero-error capacity for models with memory and the enlightened dictator channel | 1999-11-01 | Paper |
| Binary constant-weight codes correcting localized errors and defects | 1999-11-01 | Paper |
| The intersection theorem for direct products | 1999-04-23 | Paper |
| Common randomness in information theory and cryptography. II. CR capacity | 1999-04-20 | Paper |
| The diametric theorem in Hamming spaces---optimal anticodes | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347874 | 1999-01-12 | Paper |
| Asymptotically optimal binary codes of polynomial complexity correcting localized errors | 1998-08-19 | Paper |
| Information and control: matching channels | 1998-08-02 | Paper |
| Identification under random processes | 1998-07-13 | Paper |
| Shadows and isoperimetry under the sequence-subsequence relation | 1998-03-26 | Paper |
| Counterexample to the Frankl-Pach conjecture for uniform, dense families | 1998-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2785576 | 1998-02-17 | Paper |
| Correlated sources help transmission over an arbitrarily varying channel | 1998-01-13 | Paper |
| General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions | 1997-11-25 | Paper |
| Number theoretic correlation inequalities for Dirichlet densities | 1997-11-06 | Paper |
| Identification via compressed data | 1997-10-09 | Paper |
| Intersecting Systems | 1997-09-28 | Paper |
| On interactive communication | 1997-08-26 | Paper |
| Sets of integers and quasi-integers with pairwise common divisor | 1997-08-20 | Paper |
| Models of multi-user write-efficient memories and general diametric theorems | 1997-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2785580 | 1997-08-03 | Paper |
| General edge-isoperimetric inequalities. I: Information-theoretical methods | 1997-07-27 | Paper |
| Universal coding of integers and unbounded search trees | 1997-07-20 | Paper |
| Incomparability and intersection properties of Boolean interval lattices and chain posets | 1997-04-13 | Paper |
| The complete intersection theorem for systems of finite sets | 1997-03-05 | Paper |
| Sets of integers with pairwise common divisor and a factor from a specified set of primes | 1997-01-30 | Paper |
| Optimal pairs of incomparable clouds in multisets | 1997-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5689764 | 1997-01-07 | Paper |
| Erasure, list, and detection zero-error capacities for low noise and a relation to identification | 1996-12-01 | Paper |
| Density inequalities for sets of multiples | 1996-11-19 | Paper |
| The complete nontrivial-intersection theorem for systems of finite sets | 1996-10-14 | Paper |
| A splitting property of maximal antichains | 1996-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326628 | 1996-07-02 | Paper |
| Towards characterizing equality in correlation inequalities | 1996-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4836415 | 1996-04-10 | Paper |
| A counterexample to Aharoni's strongly maximal matching conjecture | 1996-03-25 | Paper |
| New directions in the theory of identification via channels | 1996-01-14 | Paper |
| Maximal sets of numbers not containing k+1 pairwise coprime integers | 1996-01-07 | Paper |
| On Partitioning and Packing Products with Rectangles | 1995-10-23 | Paper |
| On communication complexity of vector-valued functions | 1995-10-09 | Paper |
| Two-way communication complexity of sum-type functions for one processor to be informed | 1995-09-17 | Paper |
| Localized random and arbitrary errors in the light of arbitrarily varying channel theory | 1995-08-01 | Paper |
| Edge isoperimetric theorems for integer point arrays | 1995-07-20 | Paper |
| On multiuser write-efficient memories | 1995-07-12 | Paper |
| The maximal length of cloud-antichains | 1995-06-13 | Paper |
| The asymptotic behaviour of diameters in the average | 1995-05-17 | Paper |
| Partitioning the \(n\)-cube into sets with mutual distance 1 | 1995-04-09 | Paper |
| The maximal error capacity of arbitrarily varying channels for constant list sizes | 1994-10-04 | Paper |
| Common randomness in information theory and cryptography. I. Secret sharing | 1994-10-04 | Paper |
| Nonbinary codes correcting localized errors | 1994-10-04 | Paper |
| On Extremal Set Partitions in Cartesian Product Spaces | 1994-08-18 | Paper |
| On extremal sets without coprimes | 1994-07-21 | Paper |
| Communication complexity in lattices | 1994-06-23 | Paper |
| On the optimal structure of recovering set pairs in lattices: The sandglass conjecture | 1994-06-14 | Paper |
| A generalization of the AZ identity | 1994-01-26 | Paper |
| Rank formulas for certain products of matrices | 1994-01-21 | Paper |
| Two proofs of Pinsker's conjecture concerning arbitrarily varying channels | 1992-06-28 | Paper |
| On identification via multiway channels with feedback | 1992-06-28 | Paper |
| Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory | 1991-01-01 | Paper |
| An identity in combinatorial extremal theory | 1990-01-01 | Paper |
| On minimax estimation in the presence of side information about remote data | 1990-01-01 | Paper |
| Creating order in sequence spaces with simple machines | 1990-01-01 | Paper |
| Coding for channels with localized errors: The non-binary cases | 1990-01-01 | Paper |
| On cloud-antichains and related configurations | 1990-01-01 | Paper |
| Extremal properties of rate distortion functions | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348931 | 1990-01-01 | Paper |
| Identification via channels | 1989-01-01 | Paper |
| Coding for write-efficient memory | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3475204 | 1989-01-01 | Paper |
| A general 4-words inequality with consequences for 2-way communication complexity | 1989-01-01 | Paper |
| Identification in the presence of feedback-a discovery of new capacity formulas | 1989-01-01 | Paper |
| Inequalities for code pairs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206689 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792452 | 1987-01-01 | Paper |
| Optimal coding strategies for certain permuting channels | 1987-01-01 | Paper |
| On multiple descriptions and team guessing | 1986-01-01 | Paper |
| Arbitrarily varying channels with states sequence known to the sender | 1986-01-01 | Paper |
| Hypothesis testing with communication constraints | 1986-01-01 | Paper |
| The rate-distortion region for multiple descriptions without excess rate | 1985-01-01 | Paper |
| Improvements of Winograd's result on computation in the presence of noise (Corresp.) | 1984-01-01 | Paper |
| On source coding with side information via a multiple-access channel and related problems in multi-user information theory | 1983-01-01 | Paper |
| Note on an extremal problem arising for unreliable networks in parallel computing | 1983-01-01 | Paper |
| In Memorium: Jacob Wolfowitz | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3770269 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4749745 | 1982-01-01 | Paper |
| Good codes can be produced by a few permutations | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041078 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3312146 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956400 | 1981-01-01 | Paper |
| To get a bit of information may be as hard as to get full information | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3895387 | 1980-01-01 | Paper |
| Simple hypergraphs with maximal number of adjacent pairs of edges | 1980-01-01 | Paper |
| Integral inequalities for increasing functions | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4191951 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3861131 | 1979-01-01 | Paper |
| Inequalities for a pair of maps \(S\times S\to S\) with \(S\) a finite set | 1979-01-01 | Paper |
| The Number of values of Combinatorial Functions | 1979-01-01 | Paper |
| Graphs with maximal number of adjacent pairs of edges | 1978-01-01 | Paper |
| An inequality for the weights of two families of sets, their unions and intersections | 1978-01-01 | Paper |
| Elimination of correlation in random codes for arbitrarily varying channels | 1978-01-01 | Paper |
| Contributions to the geometry of Hamming spaces | 1977-01-01 | Paper |
| Correction to bounds on conditional probabilities with applications | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132117 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145258 | 1977-01-01 | Paper |
| Spreading of sets in product spaces and hypercontraction of the Markov operator | 1976-01-01 | Paper |
| Bounds on conditional probabilities with applications in multi-user communication | 1976-01-01 | Paper |
| Every bad code has a good subcode: A local converse to the coding theorem | 1976-01-01 | Paper |
| Source coding with side information and a converse for degraded broadcast channels | 1975-01-01 | Paper |
| Approximation of continuous functions in p-adic analysis | 1975-01-01 | Paper |
| The capacity of a channel with two senders and two receivers | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4775776 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4775777 | 1973-01-01 | Paper |
| Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback | 1973-01-01 | Paper |
| Channel capacities for list codes | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4775775 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4404773 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5625063 | 1971-01-01 | Paper |
| Channels without synchronization | 1971-01-01 | Paper |
| Bounds on algebraic code capacities for noisy channels. I | 1971-01-01 | Paper |
| Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels | 1971-01-01 | Paper |
| A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error Capacity | 1970-01-01 | Paper |
| The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5598087 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5582100 | 1969-01-01 | Paper |
| Correlated decoding for channels with arbitrarily varying channel probability functions | 1969-01-01 | Paper |
| Beitr�ge zur Shannonschen Informationstheorie im Falle nichtstation�rer Kan�le | 1968-01-01 | Paper |
| The weak capacity of averaged channels | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5571478 | 1968-01-01 | Paper |
