• Publications
  • Influence
Broadcast channels with confidential messages
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} , whileExpand
  • 2,964
  • 312
Open Access
Common randomness in information theory and cryptography - I: Secret sharing
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, withoutExpand
  • 1,098
  • 169
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
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 andExpand
  • 1,319
  • 166
Open Access
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition
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 coverageExpand
  • 1,862
  • 161
Secrecy capacities for multiple terminals
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 memorylessExpand
  • 377
  • 66
Open Access
Information Theory and Statistics: A Tutorial
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-LeiblerExpand
  • 575
  • 46
Open Access
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 linearExpand
  • 275
  • 44
The capacity of the arbitrarily varying channel revisited: Positivity, constraints
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 randomExpand
  • 263
  • 41
Open Access
Hypothesis testing with communication constraints
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
  • 187
  • 39