2023
Structured Codes of Graphs.
SIAM J. Discret. Math., March, 2023
2022
Codes with structured Hamming distance in graph families.
CoRR, 2022
2021
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein".
IEEE Trans. Inf. Theory, 2021
2020
J. Comb. Theory, Ser. A, 2020
2019
Interlocked Permutations.
SIAM J. Discret. Math., 2019
On the size of pairwise-colliding permutations.
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
Families of locally separated Hamilton paths.
J. Graph Theory, 2018
2017
Hamilton Paths With Lasting Separation.
IEEE Trans. Inf. Theory, 2017
Path Separation by Short Cycles.
J. Graph Theory, 2017
2016
Zero-Error Capacity of Binary Channels With Memory.
IEEE Trans. Inf. Theory, 2016
2014
Connector Families of Graphs.
Graphs Comb., 2014
2013
Degree-Doubling Graph Families.
SIAM J. Discret. Math., 2013
More on Connector Families.
Electron. Notes Discret. Math., 2013
2012
Families of Graph-different Hamilton Paths.
SIAM J. Discret. Math., 2012
2011
IEEE Trans. Inf. Theory, 2011
Forbiddance and Capacity.
Graphs Comb., 2011
Families of Very Different Paths.
Electron. Notes Discret. Math., 2011
Permutation Capacities and Oriented Infinite Paths.
Electron. Notes Discret. Math., 2011
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition
Cambridge University Press, ISBN: 978-0-51192188-9, 2011
2010
Permutation Capacities of Families of Oriented Infinite Paths.
SIAM J. Discret. Math., 2010
2009
On types of growth for graph-different permutations.
J. Comb. Theory, Ser. A, 2009
2008
Graph-Different Permutations.
SIAM J. Discret. Math., 2008
On the permutation capacity of digraphs
CoRR, 2008
2007
Cross-intersecting couples of graphs.
J. Graph Theory, 2007
On Cancellative Set Families.
Comb. Probab. Comput., 2007
2006
Pairwise colliding permutations and the capacity of infinite graphs.
SIAM J. Discret. Math., 2006
Appendix: On Common Information and Related Characteristics of Correlated Information Sources.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006
2005
Local chromatic number and Sperner capacity.
J. Comb. Theory, Ser. B, 2005
2003
Codes for a long silence.
IEEE Trans. Inf. Theory, 2003
2001
Compact Representations of the Intersection Structure of Families of Finite Sets.
SIAM J. Discret. Math., 2001
A Better Bound for Locally Thin Set Families.
J. Comb. Theory, Ser. A, 2001
Delta-systems and qualitative (in)dependence.
Electron. Notes Discret. Math., 2001
Relative capacity and dimension of graphs.
Discret. Math., 2001
Self-Similarity Bounds for Locally Thin Set Families.
Comb. Probab. Comput., 2001
A Note On Counting Very Different Sequences.
Comb. Probab. Comput., 2001
2000
Colour Number, Capacity, and Perfectness of Directed Graphs.
Graphs Comb., 2000
String Quartets In Binary.
Comb. Probab. Comput., 2000
Locally Thin Set Families.
Comb. Probab. Comput., 2000
Graph Pairs and their Entropies: Modularity Problems.
Comb., 2000
1999
On the Odd Cycles of Normal Graphs.
Discret. Appl. Math., 1999
1998
Zero-Error Information Theory.
IEEE Trans. Inf. Theory, 1998
On Clique Growth in Products of Directed Graphs.
Graphs Comb., 1998
1997
Tiling Hamming Space with Few Spheres.
J. Comb. Theory, Ser. A, 1997
1996
Tight Packings of Hamming Spheres.
J. Comb. Theory, Ser. A, 1996
1995
On the Extremal Combinatorics of the Hamming Space.
J. Comb. Theory, Ser. A, 1995
On the capacity of boolean graph formulæ.
Graphs Comb., 1995
Cancellative pairs of families of sets.
Eur. J. Comb., 1995
Intersection number and capacities of graphs.
Discret. Math., 1995
1994
Compressing inconsistent data.
IEEE Trans. Inf. Theory, 1994
Capacities: From Information Theory to Extremal Set Theory.
J. Comb. Theory, Ser. A, 1994
Different capacities of a digraph.
Graphs Comb., 1994
1993
1992
A Sperner-Type Theorem and Qualitative Independence.
J. Comb. Theory, Ser. A, 1992
Qualitative Independence and Sperner Problems for Directed Graphs.
J. Comb. Theory, Ser. A, 1992
Search problems for two irregular coins with incomplete feedback: the underweight model.
Discret. Appl. Math., 1992
Perfect couples of graphs.
Comb., 1992
1990
On the capacity of uniform hypergraphs.
IEEE Trans. Inf. Theory, 1990
Entropy splitting for antiblocking corners and perfect graphs.
Comb., 1990
1988
Random access communication and graph entropy.
IEEE Trans. Inf. Theory, 1988
Separating Partition Systems and Locally Different Sequences.
SIAM J. Discret. Math., 1988
Graphs that Split Entropies.
SIAM J. Discret. Math., 1988
New Bounds for Perfect Hashing via Information Theory.
Eur. J. Comb., 1988
1986
Addendum to "odd and even hamming spheres also have minimum boundary".
Discret. Math., 1986
1984
OPEC or a basic problem in source networks.
IEEE Trans. Inf. Theory, 1984
Selecting Non-consecutive Balls Arranged in Many Lines.
J. Comb. Theory, Ser. A, 1984
Odd and even hamming spheres also have minimum boundary.
Discret. Math., 1984
Coding for a write-once memory.
AT&T Bell Lab. Tech. J., 1984
1983
Successive encoding of correlated sources.
IEEE Trans. Inf. Theory, 1983
1982
Feedback does not affect the reliability function of a DMC at rates above capacity.
IEEE Trans. Inf. Theory, 1982
1981
Graph decomposition: A new key to coding theorems.
IEEE Trans. Inf. Theory, 1981
1980
Universally attainable error exponents for broadcast channels with degraded message sets.
IEEE Trans. Inf. Theory, 1980
Towards a general theory of source networks.
IEEE Trans. Inf. Theory, 1980
1979
How to encode the modulo-two sum of binary sources (Corresp.).
IEEE Trans. Inf. Theory, 1979
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.).
IEEE Trans. Inf. Theory, 1979
1978
Broadcast channels with confidential messages.
IEEE Trans. Inf. Theory, 1978
1977
Images of a set via two channels and their role in multi-user communication.
IEEE Trans. Inf. Theory, 1977
General broadcast channels with degraded message sets.
IEEE Trans. Inf. Theory, 1977
1975
Source coding with side information and a converse for degraded broadcast channels.
IEEE Trans. Inf. Theory, 1975
1973
Two-step encoding for finite sources.
IEEE Trans. Inf. Theory, 1973
