Katalin Marton

Publication Activity (10 Years)

Years Active: 1974-2019
Publications (10 Years): 1

Top Topics

Infinite Dimensional

Facet Defining Inequalities

Top Venues

Comb. Probab. Comput.

Publications

Katalin Marton
Logarithmic Sobolev inequalities in discrete product spaces. Comb. Probab. Comput. 28 (6) (2019)
János Körner, Katalin Marton
Relative capacity and dimension of graphs. Discret. Math. 235 (1-3) (2001)
Katalin Marton
On the Shannon Capacity of Probabilistic Graphs. J. Comb. Theory, Ser. B 57 (2) (1993)
János Körner, Katalin Marton
On the capacity of uniform hypergraphs. IEEE Trans. Inf. Theory 36 (1) (1990)
Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
Entropy splitting for antiblocking corners and perfect graphs. Comb. 10 (1) (1990)
János Körner, Katalin Marton
Graphs that Split Entropies. SIAM J. Discret. Math. 1 (1) (1988)
János Körner, Katalin Marton
Random access communication and graph entropy. IEEE Trans. Inf. Theory 34 (2) (1988)
János Körner, Katalin Marton
New Bounds for Perfect Hashing via Information Theory. Eur. J. Comb. 9 (6) (1988)
Katalin Marton
Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless. IEEE Trans. Inf. Theory 33 (3) (1987)
Katalin Marton
A simple proof of the blowing-up lemma. IEEE Trans. Inf. Theory 32 (3) (1986)
János Körner, Katalin Marton
How to encode the modulo-two sum of binary sources (Corresp.). IEEE Trans. Inf. Theory 25 (2) (1979)
Katalin Marton
A coding theorem for the discrete memoryless broadcast channel. IEEE Trans. Inf. Theory 25 (3) (1979)
János Körner, Katalin Marton
Images of a set via two channels and their role in multi-user communication. IEEE Trans. Inf. Theory 23 (6) (1977)
János Körner, Katalin Marton
General broadcast channels with degraded message sets. IEEE Trans. Inf. Theory 23 (1) (1977)
Katalin Marton
Error exponent for source coding with a fidelity criterion. IEEE Trans. Inf. Theory 20 (2) (1974)