Imre Csiszár

Lóránt Farkas

Tamás Kói

IEEE Trans. Inf. Theory, 2021

2018

Expected Value Minimization in Information Theoretic Multiple Priors Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

2017

Error exponents for sparse communication.

[BibT_eX]

[DOI]

Lóránt Farkas

Tamás Kói

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Convergence of generalized entropy minimizers in sequences of convex problems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

An Information Geometry Problem in Mathematical Finance.

[BibT_eX]

[DOI]

Proceedings of the Geometric Science of Information - Second International Conference, 2015

2013

Secrecy Generation for Multiaccess Channel Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Measuring Model Risk

[BibT_eX]

[DOI]

CoRR, 2013

Information geometry in mathematical finance: Model risk, worst and almost worst scenarios.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Generalized Minimizers of Convex Integral Functionals and Pythagorean Identities.

[BibT_eX]

[DOI]

Proceedings of the Geometric Science of Information - First International Conference, 2013

On Oblivious Transfer Capacity.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities.

[BibT_eX]

[DOI]

Kybernetika, 2012

Minimization of entropy functionals revisited.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

On Information Theoretic Security: Mathematical Models and Techniques - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-51192188-9, 2011

2010

On rate of convergence of statistical estimation of stationary ergodic processes.

[BibT_eX]

[DOI]

Zsolt Talata

IEEE Trans. Inf. Theory, 2010

Capacity of a shared secret key.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Review of "Information theory and network coding" by Raymond W. Yeung, Springer, 2008.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Multiterminal secrecy generation.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

On minimization of multivariate entropy functionals.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Secrecy generation for multiple input multiple output channel models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Secrecy Capacities for Multiterminal Channel Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Axiomatic Characterizations of Information Measures.

[BibT_eX]

[DOI]

Entropy, 2008

On minimization of entropy functionals under moment constraints.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On Iterative Algorithms with an Information Geometry Background.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 11th International Conference, 2008

2007

A limit relation for entropy and channel capacity per unit cost.

[BibT_eX]

[DOI]

Fumio Hiai

Dénes Petz

CoRR, 2007

On Multiterminal Secrecy Capacities.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Context tree estimation for not necessarily finite memory processes, via BIC and MDL.

[BibT_eX]

[DOI]

Zsolt Talata

IEEE Trans. Inf. Theory, 2006

Generalized maximum likelihood estimates for exponential families.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2004

Secrecy capacities for multiple terminals.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On information closures of exponential families: a counterexample.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Information Theory and Statistics: A Tutorial.

[BibT_eX]

[DOI]

Paul C. Shields

Found. Trends Commun. Inf. Theory, 2004

Consistent estimation of the basic neighborhood of Markov random fields.

[BibT_eX]

[DOI]

Zsolt Talata

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Information closures of exponential families.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Information projections revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

A first course in information theory [Book Review].

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

2002

Large-scale typicality of Markov sample paths and consistency of MDL Order estimators.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

The secret key capacity for multiple terminals.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2000

Common randomness and secret key generation with a helper.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1999

MEM pixel correlated solutions for generalized moment and interpolation problems.

[BibT_eX]

[DOI]

Fabrice Gamboa

Elisabeth Gassiat

IEEE Trans. Inf. Theory, 1999

1998

The Method of Types.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Common Randomness in Information Theory and Cryptography - Part II: CR Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

1996

Redundancy rates for renewal and other processes.

[BibT_eX]

[DOI]

Paul C. Shields

IEEE Trans. Inf. Theory, 1996

1995

Channel capacity for a given decoding metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Review of 'Universal Compression and Retrieval' (Krichevsky, R.; 1994).

[BibT_eX]

IEEE Trans. Inf. Theory, 1995

Generalized cutoff rates and Renyi's information measures.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1993

Common randomness in information theory and cryptography - I: Secret sharing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

1992

Arbitrarily varying channels with general alphabets and states.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

1991

Capacity of the Gaussian arbitrarily varying channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1990

Entropy splitting for antiblocking corners and perfect graphs.

[BibT_eX]

[DOI]

Comb., 1990

1989

Capacity and decoding rules for classes of arbitrarily varying channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

1988

The capacity of the arbitrarily varying channel revisited: Positivity, constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

Arbitrarily varying channels with constrained inputs and states.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1987

Conditional limit theorems under Markov conditioning.

[BibT_eX]

[DOI]

Thomas M. Cover

Byoung-Seon Choi

IEEE Trans. Inf. Theory, 1987

1986

Hypothesis testing with communication constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

1982

Feedback does not affect the reliability function of a DMC at rates above capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

On the error exponent of source-channel transmission with a distortion threshold.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

Linear codes for sources and source networks: Error exponents, universal coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

1981

Graph decomposition: A new key to coding theorems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1981

To get a bit of information may be as hard as to get full information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1981

1980

Towards a general theory of source networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1980

1978

Broadcast channels with confidential messages.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1978

1976

Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1976

1974

On the computation of rate-distortion functions (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1974

1969

Simple Proofs of Some Theorems on Noiseless Channels

[BibT_eX]

[DOI]

Inf. Control., March, 1969

1967

Two Remarks to Noiseless Coding

[BibT_eX]

[DOI]