Error exponent for source coding with a fidelity criterion. - Katalin Marton (IEEE Trans. Inf. Theory, 1974)

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)

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

A coding theorem for the discrete memoryless broadcast channel. - Katalin Marton (IEEE Trans. Inf. Theory, 1979)

A simple proof of the blowing-up lemma. - Katalin Marton (IEEE Trans. Inf. Theory, 1986)

Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless. - Katalin Marton (IEEE Trans. Inf. Theory, 1987)

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)

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)

On the Shannon Capacity of Probabilistic Graphs. - Katalin Marton (J. Comb. Theory B, 1993)

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

Logarithmic Sobolev inequalities in discrete product spaces. - Katalin Marton (Comb. Probab. Comput., 2019)