| Publication | Date of Publication | Type |
|---|
Identification and Other Probabilistic Models
Foundations in Signal Processing, Communications and Networking | 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 an
Foundations in Signal Processing, Communications and Networking | 2019-02-15 | Paper |
Two Batch Search With Lie Cost
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On Generic Erasure Correcting Sets and Related Problems
IEEE Transactions on Information Theory | 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
Foundations in Signal Processing, Communications and Networking | 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
Foundations in Signal Processing, Communications and Networking | 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
Foundations in Signal Processing, Communications and Networking | 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
Foundations in Signal Processing, Communications and Networking | 2014-03-31 | Paper |
Shadows under the word-subword relation
Problems of Information Transmission | 2013-11-04 | Paper |
Finding one of D defective elements in some group testing models
Problems of Information Transmission | 2013-11-01 | Paper |
On oblivious transfer capacity
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
The Restricted Word Shadow Problem
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Threshold and Majority Group Testing
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
New Construction of Error-Tolerant Pooling Designs
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
Communications in Mathematical Physics | 2013-02-06 | Paper |
On security of statistical databases
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
The final form of Tao's inequality relating conditional expectation and conditional mutual information
Advances in Mathematics of Communications | 2011-03-10 | Paper |
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
On diagnosability of large multiprocessor networks
Discrete Applied Mathematics | 2009-03-04 | Paper |
Error Control Codes for Parallel Asymmetric Channels
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Introduction
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Information Theory and Some Friendly Neighbors – Ein Wunschkonzert
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Identification for Sources
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Watermarking Identification Codes with Related Topics on Common Randomness
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Codes with the Identifiable Parent Property and the Multiple-Access Channel
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
Lecture Notes in Computer Science | 2009-01-22 | Paper |
A Strong Converse Theorem for Quantum Multiple Access Channels
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source
Lecture Notes in Computer Science | 2009-01-22 | Paper |
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information
Lecture Notes in Computer Science | 2009-01-22 | Paper |
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Correlation Inequalities in Function Spaces
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Identification Entropy
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Report on Models of Write–Efficient Memories with Localized Errors and Defects
Lecture Notes in Computer Science | 2009-01-22 | Paper |
On Concepts of Performance Parameters for Channels
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Appendix: On Common Information and Related Characteristics of Correlated Information Sources
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Search with Noisy and Delayed Responses
Lecture Notes in Computer Science | 2009-01-22 | Paper |
A Kraft–Type Inequality for d–Delay Binary Search Codes
Lecture Notes in Computer Science | 2009-01-22 | Paper |
A Fast Suffix-Sorting Algorithm
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Information Theoretic Models in Language Evolution
Lecture Notes in Computer Science | 2009-01-22 | Paper |
An Outside Opinion
Lecture Notes in Computer Science | 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”
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Appendix: On Set Coverings in Cartesian Product Spaces
Lecture Notes in Computer Science | 2009-01-22 | Paper |
On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections
Lecture Notes in Computer Science | 2009-01-22 | Paper |
On Attractive and Friendly Sets in Sequence Spaces
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Sparse Asymmetric Connectors in Communication Networks
Lecture Notes in Computer Science | 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
Lecture Notes in Computer Science | 2009-01-22 | Paper |
On Lossless Quantum Data Compression With a Classical Helper
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
An Interpretation of Identification Entropy
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances
Coding Theory and Applications | 2008-11-25 | Paper |
T-shift synchronization codes
Discrete Applied Mathematics | 2008-09-29 | Paper |
On the correlation of binary sequences
Discrete Applied Mathematics | 2008-09-29 | Paper |
General theory of information transfer: Updated
Discrete Applied Mathematics | 2008-09-29 | Paper |
Ratewise-optimal non-sequential search strategies under constraints on the tests
Discrete Applied Mathematics | 2008-09-29 | Paper |
Searching with lies under error cost constraints
Discrete Applied Mathematics | 2008-09-29 | Paper |
Multiple packing in sum-type metric spaces
Discrete Applied Mathematics | 2008-09-29 | Paper |
Lectures on advances in combinatorics
Universitext | 2008-06-17 | Paper |
Extremal problems under dimension constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Information theoretic models in language evolution
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Sparse asymmetric connectors in communication networks
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A Fast Suffix-Sorting Algorithm
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Identification for Sources
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Correlation Inequalities in Function Spaces
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Multiple Packing in Sum-type Metric Spaces
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A Kraft–type inequality for d–delay binary search codes
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A Strong Converse Theorem for Quantum Multiple Access Channels
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Codes with the identifiable parent property and the multiple–access channel
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Search with noisy and delayed response
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Watermarking Identification Codes with Related Topics on Common Randomness
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Searching with lies under error transition cost constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
General theory of information transfer
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Testing of Hypothesis and Identification
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Identification Entropy
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On attractive and friendly sets in sequence spaces
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Large families of pseudorandom sequences of k symbols and their complexity, Part II
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Large families of pseudorandom sequences of k symbols and their complexity, Part I
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Report on models of write–efficient memories with localized errors and defects
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On partitions of a rectangle into rectangles with restricted number of cross sections
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Estimating with randomized encoding the joint empirical distribution in a correlated source
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On diagnosability of large multiprocessor networks
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
T-shift synchronization codes
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On the correlation of binary sequences
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On the Number of Step Functions with Restrictions
Theory of Probability & Its Applications | 2007-04-02 | Paper |
Construction of asymmetric connectors of depth two
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
Maximal sets of numbers not containing \(k+1\) pairwise coprimes and having divisors from a specified set of primes
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
Intersection theorems under dimension constraints
Journal of Combinatorial Theory. Series A | 2006-04-28 | Paper |
Forbidden \((0,1)\)-vectors in hyperplanes of \(\mathbb R^n\): the unrestricted case
Designs, Codes and Cryptography | 2005-11-07 | Paper |
On shadows of intersecting families
Combinatorica | 2005-10-04 | Paper |
Large deviations in quantum information theory
Problems of Information Transmission | 2005-09-14 | Paper |
Katona's intersection theorem: four proofs
Combinatorica | 2005-07-05 | Paper |
Addendum to "Strong converse for identification via quantum channels"
IEEE Transactions on Information Theory | 2005-05-31 | Paper |
Parallel error correcting codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
