Two-step encoding for finite sources. - János Körner; Giuseppe Longo (IEEE Trans. Inf. Theory, 1973)

Source coding with side information and a converse for degraded broadcast channels. - Rudolf Ahlswede; János Körner (IEEE Trans. Inf. Theory, 1975)

General broadcast channels with degraded message sets. - János Körner; Katalin Marton (IEEE Trans. Inf. Theory, 1977)

Images of a set via two channels and their role in multi-user communication. - János Körner; Katalin Marton (IEEE Trans. Inf. Theory, 1977)

Broadcast channels with confidential messages. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1978)

Reliability function of a discrete memoryless channel at rates above capacity (Corresp.). - Gunter Dueck; János Körner (IEEE Trans. Inf. Theory, 1979)

How to encode the modulo-two sum of binary sources (Corresp.). - János Körner; Katalin Marton (IEEE Trans. Inf. Theory, 1979)

Towards a general theory of source networks. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1980)

Universally attainable error exponents for broadcast channels with degraded message sets. - János Körner; Andrea Sgarro (IEEE Trans. Inf. Theory, 1980)

Graph decomposition: A new key to coding theorems. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1981)

Feedback does not affect the reliability function of a DMC at rates above capacity. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1982)

Successive encoding of correlated sources. - Thomas H. E. Ericson; János Körner (IEEE Trans. Inf. Theory, 1983)

Coding for a write-once memory. - Jack K. Wolf; Aaron D. Wyner; Jacob Ziv; János Körner (AT&T Bell Lab. Tech. J., 1984)

Odd and even hamming spheres also have minimum boundary. - János Körner; Victor K. Wei (Discret. Math., 1984)

Selecting Non-consecutive Balls Arranged in Many Lines. - Frank K. Hwang; János Körner; Victor K.-W. Wei (J. Comb. Theory A, 1984)

OPEC or a basic problem in source networks. - János Körner (IEEE Trans. Inf. Theory, 1984)

Addendum to "odd and even hamming spheres also have minimum boundary". - János Körner; Victor K. Wei (Discret. Math., 1986)

New Bounds for Perfect Hashing via Information Theory. - János Körner; Katalin Marton (Eur. J. Comb., 1988)

Graphs that Split Entropies. - János Körner; Katalin Marton (SIAM J. Discret. Math., 1988)

Separating Partition Systems and Locally Different Sequences. - János Körner; Gábor Simonyi (SIAM J. Discret. Math., 1988)

Random access communication and graph entropy. - János Körner; Katalin Marton (IEEE Trans. Inf. Theory, 1988)

Entropy splitting for antiblocking corners and perfect graphs. - Imre Csiszár; János Körner; László Lovász 001; Katalin Marton; Gábor Simonyi (Comb., 1990)

On the capacity of uniform hypergraphs. - János Körner; Katalin Marton (IEEE Trans. Inf. Theory, 1990)

Perfect couples of graphs. - János Körner; Gábor Simonyi; Zsolt Tuza (Comb., 1992)

Search problems for two irregular coins with incomplete feedback: the underweight model. - Luisa Gargano; János Körner; Ugo Vaccaro (Discret. Appl. Math., 1992)

Qualitative Independence and Sperner Problems for Directed Graphs. - Luisa Gargano; János Körner; Ugo Vaccaro (J. Comb. Theory A, 1992)

A Sperner-Type Theorem and Qualitative Independence. - János Körner; Gábor Simonyi (J. Comb. Theory A, 1992)

Sperner capacities. - Luisa Gargano; János Körner; Ugo Vaccaro (Graphs Comb., 1993)

Different capacities of a digraph. - Anna Galluccio; Luisa Gargano; János Körner; Gábor Simonyi (Graphs Comb., 1994)

Capacities: From Information Theory to Extremal Set Theory. - Luisa Gargano; János Körner; Ugo Vaccaro (J. Comb. Theory A, 1994)

Compressing inconsistent data. - János Körner; Mario Lucertini (IEEE Trans. Inf. Theory, 1994)

Intersection number and capacities of graphs. - János Körner (Discret. Math., 1995)

Cancellative pairs of families of sets. - Ron Holzman; János Körner (Eur. J. Comb., 1995)

On the capacity of boolean graph formulæ. - Luisa Gargano; János Körner; Ugo Vaccaro (Graphs Comb., 1995)

On the Extremal Combinatorics of the Hamming Space. - János Körner (J. Comb. Theory A, 1995)

Tight Packings of Hamming Spheres. - Emanuela Fachini; János Körner (J. Comb. Theory A, 1996)

Tiling Hamming Space with Few Spheres. - Henk D. L. Hollmann; János Körner; Simon Litsyn (J. Comb. Theory A, 1997)

On Clique Growth in Products of Directed Graphs. - János Körner (Graphs Comb., 1998)

Zero-Error Information Theory. - János Körner; Alon Orlitsky (IEEE Trans. Inf. Theory, 1998)

