Katalin Marton

According to our database1, Katalin Marton authored at least 15 papers between 1974 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Logarithmic Sobolev inequalities in discrete product spaces.
Comb. Probab. Comput., 2019

2001
Relative capacity and dimension of graphs.
Discret. Math., 2001

1993
On the Shannon Capacity of Probabilistic Graphs.
J. Comb. Theory B, 1993

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

Graphs that Split Entropies.
SIAM J. Discret. Math., 1988

New Bounds for Perfect Hashing via Information Theory.
Eur. J. Comb., 1988

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

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

1979
A coding theorem for the discrete memoryless broadcast channel.
IEEE Trans. Inf. Theory, 1979

How to encode the modulo-two sum of binary sources (Corresp.).
IEEE Trans. Inf. Theory, 1979

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

1974
Error exponent for source coding with a fidelity criterion.
IEEE Trans. Inf. Theory, 1974


  Loading...