KORNER, JANOS

KORNER, JANOS  

DIPARTIMENTO DI INFORMATICA  

Mostra prodotti
Risultati 1 - 20 di 95 (tempo di esecuzione: 0.033 secondi).
Titolo Data di pubblicazione Autore(i) File
A Better Bound for Locally Thin Set Families 2001 Fachini, Emanuela; Korner, Janos; Monti, Angelo
A new approach to rate-distortion theory 1986 Korner, Janos; Sgarro, A.
A note on counting very different sequences 2001 Fachini, Emanuela; Korner, Janos
A property of conditional entropy. 1971 Korner, Janos
A SPERNER-TYPE THEOREM AND QUALITATIVE INDEPENDENCE 1992 Korner, Janos; Gabor, Simonyi
About a combinatorial proof of the noisy channel coding theorem 1982 Korner, Janos
Addendum to "Odd and even Hamming spheres also have minimum boundary" 1986 Korner, Janos; Wei, V. K.
An extension of the class of perfect graphs 1973 Korner, Janos
Associate Editor Transactions on Information Theory 2011 Korner, Janos
Bounds on conditional probabilities with applications in multi-user communication 1976 Ahlswede, R.; Gacs, P.; Korner, Janos
Broadcast channels with confidential messages 1978 Csiszar, I.; Korner, Janos
Cancellative Pairs of Families 1995 Holzman, R; Korner, Janos
Capacities: from information theory to extremal set theory 1994 Gargano, L; Korner, Janos; Vaccaro, U.
Coding for a long silence 2003 Fachini, E; Korner, Janos
Coding for a write-once memory 1984 Korner, Janos; WYNER A., D; WOLF J., K; Ziv, J.
Coding of an information source having ambiguous alphabet and the entropy of graphs. 1971 Korner, Janos
Colour number, capacity and perfectness of directed graphs. 2000 Fachini, Emanuela; Korner, Janos
Common information is far less than mutual information. 1973 Gacs, P.; Korner, Janos
Compact representations of the intersection structure of families of finite sets 2001 Korner, Janos; Monti, Angelo
Comparison of two noisy channels 1975 Korner, Janos; Marton, K.