| 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 and Ahmed Mansour 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 |
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 |
On oblivious transfer capacity 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 |
Report on Models of Write–Efficient Memories with Localized Errors and Defects Lecture Notes in Computer Science | 2009-01-22 | Paper |
Introduction 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 |
Information Theory and Some Friendly Neighbors – Ein Wunschkonzert 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 |
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 |
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 |
Appendix: On Set Coverings in Cartesian Product Spaces 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: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem 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 |
Identification Entropy 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 |
Appendix: On Edge–Isoperimetric Theorems for Uniform Hypergraphs 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 |
Codes with the Identifiable Parent Property and the Multiple-Access Channel 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 |
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 |
Identification for Sources 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 |
Correlation Inequalities in Function Spaces Lecture Notes in Computer Science | 2009-01-22 | Paper |
A Fast Suffix-Sorting Algorithm 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 |
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 |
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information Lecture Notes in Computer Science | 2009-01-22 | Paper |
Sparse Asymmetric Connectors in Communication Networks Lecture Notes in Computer Science | 2009-01-22 | 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 |
On Lossless Quantum Data Compression With a Classical Helper 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 |
Searching with lies under error cost constraints 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 |
Multiple packing in sum-type metric spaces Discrete Applied Mathematics | 2008-09-29 | Paper |
Lectures on advances in combinatorics Universitext | 2008-06-17 | 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 |
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 |
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 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 |
Estimating with randomized encoding the joint empirical distribution in a correlated source Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On the correlation of binary sequences 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 |
On partitions of a rectangle into rectangles with restricted number of cross sections Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
General theory of information transfer Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
T-shift synchronization codes Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Extremal problems under dimension constraints Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On diagnosability of large multiprocessor networks 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 |
On the Number of Step Functions with Restrictions Theory of Probability & Its Applications | 2007-04-02 | 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 |
Construction of asymmetric connectors of depth two 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 |
Seminoisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Parallel error correcting codes IEEE Transactions on Information Theory | 2005-05-11 | Paper |
On the density of primitive sets Journal of Number Theory | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2132451 (Why is no real title available?) | 2005-02-08 | Paper |
A complexity measure for families of binary sequences Periodica Mathematica Hungarica | 2004-09-07 | Paper |
Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace Combinatorica | 2004-09-07 | Paper |
On Bohman’s conjecture related to a sum packing problem of Erdos Proceedings of the American Mathematical Society | 2004-02-12 | Paper |
Extremal problems under dimension constraints. Discrete Mathematics | 2004-01-05 | Paper |
Maximal antichains under dimension constraints Discrete Mathematics | 2004-01-05 | Paper |
Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case Designs, Codes and Cryptography | 2003-08-21 | Paper |
Cone dependence -- a basic combinatorial concept Designs, Codes and Cryptography | 2003-08-21 | Paper |
More about shifting techniques European Journal of Combinatorics | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1944712 (Why is no real title available?) | 2003-07-03 | Paper |
An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection Problems of Information Transmission | 2003-06-19 | Paper |
The \(t\)-intersection problem in the truncated Boolean lattice European Journal of Combinatorics | 2003-03-18 | Paper |
Quantum data processing IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Strong converse for identification via quantum channels IEEE Transactions on Information Theory | 2002-08-04 | Paper |
A counterexample in rate-distortion theory for correlated sources Applied Mathematics Letters | 2002-07-02 | Paper |
A diametric theorem for edges Journal of Combinatorial Theory. Series A | 2002-02-17 | Paper |
On primitive sets of squarefree integers Periodica Mathematica Hungarica | 2001-11-05 | Paper |
On perfect codes and related concepts Designs, Codes and Cryptography | 2001-11-02 | Paper |
A pushing-pulling method: New proofs of intersection theorems Combinatorica | 2001-06-13 | Paper |
| scientific article; zbMATH DE number 1420975 (Why is no real title available?) | 2000-10-04 | Paper |
Identification without randomization IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Network information flow IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1420978 (Why is no real title available?) | 2000-09-04 | Paper |
Isoperimetric theorems in the binary sequences of finite lengths Applied Mathematics Letters | 2000-07-05 | Paper |
On the Hamming bound for nonbinary localized-error-correcting codes Problems of Information Transmission | 2000-06-26 | Paper |
On the counting function of primitive sets of integers. Journal of Number Theory | 2000-06-07 | Paper |
On maximal shadows of members in left-compressed sets Discrete Applied Mathematics | 2000-03-07 | Paper |
A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem Combinatorics, Probability and Computing | 2000-02-01 | Paper |
On the quotient sequence of sequences of integers Acta Arithmetica | 2000-01-05 | Paper |
| scientific article; zbMATH DE number 1420989 (Why is no real title available?) | 2000-01-01 | Paper |
Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Arbitrarily varying multiple-access channels. II. Correlated senders' side information, correlated messages, and ambiguous transmission IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Construction of uniquely decodable codes for the two-user binary adder channel IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Zero-error capacity for models with memory and the enlightened dictator channel IEEE Transactions on Information Theory | 1999-11-01 | Paper |
Binary constant-weight codes correcting localized errors and defects Problems of Information Transmission | 1999-11-01 | Paper |
The intersection theorem for direct products European Journal of Combinatorics | 1999-04-23 | Paper |
Common randomness in information theory and cryptography. II. CR capacity IEEE Transactions on Information Theory | 1999-04-20 | Paper |
The diametric theorem in Hamming spaces---optimal anticodes Advances in Applied Mathematics | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1047707 (Why is no real title available?) | 1999-01-12 | Paper |
Asymptotically optimal binary codes of polynomial complexity correcting localized errors Problems of Information Transmission | 1998-08-19 | Paper |
Information and control: matching channels IEEE Transactions on Information Theory | 1998-08-02 | Paper |
Identification under random processes Problems of Information Transmission | 1998-07-13 | Paper |
Shadows and isoperimetry under the sequence-subsequence relation Combinatorica | 1998-03-26 | Paper |
Counterexample to the Frankl-Pach conjecture for uniform, dense families Combinatorica | 1998-03-26 | Paper |
| scientific article; zbMATH DE number 981689 (Why is no real title available?) | 1998-02-17 | Paper |
Correlated sources help transmission over an arbitrarily varying channel IEEE Transactions on Information Theory | 1998-01-13 | Paper |
General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions European Journal of Combinatorics | 1997-11-25 | Paper |
Number theoretic correlation inequalities for Dirichlet densities Journal of Number Theory | 1997-11-06 | Paper |
Identification via compressed data IEEE Transactions on Information Theory | 1997-10-09 | Paper |
Intersecting Systems Combinatorics, Probability and Computing | 1997-09-28 | Paper |
On interactive communication IEEE Transactions on Information Theory | 1997-08-26 | Paper |
Sets of integers and quasi-integers with pairwise common divisor Acta Arithmetica | 1997-08-20 | Paper |
Models of multi-user write-efficient memories and general diametric theorems Information and Computation | 1997-08-11 | Paper |
| scientific article; zbMATH DE number 981693 (Why is no real title available?) | 1997-08-03 | Paper |
General edge-isoperimetric inequalities. I: Information-theoretical methods European Journal of Combinatorics | 1997-07-27 | Paper |
Universal coding of integers and unbounded search trees IEEE Transactions on Information Theory | 1997-07-20 | Paper |
Incomparability and intersection properties of Boolean interval lattices and chain posets European Journal of Combinatorics | 1997-04-13 | Paper |
The complete intersection theorem for systems of finite sets European Journal of Combinatorics | 1997-03-05 | Paper |
Sets of integers with pairwise common divisor and a factor from a specified set of primes Acta Arithmetica | 1997-01-30 | Paper |
Optimal pairs of incomparable clouds in multisets Graphs and Combinatorics | 1997-01-19 | Paper |
| scientific article; zbMATH DE number 961881 (Why is no real title available?) | 1997-01-07 | Paper |
Erasure, list, and detection zero-error capacities for low noise and a relation to identification IEEE Transactions on Information Theory | 1996-12-01 | Paper |
Density inequalities for sets of multiples Journal of Number Theory | 1996-11-19 | Paper |
The complete nontrivial-intersection theorem for systems of finite sets Journal of Combinatorial Theory. Series A | 1996-10-14 | Paper |
A splitting property of maximal antichains Combinatorica | 1996-07-04 | Paper |
| scientific article; zbMATH DE number 736284 (Why is no real title available?) | 1996-07-02 | Paper |
Towards characterizing equality in correlation inequalities European Journal of Combinatorics | 1996-05-02 | Paper |
| scientific article; zbMATH DE number 764514 (Why is no real title available?) | 1996-04-10 | Paper |
A counterexample to Aharoni's strongly maximal matching conjecture Discrete Mathematics | 1996-03-25 | Paper |
New directions in the theory of identification via channels IEEE Transactions on Information Theory | 1996-01-14 | Paper |
Maximal sets of numbers not containing k+1 pairwise coprime integers Acta Arithmetica | 1996-01-07 | Paper |
On Partitioning and Packing Products with Rectangles Combinatorics, Probability and Computing | 1995-10-23 | Paper |
On communication complexity of vector-valued functions IEEE Transactions on Information Theory | 1995-10-09 | Paper |
Two-way communication complexity of sum-type functions for one processor to be informed Problems of Information Transmission | 1995-09-17 | Paper |
Localized random and arbitrary errors in the light of arbitrarily varying channel theory IEEE Transactions on Information Theory | 1995-08-01 | Paper |
Edge isoperimetric theorems for integer point arrays Applied Mathematics Letters | 1995-07-20 | Paper |
On multiuser write-efficient memories IEEE Transactions on Information Theory | 1995-07-12 | Paper |
The maximal length of cloud-antichains Discrete Mathematics | 1995-06-13 | Paper |
The asymptotic behaviour of diameters in the average Journal of Combinatorial Theory. Series B | 1995-05-17 | Paper |
Partitioning the \(n\)-cube into sets with mutual distance 1 Applied Mathematics Letters | 1995-04-09 | Paper |
The maximal error capacity of arbitrarily varying channels for constant list sizes IEEE Transactions on Information Theory | 1994-10-04 | Paper |
Common randomness in information theory and cryptography. I. Secret sharing IEEE Transactions on Information Theory | 1994-10-04 | Paper |
Nonbinary codes correcting localized errors IEEE Transactions on Information Theory | 1994-10-04 | Paper |
On Extremal Set Partitions in Cartesian Product Spaces Combinatorics, Probability and Computing | 1994-08-18 | Paper |
On extremal sets without coprimes Acta Arithmetica | 1994-07-21 | Paper |
Communication complexity in lattices Applied Mathematics Letters | 1994-06-23 | Paper |
On the optimal structure of recovering set pairs in lattices: The sandglass conjecture Discrete Mathematics | 1994-06-14 | Paper |
A generalization of the AZ identity Combinatorica | 1994-01-26 | Paper |
Rank formulas for certain products of matrices Applicable Algebra in Engineering, Communication and Computing | 1994-01-21 | Paper |
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels IEEE Transactions on Information Theory | 1992-06-28 | Paper |
On identification via multiway channels with feedback IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory IEEE Transactions on Information Theory | 1991-01-01 | Paper |
An identity in combinatorial extremal theory Advances in Mathematics | 1990-01-01 | Paper |
On minimax estimation in the presence of side information about remote data The Annals of Statistics | 1990-01-01 | Paper |
Creating order in sequence spaces with simple machines Information and Computation | 1990-01-01 | Paper |
Coding for channels with localized errors: The non-binary cases Applied Mathematics Letters | 1990-01-01 | Paper |
On cloud-antichains and related configurations Discrete Mathematics | 1990-01-01 | Paper |
Extremal properties of rate distortion functions IEEE Transactions on Information Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4200235 (Why is no real title available?) | 1990-01-01 | Paper |
Identification via channels IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Coding for write-efficient memory Information and Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4143905 (Why is no real title available?) | 1989-01-01 | Paper |
A general 4-words inequality with consequences for 2-way communication complexity Advances in Applied Mathematics | 1989-01-01 | Paper |
Identification in the presence of feedback-a discovery of new capacity formulas IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Inequalities for code pairs European Journal of Combinatorics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4127151 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4057247 (Why is no real title available?) | 1987-01-01 | Paper |
Optimal coding strategies for certain permuting channels IEEE Transactions on Information Theory | 1987-01-01 | Paper |
On multiple descriptions and team guessing IEEE Transactions on Information Theory | 1986-01-01 | Paper |
Arbitrarily varying channels with states sequence known to the sender IEEE Transactions on Information Theory | 1986-01-01 | Paper |
Hypothesis testing with communication constraints IEEE Transactions on Information Theory | 1986-01-01 | Paper |
The rate-distortion region for multiple descriptions without excess rate IEEE Transactions on Information Theory | 1985-01-01 | Paper |
Improvements of Winograd's result on computation in the presence of noise (Corresp.) IEEE Transactions on Information Theory | 1984-01-01 | Paper |
On source coding with side information via a multiple-access channel and related problems in multi-user information theory IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Note on an extremal problem arising for unreliable networks in parallel computing Discrete Mathematics | 1983-01-01 | Paper |
In Memorium: Jacob Wolfowitz IEEE Transactions on Information Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 4029246 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3805435 (Why is no real title available?) | 1982-01-01 | Paper |
Good codes can be produced by a few permutations IEEE Transactions on Information Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3833856 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3841770 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3776867 (Why is no real title available?) | 1981-01-01 | Paper |
To get a bit of information may be as hard as to get full information IEEE Transactions on Information Theory | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3702545 (Why is no real title available?) | 1980-01-01 | Paper |
Simple hypergraphs with maximal number of adjacent pairs of edges Journal of Combinatorial Theory. Series B | 1980-01-01 | Paper |
Integral inequalities for increasing functions Mathematical Proceedings of the Cambridge Philosophical Society | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3630603 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3662840 (Why is no real title available?) | 1979-01-01 | Paper |
Inequalities for a pair of maps \(S\times S\to S\) with \(S\) a finite set Mathematische Zeitschrift | 1979-01-01 | Paper |
The Number of values of Combinatorial Functions Bulletin of the London Mathematical Society | 1979-01-01 | Paper |
Graphs with maximal number of adjacent pairs of edges Acta Mathematica Academiae Scientiarum Hungaricae | 1978-01-01 | Paper |
An inequality for the weights of two families of sets, their unions and intersections Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1978-01-01 | Paper |
Elimination of correlation in random codes for arbitrarily varying channels Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1978-01-01 | Paper |
Contributions to the geometry of Hamming spaces Discrete Mathematics | 1977-01-01 | Paper |
Correction to bounds on conditional probabilities with applications Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3561194 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3575467 (Why is no real title available?) | 1977-01-01 | Paper |
Spreading of sets in product spaces and hypercontraction of the Markov operator The Annals of Probability | 1976-01-01 | Paper |
Bounds on conditional probabilities with applications in multi-user communication Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1976-01-01 | Paper |
Every bad code has a good subcode: A local converse to the coding theorem Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1976-01-01 | Paper |
Source coding with side information and a converse for degraded broadcast channels IEEE Transactions on Information Theory | 1975-01-01 | Paper |
Approximation of continuous functions in p-adic analysis Journal of Approximation Theory | 1975-01-01 | Paper |
The capacity of a channel with two senders and two receivers The Annals of Probability | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3451754 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3451755 (Why is no real title available?) | 1973-01-01 | Paper |
Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1973-01-01 | Paper |
Channel capacities for list codes Journal of Applied Probability | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3451753 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3438733 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3349718 (Why is no real title available?) | 1971-01-01 | Paper |
Channels without synchronization Advances in Applied Probability | 1971-01-01 | Paper |
Bounds on algebraic code capacities for noisy channels. I Information and Control | 1971-01-01 | Paper |
Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels Annals of Mathematical Statistics | 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 Annals of Mathematical Statistics | 1970-01-01 | Paper |
The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3318375 (Why is no real title available?) | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3300332 (Why is no real title available?) | 1969-01-01 | Paper |
Correlated decoding for channels with arbitrarily varying channel probability functions Information and Control | 1969-01-01 | Paper |
[https://portal.mardi4nfdi.de/wiki/Publication:5568915 Beitr�ge zur Shannonschen Informationstheorie im Falle nichtstation�rer Kan�le] Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1968-01-01 | Paper |
The weak capacity of averaged channels Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3288353 (Why is no real title available?) | 1968-01-01 | Paper |