On the Odd Cycles of Normal Graphs. - Caterina De Simone; János Körner (Discret. Appl. Math., 1999)

Graph Pairs and their Entropies: Modularity Problems. - János Körner; Gábor Simonyi (Comb., 2000)

Locally Thin Set Families. - Noga Alon; Emanuela Fachini; János Körner (Comb. Probab. Comput., 2000)

String Quartets In Binary. - Noga Alon; János Körner; Angelo Monti (Comb. Probab. Comput., 2000)

Colour Number, Capacity, and Perfectness of Directed Graphs. - Emanuela Fachini; János Körner (Graphs Comb., 2000)

A Note On Counting Very Different Sequences. - Emanuela Fachini; János Körner (Comb. Probab. Comput., 2001)

Self-Similarity Bounds for Locally Thin Set Families. - Emanuela Fachini; János Körner; Angelo Monti (Comb. Probab. Comput., 2001)

Relative capacity and dimension of graphs. - János Körner; Katalin Marton (Discret. Math., 2001)

A Better Bound for Locally Thin Set Families. - Emanuela Fachini; János Körner; Angelo Monti (J. Comb. Theory A, 2001)

Compact Representations of the Intersection Structure of Families of Finite Sets. - János Körner; Angelo Monti (SIAM J. Discret. Math., 2001)

Delta-Systems and Qualitative (In)Dependence. - János Körner; Angelo Monti (J. Comb. Theory A, 2002)

Codes for a long silence. - Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2003)

Local chromatic number and Sperner capacity. - János Körner; Concetta Pilotto; Gábor Simonyi (J. Comb. Theory B, 2005)

Appendix: On Common Information and Related Characteristics of Correlated Information Sources. - Rudolf Ahlswede; János Körner (GTIT-C, 2006)

Pairwise colliding permutations and the capacity of infinite graphs. - János Körner; Claudia Malvenuto (SIAM J. Discret. Math., 2006)

On Cancellative Set Families. - János Körner; Blerina Sinaimeri (Comb. Probab. Comput., 2007)

Cross-intersecting couples of graphs. - Emanuela Fachini; János Körner (J. Graph Theory, 2007)

On the permutation capacity of digraphs - Gérard D. Cohen; Emanuela Fachini; János Körner (CoRR, 2008)

Graph-Different Permutations. - János Körner; Claudia Malvenuto; Gábor Simonyi (SIAM J. Discret. Math., 2008)

On types of growth for graph-different permutations. - János Körner; Gábor Simonyi; Blerina Sinaimeri (J. Comb. Theory A, 2009)

Permutation Capacities of Families of Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (SIAM J. Discret. Math., 2010)

Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition - Imre Csiszár; János Körner (Cambridge University Press, 2011)

Permutation Capacities and Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (Electron. Notes Discret. Math., 2011)

Families of Very Different Paths. - János Körner; Silvia Messuti; Gábor Simonyi (Electron. Notes Discret. Math., 2011)

Forbiddance and Capacity. - Emanuela Fachini; János Körner (Graphs Comb., 2011)

Skewincidence. - Gérard D. Cohen; Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2011)

Families of Graph-different Hamilton Paths. - János Körner; Silvia Messuti; Gábor Simonyi (SIAM J. Discret. Math., 2012)

More on Connector Families. - Gérard D. Cohen; Emanuela Fachini; János Körner (Electron. Notes Discret. Math., 2013)

Degree-Doubling Graph Families. - János Körner; Irene Muzi (SIAM J. Discret. Math., 2013)

Connector Families of Graphs. - Gérard D. Cohen; Emanuela Fachini; János Körner (Graphs Comb., 2014)

Zero-Error Capacity of Binary Channels With Memory. - Gérard D. Cohen; Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2016)

Path Separation by Short Cycles. - Gérard D. Cohen; Emanuela Fachini; János Körner (J. Graph Theory, 2017)

Hamilton Paths With Lasting Separation. - Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2017)

Families of locally separated Hamilton paths. - János Körner; Angelo Monti (J. Graph Theory, 2018)

On the size of pairwise-colliding permutations. - János Körner; Chandra Nair; David Ng (ISIT, 2019)

Interlocked Permutations. - Gérard D. Cohen; Emanuela Fachini; János Körner (SIAM J. Discret. Math., 2019)

Divergent permutations. - Emanuela Fachini; János Körner (J. Comb. Theory A, 2020)

Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein". - Alexander Barg; Lara Dolecek; Ryan Gabrys; Gyula O. H. Katona; János Körner; Andrew McGregor 001; Olgica Milenkovic; Sihem Mesnager; Gilles Zémor (IEEE Trans. Inf. Theory, 2021)

Codes with structured Hamming distance in graph families. - Anna Gujgiczer; János Körner; Gábor Simonyi (CoRR, 2022)

Structured Codes of Graphs. - Noga Alon; Anna Gujgiczer; János Körner; Aleksa Milojevic; Gábor Simonyi (SIAM J. Discret. Math., 2023)