Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Broadcast channels with confidential messages

- I. Csiszár, J. Körner
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1 May 1978

Given two discrete memoryless channels (DMC's) with a common input, it is desired to transmit private messages to receiver 1 rate R_{1} and common messages to both receivers at rate R_{o} , while… Expand

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

- R. Ahlswede, I. Csiszár
- Computer Science
- IEEE Trans. Inf. Theory
- 1 July 1993

As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without… Expand

$I$-Divergence Geometry of Probability Distributions and Minimization Problems

- I. Csiszár
- Mathematics
- 1 February 1975

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and… Expand

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

- I. Csiszár, J. Körner
- Computer Science
- 1 December 1997

Csiszr and Krner's book is widely regarded as a classic in the field of information theory, providing deep insights and expert treatment of the key theoretical issues. It includes in-depth coverage… Expand

Secrecy capacities for multiple terminals

- I. Csiszár, P. Narayan
- Computer Science
- IEEE Transactions on Information Theory
- 1 December 2004

We derive single-letter characterizations of (strong) secrecy capacities for models with an arbitrary number of terminals, each of which observes a distinct component of a discrete memoryless… Expand

Information geometry and alternating minimization procedures

- I. Csiszár, G. Tusnády
- Computer Science
- 1984

- 497
- 64

Information Theory and Statistics: A Tutorial

- I. Csiszár, P. Shields
- Mathematics, Computer Science
- Found. Trends Commun. Inf. Theory
- 15 December 2004

This tutorial is concerned with applications of information theory concepts in statistics, in the finite alphabet setting. The information measure known as information divergence or Kullback-Leibler… Expand

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

- I. Csiszár
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1 July 1982

For Slepian-Wolf source networks, the error exponents obtained by Korner,Marton, and the author are shown to be universally attainable by linear codes also. Improved exponents are derived for linear… Expand

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

- I. Csiszár, P. Narayan
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1 March 1988

A well-known result of R. Ahlswede (1970) asserts that the deterministic code capacity of an arbitrarily varying channel (AVC), under the average-error-probability criterion, either equals its random… Expand

Hypothesis testing with communication constraints

- R. Ahlswede, I. Csiszár
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1 July 1986

A new class of statistical problems is introduced, involving the presence of communication constraints on remotely collected data. Bivariate hypothesis testing, H_{0}: P_{XY} against H_{1}:… Expand