| Publication | Date of Publication | Type |
|---|
Structured Codes of Graphs
SIAM Journal on Discrete Mathematics | 2023-03-30 | Paper |
Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein”
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Divergent permutations
Journal of Combinatorial Theory. Series A | 2020-03-20 | Paper |
Interlocked Permutations
SIAM Journal on Discrete Mathematics | 2019-09-16 | Paper |
Families of locally separated Hamilton paths
Journal of Graph Theory | 2018-08-16 | Paper |
Hamilton Paths With Lasting Separation
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Skewincidence
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Path separation by short cycles
Journal of Graph Theory | 2017-06-30 | Paper |
Zero-Error Capacity of Binary Channels With Memory
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Information Theory | 2015-10-28 | Paper |
Connector families of graphs
Graphs and Combinatorics | 2015-01-20 | Paper |
Degree-doubling graph families
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
| Families of very different paths | 2013-11-01 | Paper |
| Permutation capacities and oriented infinite paths | 2013-11-01 | Paper |
Families of graph-different Hamilton paths
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Forbiddance and capacity
Graphs and Combinatorics | 2012-01-24 | Paper |
Permutation capacities of families of oriented infinite paths
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
| Information theory. Coding theorems for discrete memoryless systems | 2011-02-16 | Paper |
On types of growth for graph-different permutations
Journal of Combinatorial Theory. Series A | 2009-06-17 | Paper |
Graph-Different Permutations
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Appendix: On Common Information and Related Characteristics of Correlated Information Sources
Lecture Notes in Computer Science | 2009-01-22 | Paper |
Codes for a long silence
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On Cancellative Set Families
Combinatorics, Probability and Computing | 2008-02-22 | Paper |
Cross‐intersecting couples of graphs
Journal of Graph Theory | 2008-01-04 | Paper |
Delta-systems and qualitative (in)dependence
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Pairwise colliding permutations and the capacity of infinite graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Local chromatic number and Sperner capacity
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
Delta-systems and qualitative (in)dependence
Journal of Combinatorial Theory. Series A | 2003-03-26 | Paper |
A note on counting very different sequences
Combinatorics, Probability and Computing | 2002-09-11 | Paper |
Self-similarity bounds for locally thin set families
Combinatorics, Probability and Computing | 2002-06-03 | Paper |
A better bound for locally thin set families
Journal of Combinatorial Theory. Series A | 2002-03-29 | Paper |
String quartets in binary
Combinatorics, Probability and Computing | 2002-01-21 | Paper |
Locally thin set families
Combinatorics, Probability and Computing | 2001-11-09 | Paper |
Relative capacity and dimension of graphs
Discrete Mathematics | 2001-07-18 | Paper |
Colour number, capacity, and perfectness of directed graphs
Graphs and Combinatorics | 2001-06-26 | Paper |
Graph pairs and their entropies: Modularity problems
Combinatorica | 2001-04-01 | Paper |
Compact representations of the intersection structure of families of finite sets
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
Compressing inconsistent data
IEEE Transactions on Information Theory | 2000-07-06 | Paper |
On the odd cycles of normal graphs
Discrete Applied Mathematics | 2000-01-02 | Paper |
Zero-error information theory
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
On clique growth in products of directed graphs
Graphs and Combinatorics | 1998-09-14 | Paper |
Tiling Hamming space with few spheres
Journal of Combinatorial Theory. Series A | 1997-12-02 | Paper |
Tight packings of Hamming spheres
Journal of Combinatorial Theory. Series A | 1996-12-16 | Paper |
| scientific article; zbMATH DE number 881164 (Why is no real title available?) | 1996-09-29 | Paper |
| scientific article; zbMATH DE number 826055 (Why is no real title available?) | 1996-05-27 | Paper |
On the extremal combinatorics of the Hamming space
Journal of Combinatorial Theory. Series A | 1995-11-26 | Paper |
Cancellative pairs of families of sets
European Journal of Combinatorics | 1995-10-23 | Paper |
On the capacity of Boolean graph formulæ
Graphs and Combinatorics | 1995-09-11 | Paper |
Capacities: From information theory to extremal set theory
Journal of Combinatorial Theory. Series A | 1995-03-05 | Paper |
Different capacities of a digraph
Graphs and Combinatorics | 1994-09-26 | Paper |
Sperner capacities
Graphs and Combinatorics | 1993-06-29 | Paper |
Qualitative independence and Sperner problems for directed graphs
Journal of Combinatorial Theory. Series A | 1993-01-17 | Paper |
Perfect couples of graphs
Combinatorica | 1993-01-16 | Paper |
Search problems for two irregular coins with incomplete feedback: The underweight model
Discrete Applied Mathematics | 1992-09-27 | Paper |
A Sperner-type theorem and qualitative independence
Journal of Combinatorial Theory. Series A | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 15262 (Why is no real title available?) | 1992-06-25 | Paper |
Entropy splitting for antiblocking corners and perfect graphs
Combinatorica | 1990-01-01 | Paper |
On the capacity of uniform hypergraphs
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Separating Partition Systems and Locally Different Sequences
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Fredman–Komlós bounds and information theory
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4033655 (Why is no real title available?) | 1986-01-01 | Paper |
Addendum to ``Odd and even Hamming spheres also have minimum boundary
Discrete Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4085568 (Why is no real title available?) | 1985-01-01 | Paper |
Selecting non-consecutive balls arranged in many lines
Journal of Combinatorial Theory. Series A | 1984-01-01 | Paper |
Odd and even Hamming spheres also have minimum boundary
Discrete Mathematics | 1984-01-01 | Paper |
OPEC or a basic problem in source networks
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
Successive encoding of correlated sources
IEEE Transactions on Information Theory | 1983-01-01 | Paper |
Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)
IEEE Transactions on Information Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3908323 (Why is no real title available?) | 1981-01-01 | Paper |
On the capacity of the arbitrarily varying channel for maximum probability of error
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1981-01-01 | Paper |
Graph decomposition: A new key to coding theorems
IEEE Transactions on Information Theory | 1981-01-01 | Paper |
Universally attainable error exponents for broadcast channels with degraded message sets
IEEE Transactions on Information Theory | 1980-01-01 | Paper |
Towards a general theory of source networks
IEEE Transactions on Information Theory | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3821613 (Why is no real title available?) | 1980-01-01 | Paper |
How to encode the modulo-two sum of binary sources (Corresp.)
IEEE Transactions on Information Theory | 1979-01-01 | Paper |
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
IEEE Transactions on Information Theory | 1979-01-01 | Paper |
Broadcast channels with confidential messages
IEEE Transactions on Information Theory | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3841765 (Why is no real title available?) | 1978-01-01 | Paper |
General broadcast channels with degraded message sets
IEEE Transactions on Information Theory | 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 3575467 (Why is no real title available?) | 1977-01-01 | Paper |
Images of a set via two channels and their role in multi-user communication
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
Bounds on conditional probabilities with applications in multi-user communication
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3637717 (Why is no real title available?) | 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 |
| scientific article; zbMATH DE number 3547191 (Why is no real title available?) | 1975-01-01 | Paper |
Two-step encoding for finite sources
IEEE Transactions on Information Theory | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3497786 (Why is no real title available?) | 1973-01-01 | Paper |
